Skip to main content

A Hybrid Model for Optimising Distributed Data Mining

  • Conference paper
  • 304 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2918))

Abstract

This paper presents a hybrid model for improving the response time of distributed data mining (DDM). The hybrid DDM model uses cost formulae and prediction techniques to compute an estimate of the response time for a DDM process and applies a combination of client-server and mobile agent strategies based on the estimates to reduce the overall response time. Experimental results that establish the validity and demonstrate the improved response time of the hybrid model are presented.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaudhuri, S.: An Overview of Query Optimization in Relational Systems. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, Washington, June 1-3, pp. 34–43. ACM Press, New York (1998) ISBN 0-89791-996-3

    Chapter  Google Scholar 

  2. Chia, T., Kannapan, S.: Strategically Mobile Agents. In: Rothermel, K., Popescu-Zeletin, R. (eds.) MA 1997. LNCS, vol. 1219, pp. 149–161. Springer, Heidelberg (1997)

    Google Scholar 

  3. Fu, Y.: Distributed Data Mining: An Overview. Newsletter of the IEEE Technical Committee on Distributed Processing, Spring 2001, 5–9 (2001)

    Google Scholar 

  4. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Massachusetts (1997)

    MATH  Google Scholar 

  5. Kargupta, H., Kamath, C., Chan, P.: Distributed and Parallel Data Mining: Emergence, Growth and Future Directions. In: Kargupta, H., Chan, P. (eds.) Advances in Distributed Data Mining, pp. 407–416. AAAI Press, Menlo Park (1999)

    Google Scholar 

  6. Krishnaswamy, S., Loke, S.W., Zaslavsky, A.: Application Run Time Estimation: A QoS Metric for Web-based Data Mining Service Providers. In: 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, pp. 1153–1159. ACM Press, New York (2002)

    Google Scholar 

  7. Krishnaswamy, S., Zaslavsky, A., Loke, S.W.: An Architecture to Support Distributed Data Mining Services in E-Commerce Environments. In: Proceedings of the 2nd International Workshop on Advanced Issues of ECommerce and Web-Based Information Systems (WECWIS 2000), Milipitas, CA, USA, June 2000, pp. 239–246. IEEE Press, Los Alamitos (2000)

    Chapter  Google Scholar 

  8. Krishnaswamy, S., Zaslavsky, A., Loke, S.W.: Techniques for Estimating the Computation and Communication Costs of Distributed Data Mining. In: Proceedings of International Conference on Computational Science (ICCS 2002) – Part I. Lecture Notes in Computer Science (LNCS), vol. 2331, pp. 603–612. Springer, Heidelberg (2002)

    Google Scholar 

  9. Martello, S., Toth, P.: Knapsack Problems. In: Algorithms and Computer Implementations, John Wiley and Sons Ltd., England (1990)

    Google Scholar 

  10. Parthasarathy, S., Subramonian, R.: An Interactive Resource-Aware Framework for Distributed Data Mining. Newsletter of the IEEE Technical Committee on Distributed Processing, Spring 2001, 24–32 (2001)

    Google Scholar 

  11. Straßer, M., Schwehm, M.: A Performance Model for Mobile Agent Systems. In: Arabnia, H. (ed.) Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 1997), CSREA, vol. II, pp. 1132–1140 (1997)

    Google Scholar 

  12. Turinsky, A., Grossman, R.: A Framework for Finding Distributed Data Mining Strategies that are Intermediate between Centralized Strategies and In-place Strategies. In: Workshop on Distributed and Parallel Knowledge Discovery at KDD-2000, Boston, pp. 1–7 (2000)

    Google Scholar 

  13. Zaki, M.J., Pan, Y.: Introduction: Recent Developments in Parallel and Distributed Data Mining. Journal of Distributed and Parallel Databases 11(2), 123–127 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krishnaswamy, S., Zaslavsky, A., Loke, S.W. (2003). A Hybrid Model for Optimising Distributed Data Mining. In: Das, S.R., Das, S.K. (eds) Distributed Computing - IWDC 2003. IWDC 2003. Lecture Notes in Computer Science, vol 2918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24604-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24604-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20745-0

  • Online ISBN: 978-3-540-24604-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics