Skip to main content

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

Included in the following conference series:

Abstract

We highlight a partition clustering method, which proposes an experimental solution to the famous problem of automatic discovery of the number of clusters (k). The majority of partition clustering methods consider the manual valuation of k. Manual valuation of k may be interesting for specific domains of applications where the expert has an accurate idea of the number of clusters he wants, however it is unrealistic for generic applications, and needs important estimation efforts without any insurance of their efficiencies.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. T. Calinski and J. Harabasz. A dendrite method for cluster analysis. Communications in Statistics, (3):1–27, 1974.

    Article  MathSciNet  Google Scholar 

  2. Cohen A., Daubechies I., Feauveau J., “Bi-orthogonal bases of compactly supported wavelets. Comm. Pure Appl. Math., 45:485–560, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  3. Dubes R. C., “How many clusters are best?-an experiment”, Pattern Recognition Journal, 20, 6, pages 645–663, Nov. 1 1987.

    Article  Google Scholar 

  4. David Gibson, Jon Kleinberg, Prabhakar Raghavan, Clustering Categorical Data: An Approach Based on Dynamical Systems, Proc. 24 th VLDB conference, New York, USA, 1998.

    Google Scholar 

  5. Rainer Koschke and Thomas Eisenbarth. A framework for experimental evaluation of clustering techniques, International Workshop on Program Comprehension (IWPC’2000), Limerick, Ireland, June 10–11, 2000.

    Google Scholar 

  6. Leonard Kaufman and Peter J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, March 1990.

    Google Scholar 

  7. McQueen J., “Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pages 281–297, 1967.

    Google Scholar 

  8. G. W. Milligan and M. C. Cooper. An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50(1):159–179, 1985.

    Article  Google Scholar 

  9. Raymond T. Ng and Jiawei Han. Efficient and effective clustering methods for spatial data mining. Technical Report TR-94-13, Department of Computer Science, University of British Columbia, May 1994.

    Google Scholar 

  10. Gholamhosein Sheikholeslami, Surojit Chatterjee, Aidong Zhang, WaveCluster: a wavelet-based clustering approach for spatial data in very large databases”, The VLDB Journal, Volume 8 Issue 3–4 (2000) pp 289–304, ISSN: 1066-8888.

    Article  Google Scholar 

  11. H. D. Vinod. Integer programming and the theory of grouping. Journal of the American Statistical Association, 64(326):506–519, June 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernandez, G., Meckaouche, A., Peter, P., Djeraba, C. (2002). Intelligent Image Clustering. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds) XML-Based Data Management and Multimedia Engineering — EDBT 2002 Workshops. EDBT 2002. Lecture Notes in Computer Science, vol 2490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36128-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-36128-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36128-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics