On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 11th international conference on World Wide Web
Logistic Regression, AdaBoost and Bregman Distances
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Automatic multimedia cross-modal correlation discovery
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Manifold-ranking based image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
BANKS: browsing and keyword searching in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Fast incremental proximity search in large graphs
Proceedings of the 25th international conference on Machine learning
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast mining of complex time-stamped events
Proceedings of the 17th ACM conference on Information and knowledge management
FOGGER: an algorithm for graph generator discovery
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
The slashdot zoo: mining a social network with negative edges
Proceedings of the 18th international conference on World wide web
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
iPoG: fast interactive proximity querying on graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Summarizing relational databases
Proceedings of the VLDB Endowment
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Supervised random walks: predicting and recommending links in social networks
Proceedings of the fourth ACM international conference on Web search and data mining
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Social tie mining in company networks
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Mining competitive relationships by learning across heterogeneous networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Impact neighborhood indexing (INI) in diffusion graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Subgraph Extraction for Trust Inference in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Network flows and the link prediction problem
Proceedings of the 7th Workshop on Social Network Mining and Analysis
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
LR-PPR: locality-sensitive, re-use promoting, approximate personalized pagerank computation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in several graph mining tasks, including clustering, link prediction and connection subgraph discovery. Our proximity measure is based on the conceptof escape probability. This way, we strive to summarize the multiple facets of nodes-proximity, while avoiding some of the pitfalls to which alternative proximity measures are susceptible. A unique feature of the measures is accounting for the underlying directional information. We put a special emphasis on computational efficiency, and develop fast solutions that are applicable in several settings. Our experimental study shows the usefulness of our proposed direction-aware proximity method for several applications, and that our algorithms achieve a significant speedup (up to 50,000x) over straight forward implementations.