Skip to main content

Knee Point Detection in BIC for Detecting the Number of Clusters

  • Conference paper
Advanced Concepts for Intelligent Vision Systems (ACIVS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5259))

Abstract

Bayesian Information Criterion (BIC) is a promising method for detecting the number of clusters. It is often used in model-based clustering in which a decisive first local maximum is detected as the number of clusters. In this paper, we re-formulate the BIC in partitioning based clustering algorithm, and propose a new knee point finding method based on it. Experimental results show that the proposed method detects the correct number of clusters more robustly and accurately than the original BIC and performs well in comparison to several other cluster validity indices.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Milligan, G.W., Cooper, M.C.: An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179 (1985)

    Article  Google Scholar 

  2. Dimitriadou, E., Dolnicar, S., Weingassel, A.: An examination of indexes for determining the number of clusters in binary data sets. Psychometrika 67(1), 137–160 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Calinski, T., Harabasz, J.: A dendrite method for cluster analysis. Communication in statistics 3, 1–27 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dunn, J.C.: Well separated clusters and optimal fuzzy partitions. Journal of Cybernetica 4, 95–104 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bezdek, J.C., Pal, N.R.: Some new indexes of cluster validity. IEEE Transactions on Systems, Man and Cybernetics, Part B 28(3), 301–315 (1998)

    Article  Google Scholar 

  6. Davies, D.L., Bouldin, D.W.: Cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence 1(2), 95–104 (1979)

    Google Scholar 

  7. Xie, X.L., Beni, G.: A validity measure for fuzzy clustering. IEEE Trans. on Pattern Analysis and Machine Intelligence 13(8), 841–847 (1991)

    Article  Google Scholar 

  8. Kass, R.E., Raftery, A.: Bayes factors. Journal of the American Statistical Association 90(430), 773–795 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Frayley, C., Raftery, A.: How many clusters? Which clustering method? answers via model-based cluster analysis. Technical Report no. 329, Department of Statistics, University of Washington (1998)

    Google Scholar 

  10. Pelleg, D., Moore, A.: X-means: Extending K-means with efficient estimation of the number of clusters. In: Proceeding of the 17th International Conference on Machine Learning, pp. 727–734 (2000)

    Google Scholar 

  11. Krzanowski, W.J., Lai, Y.T.: A criterion for determining the number of groups in a data set using sum-of-squares clustering. Biometrics 44(1), 23–34 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  12. Salvador, S., Chan, P.: Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms. In: Proceeding of the 16th IEEE International Conference on Tools with Artificial Intelligence, pp. 576–584 (2004)

    Google Scholar 

  13. Kass, R.E., Wasserman, L.: A reference Bayesian test for nested Hypotheses and its relationship to the Schwarz Criterion. Journal of the American Statistical Association 90(431), 928–934 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fränti, P., Kivijärvi, J.: Randomized local search algorithm for the clustering problem. Pattern Analysis and Applications 3(4), 358–369 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, Q., Hautamaki, V., Fränti, P. (2008). Knee Point Detection in BIC for Detecting the Number of Clusters. In: Blanc-Talon, J., Bourennane, S., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2008. Lecture Notes in Computer Science, vol 5259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88458-3_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88458-3_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88457-6

  • Online ISBN: 978-3-540-88458-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics