论文信息 - Simple linear algorithms for mining graph cores

Simple linear algorithms for mining graph cores

Batagelj and Zaversnik proposed a linear algorithm for the well-known $k$-core decomposition problem. However, when $k$-cores are desired for a given $k$, we find that a simple linear algorithm requiring no sorting works for mining $k$-cores. In addition, this algorithm can be extended to mine $(k_1, k_2,\ldots, k_p)$-cores from $p$-partite graphs in linear time, and this mining approach can be efficiently implemented in a distributed computing environment with a lower message complexity bound in comparison with the best known method of distributed $k$-core decomposition.

Yang Xiang

[1] Shirish Tatikonda,et al. A Survey of Graph Mining Techniques for Biological Datasets , 2010, Managing and Mining Graph Data.

[2] Yang Xiang,et al. Summarizing transactional databases with overlapped hyperrectangles , 2011, Data Mining and Knowledge Discovery.

[3] Bin Wu,et al. Community detection in large-scale social networks , 2007, WebKDD/SNA-KDD '07.

[4] S. Kanaya,et al. Prediction of Protein Functions Based on K-Cores of Protein-Protein Interaction Networks and Amino Acid Sequences , 2003 .

[5] Yang Xiang,et al. Predicting glioblastoma prognosis networks using weighted gene co-expression network analysis on TCGA data , 2012, BMC Bioinformatics.

[6] Francesco De Pellegrini,et al. Distributed k-Core Decomposition , 2013 .

[7] Aaron Kershenbaum,et al. Clique-Finding for Heterogeneity and Multidimensionality in Biomarker Epidemiology Research: The CHAMBER Algorithm , 2009, PloS one.

[8] Vladimir Batagelj,et al. An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[9] Vladimir Batagelj,et al. Visualisation and analysis of the internet movie database , 2007, 2007 6th International Asia-Pacific Symposium on Visualization.