The Network Completion Problem: Inferring Missing Nodes and Edges in Networks.
Myunghwan KimJure LeskovecPublished in: SDM (2011)
Keyphrases
- network structure
- real world networks
- network topologies
- complex networks
- missing links
- sparsely connected
- network nodes
- centrality measures
- link prediction
- directed edges
- small world
- cohesive subgroups
- fully connected
- neighboring nodes
- edge weights
- network size
- social networks
- directed graph
- mobile nodes
- overlapping communities
- network analysis
- computer networks
- scale free
- information networks
- undirected graph
- spanning tree
- social network analysis
- community structure
- network parameters
- delay tolerant
- small world networks
- scale free networks
- densely connected
- network connectivity
- wireless ad hoc networks
- network model
- heterogeneous social networks
- average degree
- network resources
- heterogeneous networks
- real world graphs
- unstructured peer to peer
- transport network
- terrorist networks
- hidden nodes
- path length
- intermediate nodes
- shortest path
- community detection algorithms
- ppi networks
- clustering coefficient
- local area network
- power law
- network design
- real world social networks
- random walk
- community detection
- mobile networks
- ip addresses
- source node
- link failure