• DocumentCode
    3642069
  • Title

    0-Step K-means for clustering Wikipedia search results

  • Author

    Julian Szymański;Kamil Wegrzynowicz

  • Author_Institution
    Department of Electronic, Telecommunication and Informatics, Gdań
  • fYear
    2011
  • fDate
    6/1/2011 12:00:00 AM
  • Firstpage
    253
  • Lastpage
    257
  • Abstract
    This article describes an improvement for K-means algorithm and its application in the form of a system that clusters search results retrieved from Wikipedia. The proposed algorithm eliminates K-means disadvantages and allows one to create a cluster hierarchy. The main contributions of this paper include the following: (1) The concept of an improved K-means algorithm and its application for hierarchical clustering. (2) Description of the WikiClusterSearch system that employs the proposed algorithm to organize Wikipedia search results into clusters.
  • Keywords
    "Clustering algorithms","Measurement","Internet","Encyclopedias","Electronic publishing","Partitioning algorithms"
  • Publisher
    ieee
  • Conference_Titel
    Innovations in Intelligent Systems and Applications (INISTA), 2011 International Symposium on
  • Print_ISBN
    978-1-61284-919-5
  • Type

    conf

  • DOI
    10.1109/INISTA.2011.5946070
  • Filename
    5946070