Skip to main content

High-performance knowledge extraction from data on PC-based networks of workstations

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1999)

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

Included in the following conference series:

Abstract

The automatic construction of classifiers (programs able to correctly classify data collected from the real world) is one of the major problems in pattern recognition and in a wide area related to Artificial Intelligence, including Data Mining. In this paper we present G-Net, a distributed algorithm able to infer classifiers from pre-collected data, and its implementation on PC-based Networks of Workstations (PC-NOWs). In order to effectively exploit the computing power provided by PC-NOWs, G-Net incorporates a set of dynamic load distribution techniques that allow it to adapt its behavior to variations in the computing power due to resource contention. Moreover, it is provided with a fault tolerance scheme that enables it to continue its computation even if the majority of the machines become unavailable during its execution.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anglano, C., Giordana, A., and Lo Bello, G. High Performance Knowledge Extraction from Data on PC-based Networks of Workstations. Tech. rep. Available from http://www.di.unito.it/~mino/papers.html.

    Google Scholar 

  2. Anglano, C., Giordana, A., Lo Bello, G., and Saitta, L. A Network Genetic Algorithm for Concept Learning. In Proceedings of the 7th International Conference on Genetic Algorithms (East Lansing, MI, July 1997), Morgan Kaufman.

    Google Scholar 

  3. Anglano, C., Giordana, A., Lo Bello, G., and Saitta, L. An Experimental Evaluation of Coevolutive Concept Learning. In Proceedings of the 15th International Conference on Machine Learning (Madison, WI, July 1998), Morgan Kaufman.

    Google Scholar 

  4. Dehaspe, L., Toivonen, H., and King, R. Finding frequent substructures in chemical compounds. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (New York, NY, August 1998), AAAI Press, pp. 30–36.

    Google Scholar 

  5. Fayyad, U. Data Mining and Knowledge Discovery: Making Sense out of Data. IEEE Expert 11, 5 (1996), 20–25. October 1996.

    Article  Google Scholar 

  6. Goldberg, D.Genetic Algorithms. Addison-Wesley, Reading, MA, 1989.

    MATH  Google Scholar 

  7. Harchol-Balter, M., Crovella, M., and Murta, C. On Choosing a Task Assignment Policy for a Distributed Server System. In Proceedings of the 10th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (1998), Springer-Verlag.

    Google Scholar 

  8. Hui, C., and Chanson, S. Theoretical Analysis of the Heterogeneous Dynamic Load-Balancing Problem Using a Hydrodynamic Approach. Journal of Parallel and Distributed Computing 43, 2 (June 1997).

    Google Scholar 

  9. King, R., Srinivasan, A., and Stenberg, M. Relating chemical activity to structure: an examination of ILP successes. New Generation Computing 13 (1995).

    Google Scholar 

  10. Piatetsky-Shapiro, G., and Frawley W., Eds., Knowledge Discovery in Databases. AAAI Press/ The MIT Press, Menlo Park, CA, 1991.

    Google Scholar 

  11. Potter, M.The design and analysis of a computational model of cooperative coevolution. PhD thesis, George Mason University, Fairfax, VA, 1997.

    Google Scholar 

  12. Potter, M., De Jong, K., and Grefenstette, J. A coevolutionary approach to learning sequential decision rules. In 6th Int. Conf. on Genetic Algorithms (Pittsburgh, PA, 1995), Morgan Kaufmann, pp. 366–372.

    Google Scholar 

  13. Sunderam, V. S., Geist, G. A., Dongarra, J., and Manchek, R. The PVM concurrent computing system: evolution, experiences, and trends. Parallel Computing 20, 4 (April 1994), 531–45.

    Article  MATH  Google Scholar 

  14. Weber, R. On the Optimal Assignment of Customers to Parallel Servers. Journal of Applied Probability 15 (1978), 406–413.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cosimo Anglano .

Editor information

José Rolim Frank Mueller Albert Y. Zomaya Fikret Ercal Stephan Olariu Binoy Ravindran Jan Gustafsson Hiroaki Takada Ron Olsson Laxmikant V. Kale Pete Beckman Matthew Haines Hossam ElGindy Denis Caromel Serge Chaumette Geoffrey Fox Yi Pan Keqin Li Tao Yang G. Chiola G. Conte L. V. Mancini Domenique Méry Beverly Sanders Devesh Bhatt Viktor Prasanna

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Anglano, C., Giordana, A., Bello, G.L. (1999). High-performance knowledge extraction from data on PC-based networks of workstations. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097998

Download citation

  • DOI: https://doi.org/10.1007/BFb0097998

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65831-3

  • Online ISBN: 978-3-540-48932-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics