Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
HCS clustering algorithm
open-in-new
<p>The <a href="https://www.researchgate.net/publication/222648006_A_clustering_algorithm_based_on_graph_connectivity">HCS (Highly Connected Subgraphs) clustering algorithm</a> (also known as the HCS algorithm, and other names such as Highly Connected Clusters/Components/Kernels) is an algorithm based on graph connectivity for <a href="/facts/Cluster_analysis/HUeDnWPt">cluster analysis</a>. It works by representing the similarity data in a similarity graph, and then finding all the highly connected subgraphs. It does not make any prior assumptions on the number of the clusters. This algorithm was published by Erez Hartuv and <a href="/facts/Ron_Shamir/VFUsNco9">Ron Shamir</a> in 2000. </p><p>The HCS algorithm gives a clustering solution, which is inherently meaningful in the application domain, since each solution cluster must have diameter 2 while a union of two solution clusters will have diameter 3. </p>