Supporting the optimisation of distributed data mining by predicting application run times

ICEIS 2002 - Proceedings of the 4th International Conference on Enterprise Information Systems

Volumn 1, Issue , 2002, Pages 374-381

  Krishnaswamy, Shonali ^a   Loke, Seng Wai ^b   Zaslavsky, Arkady ^a  

^a MONASH UNIVERSITY   (Australia)

^b RMIT UNIVERSITY   (Australia)

Author keywords

Distributed data mining; Optimisation; Predicting application run times

Indexed keywords

COSTS; FORECASTING; INFORMATION SYSTEMS;

DATA MINING TASKS; DISTRIBUTED DATA MINING; EXPERIMENTAL VALIDATIONS; OPTIMISATION TECHNIQUES; OPTIMISATIONS; PREDICTING APPLICATION RUN TIMES; PREDICTION ACCURACY; PRIORI KNOWLEDGE;

DATA MINING;

EID: 33749999018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. th Intl. Parallel Processing Symposium (IPPS), Geneva, Switzerland, April.
2. Fu, Y., (2001), "Distributed Data Mining: An Overview", in Newsletter of the IEEE Technical Committee on Distributed Processing, Spring 2001, pp. 5-9.
3. Gibbons, R., (1997), "A Historical Application Profiler for Use by Parallel Schedulers", Lecture Notes in Computer Science (LNCS), 1291, Springer-Verlag, pp. 58-75.
4. Hu, X., (1995), "Knowledge Discovery in Databases: An Attribute-Oriented Rough sets Approach", PhD Thesis, University of Regina, Canada.
5. Kamath, C., (2001), "The Role of Parallel and Distributed Processing in Data Mining", in Newsletter of the IEEE Technical Committee on Distributed Processing, Spring 2001, pp. 10-15.
6. 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.
7. Krishnaswamy, S., Loke, S, W., & Zaslavsky, A. (2000a). "Cost Models for Heterogeneous Distributed Data Mining", Proc. of the Twelfth Intl. Conf. on Software Engineering and Knowledge Engineering (SEKE), pp. 31-38.
8. Krishnaswamy, S., Zaslavsky, A., & Loke, S, W. (2000), "An Architecture to Support Distributed Data Mining Services in E-Commerce Environments", Proc. of the Second Intl. Workshop on Advanced Issues in E-Commerce and Web-Based Information Systems (WECWIS), pp. 238-246.
9. Krishnaswamy, S., Loke, S, W., & Zaslavsky, A, (2002), "Application Run Time Estimation: A Quality of Service Metric for Web-based Data Mining Services", To Appear in ACM Symposium on Applied Computing (SAC 2002), Madrid, March.
10. Parthasarathy, S., and Subramonian, R., (2001), "An Interactive Resource-Aware Framework for Distributed Data Mining", in Newsletter of the IEEE Technical Committee on Distributed Processing, Spring 2001, pp. 24-32.
11. Pawlak, Z., (1982), "Rough sets", International Journal of Computer and Information Sciences, Issue. 11, pp. 413-433.
12. Smith, W., Taylor, V., and Foster, I., (1999), "Using run-time predictions to estimate queue wait times and improve scheduler performance", Lecture Notes in Computer Science (LNCS), 1659, Springer-Verlag, pp. 202-229.
13. Turinsky, A., and Grossman, R., (2000), "A Framework for Findidng Distributed Data Mining Strategies that are Intermediate between centralized Strategies and In-place Strategies", Workshop on Distributed and Parallel Knowledge Discovery at KDD-2000, Boston, pp. 1-7.
14. Witten, I, H., and Eibe, F., (1999), "Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations", Morgan Kauffman.