IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38427-1_134.html
   My bibliography  Save this book chapter

Application Research of Modified K-Means Clustering Algorithm

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Guo-li Liu

    (Hebei University of Technology)

  • You-qian Tan

    (Hebei University of Technology)

  • Li-mei Yu

    (Hebei University of Technology)

  • Jia Liu

    (Hebei University of Technology)

  • Jin-qiao Gao

    (Hebei University of Technology)

Abstract

This paper presents an efficient algorithm called K-harmonic means clustering algorithm with simulated annealing, for reducing the dependence of the initial values and overcoming to converge to local minimum. The proposed algorithm works by that K-harmonic means algorithm solves the problem that clustering result is sensitive to the initial valves and simulated annealing makes the clustering jump out of local optimal solution at each iteration patterns. The clustering result is verified by experiments on analyzing IRIS dataset. The school XunTong is application software that is convenient to communication between parents and teachers. This paper applies the new algorithm to analysis of dataset in School XunTong and finds the relationship of students’ achievement and the communication between parents and teachers. Finally, the result of classification guides the learning direction of students in universities and cultivates to students.

Suggested Citation

  • Guo-li Liu & You-qian Tan & Li-mei Yu & Jia Liu & Jin-qiao Gao, 2013. "Application Research of Modified K-Means Clustering Algorithm," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 1269-1280, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38427-1_134
    DOI: 10.1007/978-3-642-38427-1_134
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-38427-1_134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.