VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality.
Shubhangi Agarwal|Sourav Dutta|Arnab Bhattacharya
| Anthology ID: | DBLP:conf/cikm/000010021 |
|---|---|
| Volume: | CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021 |
| Year: | 2021 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 2812-2816 |
| URL: | https://doi.org/10.1145/3459637.3482217 |
| DOI: | https://doi.org/10.1145/3459637.3482217 |
| DBLP: | conf/cikm/000010021 |
| BibTeX: |
@inproceedings{agarwal-2021-versachi,
author = {Shubhangi Agarwal and
Sourav Dutta and
Arnab Bhattacharya},
editor = {Gianluca Demartini and
Guido Zuccon and
J. Shane Culpepper and
Zi Huang and
Hanghang Tong},
title = {{VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality}},
booktitle = {{CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1 - 5, 2021}},
pages = {2812--2816},
publisher = {ACM},
year = {2021},
url = {https://doi.org/10.1145/3459637.3482217},
doi = {https://doi.org/10.1145/3459637.3482217}
}