0-Step K-Means for Clustering Wikipedia Search Results

From Wikipedia Quality
Revision as of 09:44, 25 November 2020 by Chané (talk | contribs) (0-Step K-Means for Clustering Wikipedia Search Results - creating a new article)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

0-Step K-Means for Clustering Wikipedia Search Results - scientific work related to Wikipedia quality published in 2011, written by Julian Szymański and Kamil Wegrzynowicz.

Overview

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.

Retrieved from "https://wikipediaquality.com/index.php?title=0-Step_K-Means_for_Clustering_Wikipedia_Search_Results&oldid=26114"