Spectral K-way ratio-cut partitioning and clustering
DAC '93 Proceedings of the 30th international Design Automation Conference
Finding a large hidden clique in a random graph
proceedings of the eighth international conference on Random structures and algorithms
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Local Graph Partitioning using PageRank Vectors
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A tutorial on spectral clustering
Statistics and Computing
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Anomaly detection in data represented as graphs
Intelligent Data Analysis
Mining (Social) Network Graphs to Detect Random Link Attacks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Spectrum based fraud detection in social networks
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
EigenSpokes: surprising patterns and scalable community chipping in large graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Line orthogonality in adjacency eigenspace with application to community partition
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
New spectral methods for ratio cut partitioning and clustering
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this paper we investigate the problem of detecting small and subtle subgraphs embedded into a large graph with a common structure. We call the embedded small and subtle subgraphs as signals or anomalies and the large graph as background. Those small and subtle signals, which are structurally dissimilar to the background, are often hidden within graph communities and cannot be revealed in the graph's global structure. We explore the minor eigenvectors of the graph's adjacency matrix to detect subtle anomalies from a background graph. We demonstrate that when there are such subtle anomalies, there exist some minor eigenvectors with extreme values on some entries corresponding to the anomalies. Under the assumption of the Erdos---Renyi random graph model, we derive the formula that show how eigenvector entries are changed and give detectability conditions. We then extend our theoretical study to the general case where multiple anomalies are embedded in a background graph with community structure. We develop an algorithm that uses the eigenvector kurtosis to filter out the eigenvectors that capture the signals. Our theoretical analysis and empirical evaluations on both synthetic data and real social networks show effectiveness of our approach to detecting subtle signals.