A Betweenness Centrality Guided Clustering Algorithm and Its Applications to Cancer Diagnosis

Author(s):  
R. Jothi
2012 ◽  
Vol 51 (2) ◽  
pp. 185-190 ◽  
Author(s):  
Alex J. Cannon

AbstractRegression-guided clustering is introduced as a means of constructing circulation-to-environment synoptic climatological classifications. Rather than applying an unsupervised clustering algorithm to synoptic-scale atmospheric circulation data, one instead augments the atmospheric circulation dataset with predictions from a supervised regression model linking circulation to environment. The combined dataset is then entered into the clustering algorithm. The level of influence of the environmental dataset can be controlled by a simple weighting factor. The method is generic in that the choice of regression model and clustering algorithm is left to the user. Examples are given using standard multivariate linear regression models and the k-means clustering algorithm, both established methods in synoptic climatology. Results for southern British Columbia, Canada, indicate that model performance can be made to range between that of a fully unsupervised algorithm and a fully supervised algorithm.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Qin Wu ◽  
Xingqin Qi ◽  
Eddie Fuller ◽  
Cun-Quan Zhang

Within graph theory and network analysis, centrality of a vertex measures the relative importance of a vertex within a graph. The centrality plays key role in network analysis and has been widely studied using different methods. Inspired by the idea of vertex centrality, a novel centrality guided clustering (CGC) is proposed in this paper. Different from traditional clustering methods which usually choose the initial center of a cluster randomly, the CGC clustering algorithm starts from a “LEADER”—a vertex with the highest centrality score—and a new “member” is added into the same cluster as the “LEADER” when some criterion is satisfied. The CGC algorithm also supports overlapping membership. Experiments on three benchmark social network data sets are presented and the results indicate that the proposed CGC algorithm works well in social network clustering.


2016 ◽  
Vol 25 (11) ◽  
pp. 5252-5265 ◽  
Author(s):  
Sheng He ◽  
Petros Samara ◽  
Jan Burgers ◽  
Lambert Schomaker

BMC Genetics ◽  
2011 ◽  
Vol 12 (1) ◽  
pp. 48 ◽  
Author(s):  
Mei-Hsien Lee ◽  
Jung-Ying Tzeng ◽  
Su-Yun Huang ◽  
Chuhsing Hsiao

2007 ◽  
Vol 177 (4S) ◽  
pp. 156-156
Author(s):  
Andrea Salonia ◽  
Pierre I. Karakiewicz ◽  
Andrea Gallina ◽  
Alberto Briganti ◽  
Tommaso C. Camerata ◽  
...  

2010 ◽  
Author(s):  
Susan Sharp ◽  
Ashleigh Golden ◽  
Cheryl Koopman ◽  
Eric Neri ◽  
David Spiegel

Sign in / Sign up

Export Citation Format

Share Document