ChiSeL: Graph Similarity Search using Chi-Squared Statistics in Large Probabilistic Graphs
Summary: ChiSeL enables subgraph similarity search in large probabilistic graphs via chi-square scores for candidate vertex matches. Greedy expansion prioritizes high chi-square matches, handling edge, label, and vertex uncertainty; validated on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,135 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 4.3888791e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,393 | On Uncertain Graphs Modeling and Queries | 2015 | VLDB | 5.0837624e-05 |
| 4,791 | An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs | 2015 | VLDB | 5.9188595e-05 |
| 11,480 | Structural Generalizability: The Case of Similarity Search | 2021 | SIGMOD | 4.1945683e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 1,539 | Scalable Similarity Search for SimRank | 2014 | SIGMOD | 0.00011460415 |
| 1,775 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD | 0.00010602927 |
| 2,525 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5981082e-05 |
| 4,958 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.8031038e-05 |
| 6,572 | Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs | 2014 | SIGMOD | 5.005963e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |