Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
The WebGraph Framework II: Codes For The World-Wide Web
DCC '04 Proceedings of the Conference on Data Compression
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Trio: a system for data, uncertainty, and lineage
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
SIAM Journal on Numerical Analysis
Clustering and Embedding Using Commute Times
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
MCDB: a monte carlo approach to managing uncertain data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Orion 2.0: native support for uncertain data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Approximating predicates and expressive queries on probabilistic databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms for clustering uncertain data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast incremental proximity search in large graphs
Proceedings of the 25th international conference on Machine learning
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Proceedings of the VLDB Endowment
Periscope/GQ: a graph querying toolkit
Proceedings of the VLDB Endowment
Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data
IEEE Transactions on Knowledge and Data Engineering
Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations
IEEE Transactions on Knowledge and Data Engineering
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Fast and Simple Relational Processing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Frequent pattern mining with uncertain data
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Probabilistic frequent itemset mining in uncertain databases
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Top-k queries on uncertain data: on score distribution and typical answers
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
PrDB: managing and exploiting rich correlations in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
A unified approach to ranking in probabilistic databases
Proceedings of the VLDB Endowment
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Efficient query answering in probabilistic RDF graphs
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Querying uncertain data with aggregate constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
An Energy-Efficient Resource Allocation Scheme for Mobile Ad Hoc Computational Grids
Journal of Grid Computing
A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently
Proceedings of the 15th Symposium on International Database Engineering & Applications
A model for mining relevant and non-redundant information
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Probabilistic pattern queries over complex probabilistic graphs
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Injecting uncertainty in graphs for identity obfuscation
Proceedings of the VLDB Endowment
Exploration of monte-carlo based probabilistic query processing in uncertain graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
Learning in probabilistic graphs exploiting language-constrained patterns
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
Probabilistic graph summarization
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Aggregate nearest neighbor queries in uncertain graphs
World Wide Web
| Hi-index | 0.00 |
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of similarity search in standard graphs, a fundamental problem for probabilistic graphs is to efficiently answer k-nearest neighbor queries (k-NN), which is the problem of computing the k closest nodes to some specific node. In this paper we introduce a framework for processing k-NN queries in probabilistic graphs. We propose novel distance functions that extend well-known graph concepts, such as shortest paths. In order to compute them in probabilistic graphs, we design algorithms based on sampling. During k-NN query processing we efficiently prune the search space using novel techniques. Our experiments indicate that our distance functions outperform previously used alternatives in identifying true neighbors in real-world biological data. We also demonstrate that our algorithms scale for graphs with tens of millions of edges.