{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:30Z","timestamp":1750307730222,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557069","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"417-426","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Cartesian contour"],"prefix":"10.1145","author":[{"given":"Ruoming","family":"Jin","sequence":"first","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]},{"given":"Yang","family":"Xiang","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]},{"given":"Lin","family":"Liu","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014057"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_3_1","unstructured":"Christan Borgelt. Apriori implementation. http:\/\/fuzzy.cs.Uni-Magdeburg.de\/~borgelt\/Software. Version 4.08.  Christan Borgelt. Apriori implementation. http:\/\/fuzzy.cs.Uni-Magdeburg.de\/~borgelt\/Software. Version 4.08."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.183"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0054-6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_7_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han Jiawei","year":"2000","unstructured":"Jiawei Han and Micheline Kamber . Data Mining: Concepts and Techniques . Morgan Kaufmann Publishers , 2000 . Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000."},{"key":"e_1_3_2_1_8_1","first-page":"211","volume-title":"ICDM","author":"Han Jiawei","year":"2002","unstructured":"Jiawei Han , Jianyong Wang , Ying Lu , and Petre Tzvetkov . Mining top-k frequent closed patterns without minimum support . In ICDM , pages 211 -- 218 , 2002 . Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, pages 211--218, 2002."},{"key":"e_1_3_2_1_9_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum S.","year":"1997","unstructured":"Dorit~ S. Hochbaum , editor. Approximation algorithms for NP-hard problems . PWS Publishing Co. , Boston, MA, USA , 1997 . Dorit~S. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Co., Boston, MA, USA, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401941"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656256"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_15"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150495"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401981"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150452"},{"key":"e_1_3_2_1_18_1","volume-title":"VLDB","author":"Xin Dong","year":"2005","unstructured":"Dong Xin , Jiawei Han , Xifeng Yan , and Hong Cheng . Mining compressed frequent-pattern sets . In VLDB , 2005 . Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Paris France","acronym":"KDD09"},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557069","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:40Z","timestamp":1750253920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557069"}},"subtitle":["a concise representation for a collection of frequent sets"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":19,"alternative-id":["10.1145\/1557019.1557069","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557069","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}