Skip to main content

Robust Incremental Clustering with Bad Instance Orderings: A New Strategy

  • Conference paper
  • First Online:
Progress in Artificial Intelligence — IBERAMIA 98 (IBERAMIA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1484))

Included in the following conference series:

Abstract

It is widely reported in the literature that incremental clustering systems suffer from instance ordering effects and that under some orderings, extremely poor clusterings may be obtained. In this paper we present a new general strategy aimed to mitigate these effects, the Not-Yet strategy which has a general and open formulation and it is not coupled to any particular system. Unlike other proposals, this strategy maintains the incremental nature of learning process. In addition, we propose a classification of strategies to avoid ordering effects which clarifies the benefits and disadvantages we can expect from the proposal made in the paper as well from existing ones. A particular implementation of the Not-Yet strategy is used to conduct several experiments. Results suggest that the strategy improves the clustering quality. We also show that, when combined with other local strategies, the Not-Yet strategy allows the clustering system to get high quality clusterings.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Anderson and M. Matessa. Explorations of an incremental, bayesian algorithm for categorization. Machine Learning, (9):275–308, 1992. 141

    Google Scholar 

  2. J. Béjar. Adquisición automática de conocimiento en dominios poco estructurados. PhD thesis, Facultat d’Informàtica de Barcelona, UPC, 1995. 137, 145

    Google Scholar 

  3. U. Fayyad, G. Piatetsky-Shapiro, and P. Smyth. Knowledge discovery and data mining: towards a unifying framework. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD96, Portland, OR, 1996. AAAI Press. 146

    Google Scholar 

  4. D. H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, (2):139–172, 1987. 138, 141

    Google Scholar 

  5. D. H. Fisher. Optimization and simplification of hierarchical clusterings. Journal of Artificial Intelligence Research, (4):147–180, 1995. 137, 145

    Google Scholar 

  6. D. H. Fisher and P. Langley. Conceptual clustering and its relation to numerical taxonomy. In W. A. Gale, editor, Artificial Intelligence and Statistics. Addison-Wesley, Reading, MA, 1986. 136

    Google Scholar 

  7. D. H. Fisher, L. Xu, and N. Zard. Ordering effects in clustering. In Proceedings of the Ninth International Conference on Machine Learning, pages 163–168, 1992. 137

    Google Scholar 

  8. J. H. Gennari, P. Langley, and D. Fisher. Models of incremental concept formation. Artificial Intelligence, (40):11–61, 1989. 137, 141

    Article  Google Scholar 

  9. P. Langley. Order effects in incremental learning. In P. Reimann and H. Spada, editors, Learning in humans and machines: Towards an Interdisciplinary Learning Science. Pergamon, 1995. 136, 137

    Google Scholar 

  10. M. Lebowitz. Deferred commitment in unimem: waiting to learn. In Proceedings of the Fifth International Conference on Machine Learning, pages 80–86, 1988. 137, 145

    Google Scholar 

  11. R. S. Michalski and R. E. Stepp. Learning from observation: Conceptual clustering. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning: An Artificial intelligence approach, pages 331–363. Morgan Kauffmann, San Mateo, CA, 1983. 137

    Google Scholar 

  12. P.M. Murphy and D.W. Aha. Repository of machine learning. University of California at Ivrine. http://www.ics.uci.edu/mlearn/MLRpositoru.html . 141

  13. J. Roure. Study of methods and heuristics to improve the fuzzy classifications of LINNEO+. Master’s thesis, Facultat d’Informática de Barcelona, UPC, 1994. 145

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roure, J., Talavera, L. (1998). Robust Incremental Clustering with Bad Instance Orderings: A New Strategy. In: Coelho, H. (eds) Progress in Artificial Intelligence — IBERAMIA 98. IBERAMIA 1998. Lecture Notes in Computer Science(), vol 1484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49795-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-49795-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64992-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics