Shonali Krishnaswamy
Seng Wai Loke
ABSTRACT
The emergence of Application Service Providers (ASP) hosting Internet-based data mining services is being seen as a viable alternative for organisations that value their knowledge resources but are constrained by the high cost of data mining software. Response time is an important Quality of Service (QoS) metric for web-based data mining service providers. The ability to estimate the response time of data mining algorithms apriori benefits both clients and service providers. The advantage for the clients is that it helps to impose QoS constraints on the service level agreements and the benefit for the service-providers is that it facilitates optimising resource utilisation and scheduling. In this paper we present a novel rough sets based technique for identifying similarity templates to estimate application run times. We also present experimental results and analysis of this technique.
- digiMine --- URL: http://www.digiMine.comGoogle Scholar
- Downey,A,B., (1997), "Predicting Queue Times on Space-Sharing Parallel Computers", Proceedings of the Eleventh International Parallel Processing Symposium (IPPS), Geneva, Switzerland, April. Google ScholarDigital Library
- Gibbons,R., (1997), "A Historical Application Profiler for Use by Parallel Schedulers", Lecture Notes in Computer Science (LNCS), 1291, Springer-Verlag, pp.58-75. Google ScholarDigital Library
- Hu,X., (1995), "Knowledge Discovery in Databases: An Attribute-Oriented Rough sets Approach", PhD Thesis. University of Regina, Canada. Google ScholarDigital Library
- Information Discovery - URL: http://www.datamine.aa.psiweb.comGoogle Scholar
- Komorowski,J., Pawlak,Z., Polkowski,L., and Skowron, A., (1998), "Rough sets: A Tutorial", in Rough-Fuzzy Hybridization: A New Trend in Decision Making, (eds) S. K. Pal and A. Skowron, Springer-Verlag, pp. 3-98.Google Scholar
- 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 Appraoch", Journal of Electronic Commerce Research-Special Issue on Electronic Commerce and Service Operations, Vol. 2, Number 3, http://www.csulb.au/journals/jecrGoogle Scholar
- Pawlak,Z., (1992), "Rough sets: Theoretical Aspects of Reasoning about Data", Kluwer Academic Publishers, London. Google ScholarDigital Library
- Sahai,A., Ouyang, J., Machiraju,V., and Werster, K., (2001), "BizQoS: specifying and Gauranteeing Quality of Service for Web Services through Real Time Measurement and Adaptive Control", Hewlett-Packard Labs Technical Report HPL-2001-96, http://www.hpl.hp.com/techreports/2001/HPL-2001-134.htmlGoogle Scholar
- Sarawagi,S., and Nagaralu,S,H., (2000), "Data Mining Models as Services on the Internet", SIGKDD Explorations, Vol. 2, Issue. 1, http://www.acm.org/sigkdd/explorations/ Google ScholarDigital Library
- Smith,W., Foster, I, and Taylor, V., (1998), "Predicting Application Run Times Using Historical Information", in Proc. of the IPPS/SPDP '99 Workshop on Job Scheduling Strategies for Parallel Processing. Google ScholarDigital Library
- Tewari,G., and Maes,P., (2000), "A Generalized Platform for the Specification, Valuation, and Brokering of Heterogeneous Resources in Electronic Markets", in Lecture Notes in Artificial Intelligence (LNAI), 2033, Springer-Verlag, pp.7-24. Google ScholarDigital Library
- Web Quality of Service (WebQoS), (2001), Hewlett-Packard, Technical White Paper, http://www.hp.com/products1/webqos/infolibrary/whitepapers/wp.htmlGoogle Scholar
- Wolter, K., and Moorsel,A., (2001), "The Relationship between Quality of Service and Business Metrics: Monitoring, Notification and Optimization", Hewlett-Packard Labs Technical Report HPL-2001-96.Google Scholar
Index Terms
- Application run time estimation: a quality of service metric for web-based data mining services
Recommendations
Imperialist competitive algorithm with PROCLUS classifier for service time optimization in cloud computing service composition
CSSICA is proposed to find the lowest service time for cloud composite services.PROCLUS is used to divide service providers into 3 categories based on service time.Selection probability of categories is calculated using their average service ...
Web Services Integration on Data Mining Based on SOA
IPTC '10: Proceedings of the 2010 International Symposium on Intelligence Information Processing and Trusted ComputingData mining and scoring tool providers require users to use provider-specific ways to invoke their services. The provider-specific approach could be a major factor affecting why data mining tools and applications are not currently as widespread as one ...
An efficient service composition using frequent service sequence patterns over extended web service architecture
In the current business scenario business processes are realised using a stack of simple services selected from service repository to satisfy the business requirement of an enterprise or organisation. The service composition methodologies in common ...
Comments