Skip to main content

Using More Initial Centers for the Seeding-Based Semi-Supervised K-Harmonic Means Clustering

  • Conference paper
Emerging Technologies for Information Systems, Computing, and Management

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

  • 1518 Accesses

Abstract

In the initialization of the traditional semi-supervised k-means, the mean of some labeled data belonging to one same class was regarded as one initial center and the number of the initial centers is equal to the number of clusters. However, this initialization method using a small amount of labeled data also called seeds which are not appropriate for the semi-supervised k-harmonic means clustering insensitive to the initial centers. In this paper, a novel semi-supervised k-harmonic means clustering is proposed. Some seeds with one same class are divided into several groups and the mean of all data is viewed as one initial center in every group. Therefore, the number of the initial centers is more than the number of clusters in the new method. To investigate the effectiveness of the approach, several experiments are done on three datasets. Experimental results show that the presented method can improve the clustering performance compared to other traditional semi-supervised clustering algorithms.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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. Jain, A.K., et al.: Data clustering: a review. ACM Comput. Surv. 31(3), 256–323 (1999)

    Article  Google Scholar 

  2. Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645–678 (2005)

    Article  Google Scholar 

  3. Tou, J.T., Gonzalez, R.C.: Pattern Recognition Principles. Addison-Wesley, London (1974)

    MATH  Google Scholar 

  4. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)

    Book  MATH  Google Scholar 

  5. Krishnapuram, R., et al.: Low complexity fuzzy relational clustering algorithms for web mining. IEEE Trans. Fuzzy Syst. 9(4), 595–607 (2001)

    Article  Google Scholar 

  6. Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)

    Book  Google Scholar 

  7. Matinetz, T.M., et al.: Neural-gas network for vector quantization and its application to time-series prediction. IEEE Trans. Neural Netw. 4(4), 558–568 (1993)

    Article  Google Scholar 

  8. Zhang, B., Hus, M., Dayal, U.: K-harmonic means- a data clustering algorithm. Technical Report HPL-1999-124, Hewlett-Packard Laboratories (1999)

    Google Scholar 

  9. Zhang, B., Hsu, M., Dayal, U.: K-harmonic means. In: Proceedings of International Workshop on Temporal, Spatial and Spatio-temporal Data Mining, Lyon, France (2000)

    Google Scholar 

  10. Yang, F.Q., Sun, T.L., Zhang, C.H.: An efficient hybrid data clustering method based on k-harmonic means and particle swarm optimization. Expert Syst. Appl. 36(6), 9847–9852 (2009)

    Article  Google Scholar 

  11. Hammerly, C., Elkan, C.: Alternatives to the k-means algorithm that find better clusterings. In: Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 600–607 (2002)

    Google Scholar 

  12. Basu, S., Banerjee, A., Mooney, R.J.: Semi-supervised clustering by seeding. In: Proceedings of the Nineteenth International Conference on Machine Learning, pp. 27–34 (2002)

    Google Scholar 

  13. Grira, N., Crucianu, M., Boujemaa, N.: Active semi-supervised fuzzy clustering. Pattern Recogn. 41(5), 1834–1844 (2008)

    Article  MATH  Google Scholar 

  14. Runkler, T.A.: Partially supervised k-harmonic means clustering. In: Proceedings of IEEE Symposium on Computational Intelligence and Data Mining, pp. 96–103 (2011)

    Google Scholar 

  15. UCI Machine Learning Repository. http://www.ics.uci.edu/~mlearn/MLSummary.html

Download references

Acknowledgments

This research is supported by the Open Foundation of the Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, China (No.2011-01). This research is also supported by the Scientific Research Foundation of Nanjing University of Posts and Telecommunications (No.NY210078).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lei Gu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

Gu, L. (2013). Using More Initial Centers for the Seeding-Based Semi-Supervised K-Harmonic Means Clustering. In: Wong, W.E., Ma, T. (eds) Emerging Technologies for Information Systems, Computing, and Management. Lecture Notes in Electrical Engineering, vol 236. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7010-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7010-6_20

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7009-0

  • Online ISBN: 978-1-4614-7010-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics