{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:32Z","timestamp":1725489032123},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440451"},{"type":"electronic","value":"9783540457039"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45703-8_15","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:29:59Z","timestamp":1186903799000},"page":"158-169","source":"Crossref","is-referenced-by-count":1,"title":["Extract Frequent Pattern from Simple Graph Data"],"prefix":"10.1007","author":[{"given":"Qingqing","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Yubo","family":"Lou","sequence":"additional","affiliation":[]},{"given":"Haofeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baile","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad. Depth first generation of long patterns. KDD 2000: 108\u2013118","DOI":"10.1145\/347090.347114"},{"key":"15_CR2","unstructured":"Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. of Parallel and Distribute Computing, 2000."},{"key":"15_CR3","unstructured":"Rakesh Agrawal, Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487\u2013499"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur. Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Conference 1997: 255\u2013264","DOI":"10.1145\/253260.253325"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Jiawei Han, Jian Pei, Yiwen Yin. Mining Frequent Patterns without Candidate Generation. SIGMOD Conference 2000: 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. PDKK 2000: 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Michihiro Kuramochi, George Karypis. Frequent Subgraph Discovery. ICDM 2001: 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Heikki Mannila, Hannu Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery 1(3): 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Jong Soo Park, Ming-Syan Chen, Philip S. Yu. An Effective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference 1995: 175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"15_CR10","unstructured":"Mike Perkowitz, Oren Etzioni. Adaptive Sites: Automatically learning from user access patterns. In Proc. 6th Int. World Wide Web Conf.(WWW\u201997), Santa Clara, California, April 1997."},{"key":"15_CR11","unstructured":"J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-Mine: Hyper-Structure Proc. 2001 Int. Conf. on Data Mining (ICDM\u201901), San Jose, CA, Nov. 2001"},{"key":"15_CR12","unstructured":"J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. Proc. 2001 Int. Conf. on Data Engineering (ICDE\u201901), Heidelberg, Germany, April 2001."}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45703-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:58:54Z","timestamp":1556755134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45703-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440451","9783540457039"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45703-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}