Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Efficient progressive sampling
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
All pairs almost shortest paths
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Journal of the ACM (JACM)
Big-bang simulation for embedding network distances in Euclidean space
IEEE/ACM Transactions on Networking (TON)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A generic search strategy for large-scale real-world networks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Graph clustering with network structure indices
Proceedings of the 24th international conference on Machine learning
Navigating low-dimensional and hierarchical population networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Finding tribes: identifying close-knit individuals from employment patterns
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Relational data pre-processing techniques for improved securities fraud detection
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Dynamics of large networks
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Deterministic decentralized search in random graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
The ability to discover low-cost paths in networks has practical consequences for knowledge discovery and social network analysis tasks. Many analytic techniques for networks require finding low-cost paths, but exact methods for search become prohibitive for large networks, and data sets are steadily increasing in size. Short paths can be found efficiently by utilizing an index of network structure, which estimates network distances and enables rapid discovery of short paths. Through experiments on synthetic networks, we demonstrate that one such novel network structure index based on the shortest-path tree outperforms other previously proposed indices. We also show that it generalizes across arbitrarily weighted networks of various structures and densities, provides accurate estimates of distance, and has efficient time and space complexity. We present results on real data sets for several applications, including navigation, diameter estimation, centrality computation, and clustering---all made efficient by virtue of the network structure index.