{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:58:31Z","timestamp":1775638711574,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,26]]},"DOI":"10.1145\/3459637.3482217","type":"proceedings-article","created":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T15:31:19Z","timestamp":1636990279000},"page":"2812-2816","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["VerSaChI"],"prefix":"10.1145","author":[{"given":"Shubhangi","family":"Agarwal","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Kanpur, Kanpur, India"}]},{"given":"Sourav","family":"Dutta","sequence":"additional","affiliation":[{"name":"Huawei Research Centre, Dublin, Ireland"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Kanpur, Kanpur, India"}]}],"member":"320","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401964"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482217"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_2"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588574"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"A. Bordes S. Chopra and J. Weston. 2014. Question Answering with Subgraph Embeddings. In EMNLP. 615--620.  A. Bordes S. Chopra and J. Weston. 2014. Question Answering with Subgraph Embeddings. In EMNLP. 615--620.","DOI":"10.3115\/v1\/D14-1067"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325956"},{"key":"e_1_3_2_2_9_1","article-title":"PBSM: An Efficient Top-K Subgraph Matching Algorithm","volume":"32","author":"Chen W.","year":"2017","unstructured":"W. Chen , J. Liu , Z. Chen , X. Tang , and K. Li . 2017 . PBSM: An Efficient Top-K Subgraph Matching Algorithm . International Journal of Pattern Recognition and Artificial Intelligence , Vol. 32 , 6 (2017). W. Chen, J. Liu, Z. Chen, X. Tang, and K. Li. 2017. PBSM: An Efficient Top-K Subgraph Matching Algorithm. International Journal of Pattern Recognition and Artificial Intelligence, Vol. 32, 6 (2017).","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384401"},{"key":"e_1_3_2_2_11_1","volume-title":"International Conference on Data Engineering (ICDE). 1308--1319","author":"Chen X.","unstructured":"X. Chen , L. Lai , L. Qin , X. Lin , and B. Liu . 2021. A Framework to Quantify Approximate Simulation on Graph Data . In International Conference on Data Engineering (ICDE). 1308--1319 . X. Chen, L. Lai, L. Qin, X. Lin, and B. Liu. 2021. A Framework to Quantify Approximate Simulation on Graph Data. In International Conference on Data Engineering (ICDE). 1308--1319."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_2_13_1","first-page":"59","article-title":"State of the Art of Graph-based Data Mining","volume":"5","author":"Cheung T. Y.","year":"1983","unstructured":"T. Y. Cheung . 1983 . State of the Art of Graph-based Data Mining . Transactions on Software Engineering , Vol. 5 , 1 (1983), 59 -- 68 . T. Y. Cheung. 1983. State of the Art of Graph-based Data Mining. Transactions on Software Engineering, Vol. 5, 1 (1983), 59--68.","journal-title":"Transactions on Software Engineering"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_17_1","volume-title":"MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance. In European Conference on Information Retrieval (ECIR). 284--290","author":"Dutta S.","year":"2015","unstructured":"S. Dutta . 2015 . MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance. In European Conference on Information Retrieval (ECIR). 284--290 . S. Dutta. 2015. MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance. In European Conference on Information Retrieval (ECIR). 284--290."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_35"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"S. Dutta and A. Bhattacharya. 2012. Mining Statistically Significant Substrings Based on the Chi-Square Measure. In Pattern Discovery Using Sequence Data Mining: Applications and Studies. IGI Global 73--82.  S. Dutta and A. Bhattacharya. 2012. Mining Statistically Significant Substrings Based on the Chi-Square Measure. In Pattern Discovery Using Sequence Data Mining: Applications and Studies. IGI Global 73--82.","DOI":"10.4018\/978-1-61350-056-9.ch004"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358126"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052561"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"B. Gallagher. 2006. Matching Structure and Semantics: A Survey on Graph-based Pattern Matching. In AAAI. 45--53.  B. Gallagher. 2006. Matching Structure and Semantics: A Survey on Graph-based Pattern Matching. In AAAI. 45--53.","DOI":"10.2172\/895418"},{"key":"e_1_3_2_2_23_1","first-page":"201","article-title":"GraphGrep","volume":"2","author":"Giugno Rosalba","year":"2002","unstructured":"Rosalba Giugno and Dennis Shasha . 2002 . GraphGrep : A Fast and Universal Method for Querying Graphs. ICPR , Vol. 2 (2002), 201 -- 212 . Rosalba Giugno and Dennis Shasha. 2002. GraphGrep: A Fast and Universal Method for Querying Graphs. ICPR, Vol. 2 (2002), 201--212.","journal-title":"A Fast and Universal Method for Querying Graphs. ICPR"},{"key":"e_1_3_2_2_24_1","volume-title":"International Conference on World Wide Web (WWW). 755--782","author":"Gu Y.","unstructured":"Y. Gu , C. Gao , L. Wang , and G. Yu . 2016. Subgraph Similarity Maximal All-matching over a Large Uncertain Graph . In International Conference on World Wide Web (WWW). 755--782 . Y. Gu, C. Gao, L. Wang, and G. Yu. 2016. Subgraph Similarity Maximal All-matching over a Large Uncertain Graph. In International Conference on World Wide Web (WWW). 755--782."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2391125"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"H. Jiang H. Wang P. S. Yu and S. Zhou. 2007. GString: A Novel Approach for Efficient Search in Graph DBs. In ICDE. 566--575.  H. Jiang H. Wang P. S. Yu and S. Zhou. 2007. GString: A Novel Approach for Efficient Search in Graph DBs. In ICDE. 566--575.","DOI":"10.1109\/ICDE.2007.367902"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_2_30_1","volume-title":"Mining Uncertain Graphs: An Overview. In International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). 87--116","author":"Kassiano V.","unstructured":"V. Kassiano , A. Gounaris , A. N. Papadopoulos , and K. Tsichlas . 2016 . Mining Uncertain Graphs: An Overview. In International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). 87--116 . V. Kassiano, A. Gounaris, A. N. Papadopoulos, and K. Tsichlas. 2016. Mining Uncertain Graphs: An Overview. In International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). 87--116."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh411"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807261"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.01.019"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2019.02.021"},{"key":"e_1_3_2_2_36_1","volume-title":"G-Finder: Approximate Attributed Subgraph Matching. In International Conference on Big Data. 513--522","author":"Liu L.","unstructured":"L. Liu , B. Du , J. Xu , and H. Tong . 2019 . G-Finder: Approximate Attributed Subgraph Matching. In International Conference on Big Data. 513--522 . L. Liu, B. Du, J. Xu, and H. Tong. 2019. G-Finder: Approximate Attributed Subgraph Matching. In International Conference on Big Data. 513--522."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-012-0284-8"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528937"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2017.080465"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1351324915000340"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"T. Read and N. Cressie. 1988. Goodness-of-fit Statistics for Discrete Multivariate Data. Springer Series in Statistics.  T. Read and N. Cressie. 1988. Goodness-of-fit Statistics for Discrete Multivariate Data. Springer Series in Statistics.","DOI":"10.1007\/978-1-4612-4578-0"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2888116.2888372"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336677"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_2_46_1","volume-title":"BioMed Research Int.","volume":"2014","author":"Shen R.","year":"2014","unstructured":"R. Shen and C. Guda . 2014. Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks . BioMed Research Int. , Vol. 2014 , 439476 ( 2014 ), 11. R. Shen and C. Guda. 2014. Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks. BioMed Research Int., Vol. 2014, 439476 (2014), 11."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"S. Sun and Q. Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231.  S. Sun and Q. Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231.","DOI":"10.1109\/ICDE.2019.00028"},{"key":"e_1_3_2_2_49_1","first-page":"177","article-title":"Des Valeurs Moyennes","volume":"12","author":"Tchebichef P.","year":"1867","unstructured":"P. Tchebichef . 1867 . Des Valeurs Moyennes . Journal de Math\u00e9matiques Pures et Appliquees , Vol. 12 (1867), 177 -- 184 . P. Tchebichef. 1867. Des Valeurs Moyennes. Journal de Math\u00e9matiques Pures et Appliquees, Vol. 12 (1867), 177--184.","journal-title":"Journal de Math\u00e9matiques Pures et Appliquees"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.84.4.327"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_54_1","first-page":"507","article-title":"Algorithms for Detecting Significantly Mutated Pathways in Cancer","volume":"18","author":"Vandin F.","year":"2011","unstructured":"F. Vandin , E. Upfal , and B. J. Raphael . 2011 . Algorithms for Detecting Significantly Mutated Pathways in Cancer . JCB , Vol. 18 , 3 (2011), 507 -- 522 . F. Vandin, E. Upfal, and B. J. Raphael. 2011. Algorithms for Detecting Significantly Mutated Pathways in Cancer. JCB, Vol. 18, 3 (2011), 507--522.","journal-title":"JCB"},{"key":"e_1_3_2_2_55_1","unstructured":"J. Wang N. Ntarmos and P. Triantafillou. 2016. Indexing Query Graphs to Speedup Graph Query Processing. In EDBT. 41--52.  J. Wang N. Ntarmos and P. Triantafillou. 2016. Indexing Query Graphs to Speedup Graph Query Processing. In EDBT. 41--52."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114248"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066244"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0373-y"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516385"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031453.1031462"}],"event":{"name":"CIKM '21: The 30th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Queensland Australia","acronym":"CIKM '21","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 30th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3459637.3482217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:12Z","timestamp":1750191132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3459637.3482217"}},"subtitle":["Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality"],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":62,"alternative-id":["10.1145\/3459637.3482217","10.1145\/3459637"],"URL":"https:\/\/doi.org\/10.1145\/3459637.3482217","relation":{},"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"2021-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}