{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T09:10:02Z","timestamp":1737364202096,"version":"3.33.0"},"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_9","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:29:59Z","timestamp":1186903799000},"page":"92-103","source":"Crossref","is-referenced-by-count":13,"title":["Mining Predicate Association Rule by Gene Expression Programming"],"prefix":"10.1007","author":[{"given":"Jie","family":"Zuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining association rules between sets of items in large database,\u201d in Proc. of the ACM SIGMOD conference on Management of Data, pp. 207\u2013216, Washington D.C., USA, May 1993.","DOI":"10.1145\/170035.170072"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Brin S., Motwani R. Ullman J. D. and Tsur S. \u201cDynamic Item set Counting and implication rules for Market Basket Data.\u201d Proceedings of the ACM SIGMOD, 1997. pages 255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"9_CR3","volume-title":"Technical Report RJ10004","author":"R. Agrawal","year":"1996","unstructured":"Agrawal R. and Shafer J. \u201cParallel Mining of Association Rules: Design, Implementation, and Experience.\u201d Technical Report RJ10004, IBM Almaden Research Center, San Jose, CA 95120, Jan. 1996."},{"key":"9_CR4","volume-title":"Technical Report CS-TR-3515","author":"A. Mueller","year":"1995","unstructured":"Mueller A. \u201cFast sequential and parallel methods for association rule mining: A comparison.\u201d Technical Report CS-TR-3515, Department of Computer Science, University of Maryland, College Park, MD, 1995"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"D. Tsur, J. D. Ullman, S. Abitboul, C. Clifton, developed optimizations can be. R. Motwani, and S. Nestorov. Query ocks: A generalization of association-rule mining. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data, pages 1\u201312, Seattle, Washington, June 1998.","DOI":"10.1145\/276304.276306"},{"key":"9_CR6","unstructured":"J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. VLDB 95, pp 420\u2013431."},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0219427901000394","volume":"14","author":"L.I. Tong","year":"2001","unstructured":"LI Tong, TANG Changjie ZUO Jie, ZHANG Tianqing, Web Document Filtering Technique Based on Natural Language understanding, International Journal Computer Processing of Oriental Language,Vol. 14 No. 3 (2001)279\u2013291.","journal-title":"International Journal Computer Processing of Oriental Language"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Changjie Tang, Rynson W.H. Lau, Qing Li, Tongng Li, Zhonghua Yu, \u201cDistance Courseware Discrimination Based on Representative Sentence Assaying\u201d Proceedings of DASFAA01, Seven-th International Conference of Advanced Database Applications. 2001.4.18-20 Hong Kong p92\u201399 IEEE Publishing IEEE Sponsored.","DOI":"10.1109\/DASFAA.2001.916369"},{"key":"9_CR9","first-page":"87","volume":"13","author":"C. Ferreira","year":"2001","unstructured":"Candida Ferreira, Gene Expression Programming: Anew adaptive Algorithm for solving Problems, Complex Systems Vol. 13, Nu. 2, pp87\u2013129, 2001.","journal-title":"Complex Systems"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"M. Mitchell, An Introduction to Genetic Algorithms (MITPress, 1996).","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"9_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Parallel Problem Solving from Nature III","author":"W. Banzhaf","year":"1994","unstructured":"W. Banzhaf, \u201cGenotype-phenotype-mapping and Neutral variation-A Case Study in Genetic Programming\u201d, in Y. Davidor, H.-P. Schwefel, and R. M\u00e4nner, eds., Parallel Problem Solving from Nature III, Vol. 866 of Lecture Notes in Computer Science (Springer-Verlag, 1994)."},{"key":"9_CR12","unstructured":"U.-M. O\u2019 Reilly and F. Oppacher, \u201cA Comparative Analy-sisof Genetic Programming\u201d, in P. J. Angeline and K. E. Kinnear, eds., Advances"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:54:39Z","timestamp":1737363279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45703-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440451","9783540457039"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45703-8_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}