文摘
英文文摘
声明
Chapter 1 Introduction
1.1 Background
1.2 Definitions and notations
1.3 Overview of known results
1.4 Outline of this thesis
Chapter 2 Linear-Programming Based Approach Towards Detecting Community Structures in Networks
2.1 Introduction
2.2 Forming cliques
2.3 A linear programming approach
2.4 Feasibility of our method
2.5 Theoretical foundation and interpretation
2.6 Practical improvements
2.7 Remarks
Chapter 3 Reliability Estimation of Our Method
3.1 Existing technique
3.2 Experiments on real-world networks
3.3 Perturbation tests
3.4 Experiments on other artificial networks
3.5 Conclusions and remarks
Chapter 4 Detecting Community Structures in Gene Networks
4.1 Introduction
4.2 Construction of Gene-Ontology annotation network
4.3 Detecting communities in the gene network
4.4 Conclusions
Chapter 5 Measures for Comparing Community Results and Their Bound
5.1 Introduction
5.2 Transfer distance and known bounds
5.3 Subset transfer distance
5.4 Upper bound for subset transfer distance
5.5 Partitions achieving the bounds
5.6 Maximum distance with upper-bounded number of classes
5.7 Conclusions
Bibliography
致谢
个人简介