|
" Complex Networks and Their Applications VII. "
edited by Luca Maria Aiello, Chantal Cherifi, Hocine Cherifi, Renaud Lambiotte, Pietro Lió, Luis M. Rocha.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
860591
|
| Main Entry
|
:
|
International Conference on Complex Networks and Their Applications(7th :2018 :, Cambridge, England)
|
| Title & Author
|
:
|
Complex Networks and Their Applications VII. : Proceedings The 7th International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2018 /\ edited by Luca Maria Aiello, Chantal Cherifi, Hocine Cherifi, Renaud Lambiotte, Pietro Lió, Luis M. Rocha.
|
| Publication Statement
|
:
|
Cham :: Springer,, 2019.
|
| Series Statement
|
:
|
Studies in Computational Intelligence,; 812
|
| Page. NO
|
:
|
1 online resource (xxvii, 893 pages) :: illustrations (some color)
|
| ISBN
|
:
|
303005411X
|
|
|
:
|
: 3030054128
|
|
|
:
|
: 9783030054113
|
|
|
:
|
: 9783030054120
|
|
|
:
|
3030054101
|
|
|
:
|
9783030054106
|
| Contents
|
:
|
Intro; Preface; Organization and Committees; General Chairs; Advisory Board; Program Co-chairs; Poster Chairs; Lightning Chairs; Media and Publicity Chairs; Tutorial Chairs; Local Chairs; Local Committee; Publication Chair; Submission Chair; Web Chair; Program Committee; Contents; Link Analysis and Ranking; A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity; 1 Introduction; 2 Related Work; 3 Proposed Measure; 3.1 Connectedness Centrality; 3.2 Solution Algorithm; 3.3 Group-Connectedness Centrality; 4 Experimental Settings
|
|
|
:
|
1 Introduction2 Link Prediction Evaluation Framework; 2.1 Creation of Learning and Prediction Sets; 2.2 Link Prediction; 2.3 Choice of an Appropriate Score Function; 3 Methods Evaluation; 3.1 Method Based on Heuristics; 3.2 Methods Based on Graph Embeddings; 3.3 Results; 4 Analysis of Systematic Biases; 4.1 Graph Distance; 4.2 Node Degree; 4.3 Community Structure; 5 Discussion: Effect of Biases on Recommender Systems; 6 Conclusion; References; Stability and Similarity in Networks Based on Topology and Nodes Importance; Abstract; 1 Introduction; 2 Stability and Similarity of Network
|
|
|
:
|
3.1 Notation3.2 Brandes' Algorithm; 3.3 Weighted Modularity and Louvain Method; 3.4 W2C-FastBC; 4 Evaluation: Dynamic Analysis of a Real-World Road Network; 5 Conclusion; References; Node Ordering for Rescalable Network Summarization (or, the Apparent Magic of Word Frequency and Age of Acquisition in the Lexicon); 1 Introduction; 2 The Node Ordering Problem: Approximating Degree; 3 Related Work; 4 Case Study: Word Recognition and the Phonological Network; 5 Discussion and Future Directions; References; Systematic Biases in Link Prediction: Comparing Heuristic and Graph Embedding Based Methods
|
|
|
:
|
4 Average-Case Analysis of Yen's Algorithm4.1 Empirical Results on Average-Case Behavior of Yen's Algorithm; 5 Average-Case Analysis of Feng's Algorithm; 5.1 Empirical Results on Feng's Average-Case Behavior; 6 Conclusion; References; Scaling of Random Walk Betweenness in Networks; 1 Introduction; 2 Random Walk Betweenness; 2.1 Numerical Results; 3 Normalized Random Walk Betweenness; 3.1 Numerical Results; 4 Conclusions; References; Fast Approximated Betweenness Centrality of Directed and Weighted Graphs; 1 Introduction; 2 Related Work; 3 Fast BC Computation of Weighted and Directed Graphs
|
|
|
:
|
5 Experimental Results5.1 Visualization of Representatives and Their Clusters; 5.2 Stability with Respect to the Number of Simulations; 5.3 Reachability Under Link Cutting; 5.4 Computation Time; 6 Conclusion; References; Walk Prediction in Directed Networks; 1 Introduction; 2 Related Works; 3 Proposed Model; 3.1 Preference/Attraction Score; 3.2 Learning the Model; 4 Evaluation; 4.1 Dataset; 4.2 Baseline Methods; 4.3 Results; 5 Conclusions; References; Average-Case Behavior of k-Shortest Path Algorithms; 1 Introduction; 2 Related Work; 3 Algorithms; 3.1 Yen's Algorithm; 3.2 Feng's Algorithm
|
| Abstract
|
:
|
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory, together with a wealth of applications. It presents the peer-reviewed proceedings of the VII International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2018), which was held in Cambridge on December 11-13, 2018. The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure and network dynamics; diffusion, epidemics and spreading processes; and resilience and control; as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks; and technological networks.
|
| Subject
|
:
|
Artificial intelligence.
|
| Subject
|
:
|
Engineering.
|
| Subject
|
:
|
Artificial intelligence.
|
| Subject
|
:
|
Engineering.
|
| Dewey Classification
|
:
|
006.3
|
| LC Classification
|
:
|
Q342
|
| Added Entry
|
:
|
Aiello, Luca Maria.
|
|
|
:
|
Cherifi, Chantal.
|
|
|
:
|
Cherifi, Hocine.
|
|
|
:
|
Lambiotte, Renaud.
|
|
|
:
|
Lió, Pietro.
|
|
|
:
|
Rocha, Luis M.
|
| |