Agent Aspects in Data

Mining E-Services
Shonali Krishnaswamy
School of Network Computing

EMAIL:
Shonali.Krishnaswamy@infotech.monash.edu.au

WWW:
http://neptune.netcomp.monash.edu.au/staff/shonali
Data Mining E-Services
data analysis and mining functions
themselves will be offered as business
intelligence e-services that accept
operational data from clients and return
models or rules
Umesh Dayal, 2001
Why?
Knowledge is a key resource
Cost of data mining infrastructure
Our Research
Hybrid model for delivering data mining
e-services
Integrate the client-server and mobile agent
models
Support delivery of differentiated services
Estimation of response time
Cost formulae for estimating mobile agent and
data transfer time
A rough sets based algorithm for estimating
application run times
Optimise Overall Response Time
Our Research
An interaction protocol & a specification
language

Aims
Delineate task request specification from sensitive task
specific details
Facilitate service provider selection through processes
such as matching, ranking and negotiation
Facilitate processing of the task following selection

Consists of 5 Message Specifications

Description of task requests
Description of service provider capabilities
Description of tasks
Description of access to client and service provider
resources
Prototype
Task Service Provider
Request XM L Description
Docum ent
Store

Client
DAM E
Matching Matching System
Rules Engine
Service
Provider
Multi-Strategy Ranking
Engine

Negotiation
Engine

Exchange Task Specific Information

Distributed Agent-based
Mining Environment (DAME)
Task Profile

Rough Sets tcom-

Estimator Estimator

Estimator

Cost Matrix IPerf Ping

History

tdm-Estimator Optimiser tcom-Estimator

Task Allocation
Algorithms

Task Allocation
Strategy

Task Controller

CSController MAController
Estimation Accuracy (1)
Estimated Vs. Actual Mobile Agent Transfer Time

200
180
160
Time (in Seconds)

140
120
ESTIMATE
100
ACTUAL
80
60
40
20
0
1 2 3 4 5 6 7 8 9 1011 121314 151617 1819 202122 232425
Experiment #
Estimation Accuracy (2)
Estimated Vs. Actual Data Transfer Times

80
Transfer Time (in Seconds)

70
60
50
Estimate
40
Actual
30
20
10
0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Experiments
Estimation Accuracy (3)
Estimated Vs. Actual Run Times of Data Mining
Algorithms

10
9
Run Time (in Minutes)

8
7
6
Estimate
5
Actual
4
3
2
1
0
1 2 3 4 5 6 7 8 9 101112131415161718192021222324252627
Experiments
Comparative Performance (1)
Hybrid Vs Mobile Agents Vs Client Server

250
Response Time (in minutes)

200

150 CS
MA-strict
100 Hybrid

50

0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Experiments
Comparative Performance (2)
Hybrid Model Vs. Mobile Agent Model with Local Data
Transfers

120
Response Time (in minutes)

100

80 MA - local data
transfers
60
Hybrid
40

20

0
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Experiments
Matching Engine
Matching Engine
Ranking Engine
Multi-strategy Ranking Model
Ranking Techniques
Multi Attribute Resource Intermediary (MARI)
Several Distance Measures
Global Ranking
Simple Heuristics
Negotiation Engine
Language
Our Specification language
Protocol
Exchange Offers till Accept, Time Limit
Reached or Reject
Strategy
Service-Oriented Negotiation Model (Farattin,
Jennings et al)
Negotiation Engine
Uses a utility function to handle multiple issues based on
preferences for the respective issues.
Linear combination of each utility value forms an expected
utility value for the negotiating parties.
An agents decision for counter-offer happens when the
expected utility value of the opponents counter offer is
greater than the new proposing offer.
Three mechanisms in the model
responsive, trade-off and issue manipulation.
Only the responsive mechanism is implemented
Within that only the time and behaviour dependent tactics
are implemented
Matching Engine
Matching Engine
Matching Engine
Ongoing Work
Anytime, Anywhere Data Mining Services
QoS modelling and estimation for e-
services
Including semantic & ontological
constructs in the specification language
A sophisticated global ranking strategy
Probabilistic approach
Integration of the system and interface
for DAME
Acknowledgements
See Ek Pin (Scott)
Junien Ho (Ben)
Wijaya Gunawan

