HCS clustering algorithm
The HCS (Highly Connected Subgraphs) clustering algorithm (also known as the HCS algorithm, and other names such as Highly Connected Clusters/Components/Kernels) is an algorithm based on graph connectivity for cluster analysis. It works by representing the similarity data in a , 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 Ron Shamir in 2000.
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
HCS clustering algorithm
The HCS (Highly Connected Subgraphs) clustering algorithm (also known as the HCS algorithm, and other names such as Highly Connected Clusters/Components/Kernels) is an algorithm based on graph connectivity for cluster analysis. It works by representing the similarity data in a , 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 Ron Shamir in 2000.
has abstract
The HCS (Highly Connected Subg ...... clusters will have diameter 3.
@en
Link from a Wikipage to an external page
Wikipage page ID
39,226,029
page length (characters) of wiki page
Wikipage revision ID
954,416,872
Link from a Wikipage to another Wikipage
class
time
O
@en
wikiPageUsesTemplate
subject
hypernym
comment
The HCS (Highly Connected Subg ...... Hartuv and Ron Shamir in 2000.
@en
label
HCS clustering algorithm
@en