Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases

@article{Yuan2012EfficientSS,
  title={Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases},
  author={Ye Yuan and Guoren Wang and Lei Chen and Haixun Wang},
  journal={PVLDB},
  year={2012},
  volume={5},
  pages={800-811}
}
Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description Framework (RDF) data management. All these works assume that the underlying data are certain. However, in reality, graphs are often noisy and uncertain due to various factors, such as errors in data extraction, inconsistencies in data… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 45 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…