Networks naturally appear in many high-impact domains, ranging from social network analysis to disease dissemination studies to infrastructure system design. Within network studies, network connectivity plays an important role in a myriad of applications. The diversity of application areas has spurred numerous connectivity measures, each designed for some specific tasks. Depending on the complexity of connectivity measures, the computational cost of calculating the connectivity score can vary significantly. Moreover, the complexity of the connectivity would predominantly affect the hardness of connectivity optimization, which is a fundamental problem for network connectivity studies. This book presents a thorough study in network connectivity, including its concepts, computation, and optimization. Specifically, a unified connectivity measure model will be introduced to unveil the commonality among existing connectivity measures. For the connectivity computation aspect, the authors introduce the connectivity tracking problems and present several effective connectivity inference frameworks under different network settings. Taking the connectivity optimization perspective, the book analyzes the problem theoretically and introduces an approximation framework to effectively optimize the network connectivity. Lastly, the book discusses the new research frontiers and directions to explore for network connectivity studies. This book is an accessible introduction to the study of connectivity in complex networks. It is essential reading for advanced undergraduates, Ph.D. students, as well as researchers and practitioners who are interested in graph mining, data mining, and machine learning.
| Acknowledgments |
|
xiii | |
|
|
|
1 | (4) |
|
|
|
1 | (1) |
|
|
|
1 | (2) |
|
1.3 Research Tasks Overview |
|
|
3 | (1) |
|
|
|
3 | (2) |
|
2 Connectivity Measure Concepts |
|
|
5 | (8) |
|
2.1 Single-Layered Network Measures |
|
|
5 | (5) |
|
2.2 Multi-Layered Network Measures |
|
|
10 | (3) |
|
3 Connectivity Inference Computation |
|
|
13 | (66) |
|
3.1 Eigen-Functions Tracking in Dynamic Networks |
|
|
13 | (22) |
|
|
|
14 | (2) |
|
3.1.2 Proposed Algorithms |
|
|
16 | (7) |
|
3.1.3 Experimental Evaluation |
|
|
23 | (12) |
|
3.2 Cross-Layer Dependency Inference |
|
|
35 | (25) |
|
|
|
37 | (2) |
|
3.2.2 Proposed Algorithms for Code |
|
|
39 | (10) |
|
3.2.3 Proposed Algorithm for Code-ZERO |
|
|
49 | (3) |
|
3.2.4 Experimental Evaluation |
|
|
52 | (8) |
|
3.3 Incremental One-Class Collaborative Filtering |
|
|
60 | (19) |
|
|
|
63 | (3) |
|
|
|
66 | (5) |
|
3.3.3 Experimental Evaluations |
|
|
71 | (8) |
|
4 Network Connectivity Optimization |
|
|
79 | (52) |
|
4.1 SubLine Connectivity Optimization |
|
|
80 | (24) |
|
|
|
81 | (4) |
|
|
|
85 | (4) |
|
|
|
89 | (8) |
|
4.1.4 Experimental Evaluation |
|
|
97 | (7) |
|
4.2 Connectivity Optimization in Multi-Layered Networks |
|
|
104 | (27) |
|
|
|
106 | (2) |
|
4.2.2 Theoretical Analysis |
|
|
108 | (9) |
|
|
|
117 | (2) |
|
4.2.4 Experimental Evaluation |
|
|
119 | (12) |
|
5 Conclusion and Future Work |
|
|
131 | (6) |
|
|
|
131 | (1) |
|
5.2 Future Research Directions |
|
|
132 | (5) |
|
5.2.1 Complex Multi-Layered Network Connectivity |
|
|
132 | (1) |
|
5.2.2 Dynamic Network Inference |
|
|
133 | (1) |
|
5.2.3 Connectivity Optimization and Adversarial Attack |
|
|
134 | (1) |
|
5.2.4 Connectivity on High-Order Dependency Networks |
|
|
134 | (3) |
| Bibliography |
|
137 | (14) |
| Authors' Biographies |
|
151 | |
Chen Chen is currently a Research Assistant Professor at the University of Virginia. Before joining the University of Virginia, she was a software engineer at Google working on personalized recommendations for Google Assistant. Chen received her Ph.D. from Arizona State University. Her research has focused on the connectivity of complex networks, which has been applied to address pressing challenges in various high-impact domains, including social media, bioinformatics, recommendation, and critical infrastructure systems. Her research has appeared in top-tier conferences (including KDD, ICDM, SDM, WSDM, and DASFAA), and prestigious journals (including IEEE TKDE, ACM TKDD, and SIAM SAM). Chen has received several awards, including Bests of SDM15, Bests of KDD16, Rising Star in EECS19, and Outstanding Reviewer of WSDM21.Hanghang Tong is currently an associate professor at the Department of Computer Science at University of Illinois at Urbana-Champaign. Before that, he was an associate professor at the School of Computing, Informatics, and Decision Systems Engineering (CIDSE), Arizona State University. He received his M.Sc. and Ph.D. from Carnegie Mellon University in 2008 and 2009, respectively, both in Machine Learning. His research interest is in large-scale data mining for graphs and multimedia. He has received several awards, including SDM/IBM Early Career Data Mining Research award (2018), NSF CAREER award (2017), ICDM 10-Year Highest Impact Paper award (2015), four best paper awards (TUP14, CIKM12, SDM08, ICDM06), seven bests of conference, one best demo, honorable mention (SIGMOD17), and one best demo candidate, second place (CIKM17). He has published over 100 refereed articles. He is the Editor-in-Chief of SIGKDD Explorations (ACM), an action editor of Data Mining and Knowledge Discovery (Springer), and an associate editor of Knowledge and Information Systems (Springer) and Neurocomputing Journal (Elsevier). He has served as a program committee member in multiple data mining, database, and artificial intelligence venues (e.g.,SIGKDD, SIGMOD, AAAI, WWW, CIKM, etc.).
Biežāk uzdotie jautājumi par e-grāmatām