第一个书签之前
ABSTRACT
摘要
List of Figures
List of Tables
List of Symbols
List of Abbreviations
Chapter 1Introduction
1.1Background
1.2Research status at home and abroad
1.3Research content
1.4Thesis Organization
Chapter 2Preliminaries
2.1Graph Theory
2.2Statistical properties of complex networks
2.2.1Degree
2.2.2Neighbors Node
2.2.3Clustering Coefficient
2.2.4Shortest Path Length
2.2.5Density
2.3The Topology of the Network
2.3.1Scale-free Network
2.3.2Small-world Network
2.3.3Community Structure
2.4Classic Algorithms
2.4.1CMP Algorithm
2.4.2Label Propagation Algorithm
2.4.3Spectral Clustering
2.4.4Louvain Algorithm
2.5Community Evaluation Indicators
2.5.1Modularity
2.5.2Normalized Mutual Information
2.5.3Community in a Strong Sense and in a Weak Sense
2.6Conclusion
Chapter 3Community Detection on Pseudo-Adjacency Matrix
3.1Problem Background and Solution
3.2K-means Based on Pseudo-adjacency Matrix
3.2.1The Maximum Degree of Initialization
3.2.2Basic Idea
3.3Hierarchical Clustering Based on Pseudo-adjacency Matrix
3.3.1Similarity Measure Function
3.3.2Basic Idea
3.4FCM Algorithm Based on Pseudo-adjacency Matrix
3.4.1Basic Knowledge
3.4.2Principle of Algorithm
3.5Conclusion
Chapter 4Experimental Results and Analysis
4.1DataSet
4.1.1Zachary Karate Club Network
4.1.2Dolphins Network
4.1.3Football League Network
4.1.4Lesmis Network
4.2K-means Experimental Results and Analysis
4.2.1Choice of Parameter
4.2.2Comparative Experiment of Unweighted Social Network
4.2.3The Experiment of K-means on Weighted Network
4.3Hierarchical Clustering Experimental Results and Analysis
4.3.1Choice of Parameter
4.3.2Comparative Experiment of Unweighted Social Network
4.3.3Experiment of Hierarchical Clustering on Weighted Network
4.4FCM Algorithm and Experimental Analysis
4.4.1Performance Analysis
4.5Conclusion
Chapter 5Conclusion and Future Work
5.1Conclusion
5.2Future Work
References
Acknowledgements
Biography
西安电子科技大学;