{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:59:29Z","timestamp":1750309169577,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,26]],"date-time":"2008-10-26T00:00:00Z","timestamp":1224979200000},"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":[[2008,10,26]]},"DOI":"10.1145\/1458082.1458124","type":"proceedings-article","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T12:59:40Z","timestamp":1226408380000},"page":"299-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["On effective presentation of graph patterns"],"prefix":"10.1145","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}]},{"given":"Cindy Xide","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY, USA"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844706"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.36"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_6_1","first-page":"211","volume-title":"ICDM","author":"Han J.","year":"2002","unstructured":"J. Han , J. Wang , Y. Lu , and P. Tzvetkov . Mining top-k frequent closed patterns without minimum support . In ICDM , pages 211 -- 218 , 2002 . J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, pages 211--218, 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.45"},{"key":"e_1_3_2_1_8_1","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"Hochbaum D. S.","year":"1997","unstructured":"D. S. Hochbaum , editor. Approximation Algorithms for NP-Hard Problems . PWS Publishing , 1997 . D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"Kaufman L.","year":"1990","unstructured":"L. Kaufman and P. J. Rousseeuw , editors . Finding Groups in Data: an Introduction to Cluster Analysis . John Wiley and Sons , 1990 . L. Kaufman and P. J. Rousseeuw, editors. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley and Sons, 1990."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.32"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497499"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39804-2_30"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656256"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0409522102"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150495"},{"key":"e_1_3_2_1_20_1","first-page":"709","volume-title":"VLDB","author":"Xin D.","year":"2005","unstructured":"D. Xin , J. Han , X. Yan , and H. Cheng . Mining compressed frequent-pattern sets . In VLDB , pages 709 -- 720 , 2005 . D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709--720, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"}],"event":{"name":"CIKM08: Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Napa Valley California USA","acronym":"CIKM08"},"container-title":["Proceedings of the 17th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458082.1458124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1458082.1458124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:53:44Z","timestamp":1750287224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458082.1458124"}},"subtitle":["a structural representative approach"],"short-title":[],"issued":{"date-parts":[[2008,10,26]]},"references-count":23,"alternative-id":["10.1145\/1458082.1458124","10.1145\/1458082"],"URL":"https:\/\/doi.org\/10.1145\/1458082.1458124","relation":{},"subject":[],"published":{"date-parts":[[2008,10,26]]},"assertion":[{"value":"2008-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}