Skip to main content
SpringerLink
Log in

BK-means Algorithm with Minimal Performance Degradation Caused by Improper Initial Centroid

  • Conference paper
Mobile, Ubiquitous, and Intelligent Computing

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

Abstract

K-means algorithm has the performance degradation problem due to improper initial centroids. In order to solve the problem, we suggest BK-means (Balanced K-means) algorithm to cluster documents. This algorithm uses the value, α, to adjust each cluster weight which is first defined in this paper. We compared the algorithm to the general K-means algorithms on Reutor-21578. The experimental results show about 11% higher performance than that of the general K-means algorithm with the balanced F Measure (BFM).

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

Access this chapter

Log in via an institution
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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027–1035. Society for Industrial and Applied Mathematics Philadelphia (2007)

    Google Scholar 

  2. Manning, C., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)

    Google Scholar 

  3. Liu, T., Liu, S., Chen, Z., Ma, W.Y.: An evaluation on feature selection for text clustering. In: Proceedings of the Twentieth International Conference, pp. 488–495. AAAI Press, Washington, DC (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Electronics and Information Engineering Department, Chonbuk National University, Jeonju, Korea

    Hoon Jo

  2. Division of Electronics and Information Engineering Department and IT Convergence Research Center, Chonbuk National University, Jeonju, Korea

    Soon-cheol Park

Authors
  1. Hoon Jo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soon-cheol Park
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoon Jo .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Seoul University of Science & and Technology (SeoulTech), Seoul, Korea, Republic of (South Korea)

    James J. (Jong Hyuk) Park

  2. Biomedical Informatics Neuroscience, Ohio State University Center for Biomedical Engineering, Columbus, Ohio, USA

    Hojjat Adeli

  3. Dept of Computer Education, Jeju National University Teachers College, Jeju Special Self-Governing Province, Korea, Republic of (South Korea)

    Namje Park

  4. Ryerson University Dept. Computer Science, Toronto, Ontario, Canada

    Isaac Woungang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jo, H., Park, Sc. (2014). BK-means Algorithm with Minimal Performance Degradation Caused by Improper Initial Centroid. In: Park, J., Adeli, H., Park, N., Woungang, I. (eds) Mobile, Ubiquitous, and Intelligent Computing. Lecture Notes in Electrical Engineering, vol 274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40675-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40675-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40674-4

  • Online ISBN: 978-3-642-40675-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation