scholarly journals Spectral clustering and community detection in document networks

Data Mining X ◽  
2009 ◽  
Author(s):  
C. K. dos Santos ◽  
A. G. Evsukoff ◽  
B. S. L. P. de Lima
2018 ◽  
Vol 115 (5) ◽  
pp. 927-932 ◽  
Author(s):  
Fuchen Liu ◽  
David Choi ◽  
Lu Xie ◽  
Kathryn Roeder

Community detection is challenging when the network structure is estimated with uncertainty. Dynamic networks present additional challenges but also add information across time periods. We propose a global community detection method, persistent communities by eigenvector smoothing (PisCES), that combines information across a series of networks, longitudinally, to strengthen the inference for each period. Our method is derived from evolutionary spectral clustering and degree correction methods. Data-driven solutions to the problem of tuning parameter selection are provided. In simulations we find that PisCES performs better than competing methods designed for a low signal-to-noise ratio. Recently obtained gene expression data from rhesus monkey brains provide samples from finely partitioned brain regions over a broad time span including pre- and postnatal periods. Of interest is how gene communities develop over space and time; however, once the data are divided into homogeneous spatial and temporal periods, sample sizes are very small, making inference quite challenging. Applying PisCES to medial prefrontal cortex in monkey rhesus brains from near conception to adulthood reveals dense communities that persist, merge, and diverge over time and others that are loosely organized and short lived, illustrating how dynamic community detection can yield interesting insights into processes such as brain development.


2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Shuxia Ren ◽  
Shubo Zhang ◽  
Tao Wu

The similarity graphs of most spectral clustering algorithms carry lots of wrong community information. In this paper, we propose a probability matrix and a novel improved spectral clustering algorithm based on the probability matrix for community detection. First, the Markov chain is used to calculate the transition probability between nodes, and the probability matrix is constructed by the transition probability. Then, the similarity graph is constructed with the mean probability matrix. Finally, community detection is achieved by optimizing the NCut objective function. The proposed algorithm is compared with SC, WT, FG, FluidC, and SCRW on artificial networks and real networks. Experimental results show that the proposed algorithm can detect communities more accurately and has better clustering performance.


2019 ◽  
Author(s):  
Sheila M. Gaynor ◽  
Xihong Lin ◽  
John Quackenbush

AbstractBiological networks often have complex structure consisting of meaningful clusters of nodes that are integral to understanding biological function. Community detection algorithms to identify the clustering, or community structure, of a network have been well established. These algorithms assume that data used in network construction is observed without error. However, oftentimes intermediary analyses such as regression are performed before constructing biological networks and the associated error is not propagated in community detection. In expression quantitative trait loci (eQTL) networks, one must first map eQTLs via linear regression in order to specify the matrix representation of the network. We study the effects of using estimates from regression models when applying the spectral clustering approach to community detection. We demonstrate the impacts on the affinity matrix and consider adjusted estimates of the affinity matrix for use in spectral clustering. We further provide a recommendation for selection of the tuning parameter in spectral clustering. We evaluate the proposed adjusted method for performing spectral clustering to detect gene clusters in eQTL data from the GTEx project and to assess the stability of communities in biological data.


Author(s):  
Zheng Qiong

As the traditional spectral community detection method uses adjacency matrix for clustering which might cause the problem of accuracy reduction, we proposed a signal-diffusion-based spectral clustering for community detection. This method solves the problem that unfixed total signal as using the signal transmission mechanism, provides optimization of algorithm time complexity, improves the performance of spectral clustering with construction of Laplacian based on signal diffusion. Experiments prove that the method reaches as better performance on real-world network and Lancichinetti–Fortunato–Radicchi (LFR) benchmark.


2019 ◽  
Vol 35 (1) ◽  
pp. 69-94
Author(s):  
Fengqin Tang ◽  
Chunning Wang ◽  
Jinxia Su ◽  
Yuanyuan Wang

Sign in / Sign up

Export Citation Format

Share Document