{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:03:36Z","timestamp":1791137016193,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2396777","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"95-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Interactive pattern mining on hidden data"],"prefix":"10.1145","author":[{"given":"Mansurul","family":"Bhuiyan","sequence":"first","affiliation":[{"name":"Indiana University - Purdue University, Indianapolis (IUPUI), Indianapolis, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Snehasis","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Indiana University - Purdue University, Indianapolis (IUPUI), Indianapolis, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[{"name":"Indiana University - Purdue University, Indianapolis (IUPUI), Indianapolis, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"Proc. of VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In Proc. of VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. of VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","volume-title":"The mixing time of the giant component of a random graph","author":"Benjamini I.","year":"2006","unstructured":"I. Benjamini , G. Kozma , and W. N. The mixing time of the giant component of a random graph . 2006 . I. Benjamini, G. Kozma, and W. N. The mixing time of the giant component of a random graph. 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0209-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0212-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39804-2_8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2089856.2089868"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024076020895"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390397"},{"key":"e_1_3_2_1_9_1","volume-title":"Spectral Graph Theory","author":"Chung R. K.","year":"1997","unstructured":"R. K. Chung . Spectral Graph Theory . Americal Mathematical Society , 1997 . R. K. Chung. Spectral Graph Theory. Americal Mathematical Society, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807259"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.112"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739051"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020529"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . Foundations of Cryptography Volume II Basic Applications. Cambridge University Press , 2004 . O. Goldreich. Foundations of Cryptography Volume II Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.56"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935927"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935921"},{"key":"e_1_3_2_1_21_1","volume-title":"In Proc. of ICDM'01","author":"Kuramochi M.","unstructured":"M. Kuramochi and G. Karypis . Frequent subgraph discovery . In In Proc. of ICDM'01 . M. Kuramochi and G. Karypis. Frequent subgraph discovery. In In Proc. of ICDM'01."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020499"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963239"},{"key":"e_1_3_2_1_25_1","first-page":"129","volume-title":"Proc. of the 27th VLDB","author":"Raghavan S.","year":"2001","unstructured":"S. Raghavan and H. Garcia-Molina . Crawling the hidden web . In Proc. of the 27th VLDB , pages 129 -- 138 , 2001 . S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In Proc. of the 27th VLDB, pages 129--138, 2001."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775053"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.27"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150502"},{"key":"e_1_3_2_1_29_1","volume-title":"In proc. of ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In In proc. of ICDM , 2002 . X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In In proc. of ICDM, 2002."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.125"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","location":"Maui Hawaii USA","acronym":"CIKM'12","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396777","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2396777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:18Z","timestamp":1750235718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2396777"}},"subtitle":["a sampling-based solution"],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":31,"alternative-id":["10.1145\/2396761.2396777","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2396777","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}