Skip to main content

Research on a New Clustering Validity Index Based on Data Mining

  • Conference paper
  • First Online:
Frontier Computing (FC 2018)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 542))

Included in the following conference series:

  • 66 Accesses

Abstract

Clustering analysis has made great achievements in the development process, but there are still many problems in it. In this paper, the question on determining optimal number of clusters in cluster analysis is studied mainly. The KMIBCP (K-means Intra-Between-cluster partition) in K-means clustering algorithm is proposed. KMIBCP algorithm uses IBCP (Intra-Between-cluster partition) validity index to analyze the validity of clustering results produced by K-means clustering algorithm, and to determine optimal number of clusters. The experimental results on artificial datasets verify the effectiveness of the proposed algorithm.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Frey, B., Dueck, D.: Clustering by passing messages between data point. Science 315(5814), 972–976 (2016)

    Article  MathSciNet  Google Scholar 

  2. Frey, B., Dueck, D.: Response to comment on “clustering by passing messages between data points”. Science 319(5864), 72–80 (2008)

    Article  Google Scholar 

  3. Chan, C.: Clustering design of big data based on MIP and improved fuzzy K-means algorithm. Comput. Meas. Control. 22(4), 1270–1272 (2014)

    Google Scholar 

  4. Chang, D., Zhang, X.: A genetic algorithm with gene rearrangement for K-means clustering. Pattern Recogn. 42(7), 1210–1222 (2009)

    Article  Google Scholar 

  5. Cheng, Y.: Research on Hybrid Recommendation Algorithm for P2P Net Loan Products. South China University of Technology (2016)

    Google Scholar 

  6. Dembélé, D., Kastner, P.: Fuzzy C-means method for clustering microarray fata. Bioinformatics 19(8), 973–980 (2013)

    Article  Google Scholar 

  7. Huang, J.: Automated variable weighting in K-means type clustering. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 657–668 (2015)

    Article  Google Scholar 

  8. Krishna, K., Murty, M.N.: Genetic K-means algorithm. IEEE Trans. Syst., Man Cybern.-Part B: Cybern. 29(3), 433–439 (1999)

    Article  Google Scholar 

  9. Brusco, M., Köhn, H.: Comment on “clustering by passing messages between data points”. Science 319(5864), 22–81 (2008)

    Article  Google Scholar 

  10. Wang, Z., Liu, G.: A K-means algorithm for optimizing the initial center point. Pattern Recog. Artif. Intell. 22(2), 299–304 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chaobo Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, C. (2019). Research on a New Clustering Validity Index Based on Data Mining. In: Hung, J., Yen, N., Hui, L. (eds) Frontier Computing. FC 2018. Lecture Notes in Electrical Engineering, vol 542. Springer, Singapore. https://doi.org/10.1007/978-981-13-3648-5_220

Download citation

Publish with us

Policies and ethics