Seng Wai Loke

Arkady Zaslavsky
Publications
Krishnaswamy, S., Zaslasvky, A., and Loke, S.W., (2002), Internet Delivery of
Distributed Data Mining Services: Architectures, Issues and Prospects, Accepted
as a chapter in Architectural Issues of Web-enabled Electronic Business, IDEA
Publishing Group.

Krishnaswamy, S., Zaslavsky, A., and Loke, S,W., (2001), Towards Data Mining
Services on the Internet with a Multiple Service Provider Model: An XML Based
Approach, Journal of Electronic Commerce Research (Special issue on Electronic
Commerce and Service Operations), Vol. 2(3), August. ISSN 1526-6133.

Krishnaswamy,S., Loke,S,W., and Zaslavsky,A., (2000), Cost Models for

Heterogeneous Distributed Data Mining, Proceedings Of the Twelfth International
Conference on Software Engineering and Knowledge Engineering, Chicago,
Illinois, July 6-8.

Krishnaswamy, S., Zaslavsky, A., and Loke, S,W., (2000), An Architecture to

Support Distributed Data Mining Services in E-Commerce Environments,
Proceedings of the 2nd International Workshop on Advanced Issues of E-
Commerce and Web-Based Information Systems (WECWIS2000), Milipitas, CA,
USA, June 2000, IEEE Press. (ISBN 0-7695-0610-0).

Krishnaswamy, S., Zaslavsky, A., and Loke, S,W., (2001), Federated Data Mining
Services and a Supporting XML Markup Language, Proceedings of the 34th
Annual Hawaii International Conference on System Sciences (HICSS-34), Hawaii,
USA, January 2001. In the "e-Services: Models and Methods for Design,
Implementation and Delivery" mini-track of the "Decision Technologies for
Management" track, IEEE Press, ISBN 0-7695-0981-9.
 Krishnaswamy, S., Loke, S,W., and Zaslavsky, A., (2001), Knowledge Elicitation
Through Web-Based Data Mining Services, in Proceedings of the Workshop in
Advances in Learning Software Organizations (LSO 2001), Lecture Notes in Computer
Science 2176, Springer Verlag, pp. 120-134.

Krishnaswamy, S., Loke, S.W., and Zaslavsky, A., (2002), Application Run Time
Estimation: A QoS Metric for Web-based Data Mining Service Providers, Proceedings
of the Seventeenth ACM Symposium on Applied Computing (ACM SAC) 2002 in the
Special Track on WWW and E-business Applications. Madrid, Spain, March 10-14,
ACM Press.

Krishnaswamy, S., Loke, S.W., and Zaslavsky, A.,(2002), Supporting the Optimisation
of Distributed Data Mining by Predicting Application Run Times, Proceedings of the
Fourth International Conference on Enterprise Information Systems (ICEIS 2002), April
3-6, Ciudad Real, Spain, pp. 374-381.

Krishnaswamy, S., Zaslasvky, A., and Loke, S.W., (2002), Techniques for Estimating
the Computation and Communication Costs of Distributed Data Mining, Accepted at
the International Conference on Computational Science (ICCS2002). Lecture Notes in
Computer Science (LNCS). Springer-Verlag. April 2002.

Krishnaswamy, S., Zaslasvky, A., and Loke, S.W., (2002), Predicting Application Run
Times Using Rough Sets, Accepted at the Ninth International Conference on
Information Processing and Management of Uncertainty in Knowledge-Based Systems
(IPMU 2002). July. IEEE Press.

Krishnaswamy, S., See, E, P., Ho, J, N., and Gunawan, W., (2002), An XML
Specification Language to Support a Virtual Marketplace of Data Mining E-services,
Accepted for publication in the Proceedings of the International Workshop on Data
Semantics in Web Information Systems (DASWIS 2002), To be held in conjunction with
the Third International Conference on Web Information Systems Engineering (WISE
2002), Singapore, 11th December, IEEE Press