Talk:HCS clustering algorithm

There are plenty of sources and cites which can be found by "googling" "Erez Hartuv". For example, two works that builds (and cites) on HCS clustering algorithm are:

1. Mining coherent dense subgraphs across massive biological networks for functional discovery Haiyan Hu1, Xifeng Yan2, Yu Huang1, Jiawei Han2 and Xianghong Jasmine Zhou1,∗ Vol. 21 Suppl. 1 2005, pages i213–i221 doi:10.1093/bioinformatics/bti1049

They write in the article:"MODES is developed based on HCS (Mining Highly Connected Subgraphs) (Hartuv and Shamir, 2000), with two new features: (1) MODES..."

2.

My articles (listed at the References section at the end of the wiki page):

1. Hartuv, Erez, and Ron Shamir. "A clustering algorithm based on graph connectivity." Information processing letters 76, no. 4 (2000): 175-181. 2. E Hartuv, A O Schmitt, J Lange, S Meier-Ewert, H Lehrach, R Shamir. "An algorithm for clustering cDNA fingerprints." Genomics 66, no. 3 (2000): 249-256.

contains lots of sources and cites

Several heuristics are found in the original HCS paper that solves many problems that other authors tackled and solved in their versions of HCS. For example:Removing Low Degree Vertices in the early stage of HCS, and later add them to the clustering. In the wiki page its only breifly mentioned, please reffer to the articles for a colpette description. ErezHartuv (talk) 08:04, 18 August 2013 (UTC)[reply]