Probabilistic Subgraph Matching on Huge Social Networks


Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. In this paper, we propose "probabilistic subgraph" (PS) queries over a graph/network database, which afford users great flexibility in specifying "approximately" what they… (More)
DOI: 10.1109/ASONAM.2011.78


6 Figures and Tables