{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:42:03Z","timestamp":1770982923118,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540437048","type":"print"},{"value":"9783540478874","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47887-6_5","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T11:21:04Z","timestamp":1179573664000},"page":"40-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Discovering Numeric Association Rules via Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Jacinto","family":"Mata","sequence":"first","affiliation":[]},{"given":"Jos\u00e9-Luis","family":"Alvarez","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9-Cristobal","family":"Riquelme","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"5_CR1","unstructured":"Agrawal, R., Imielinski. T., Swami, A.: Mining association rules between sets of items in large databases. Proc. ACM SIGMOD. (1993) 207\u2013216, Washington, D.C."},{"key":"5_CR2","unstructured":"Agrawal, R., Srikant, R: Fast Algorithms for Mining Association Rules. Proc. of the VLDB Conference (1994) 487\u2013489, Santiago (Chile)"},{"key":"5_CR3","unstructured":"Aumann, Y., Lindell, Y.: A Statistical Theory for Quantitative Association Rules. Proceedings KDD99 (1999) 261\u2013270, San Diego, CA"},{"key":"5_CR4","unstructured":"Goldberg, D.E: Genetic algorithms in search, optimization and machine learning. Addison-Wesley. (1989)"},{"key":"5_CR5","unstructured":"Gonz\u00e1lez, A., Herrera, F.: Multi-stage Genetic Fuzzy System Based on the Iterative Rule Learning Approach. Mathware & Soft Computing, 4 (1997)"},{"key":"5_CR6","unstructured":"Guvenir, H. A., Uysal, I.: Bilkent University Function Approximation Repository, \n                    http:\/\/funapp.cs.bilkent.edu.tr\n                    \n                   (2000)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data (2000)","DOI":"10.1145\/342009.335372"},{"key":"5_CR8","unstructured":"Lin, D-I., Kedem, Z.M.: Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set. In Proc. of the 6th Int\u2019l Conference on Extending Database Technology (EDBT) (1998) 105\u2013119 Valencia"},{"key":"5_CR9","unstructured":"Manila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. KDD-94: AAAI Workshop on Knowledge Discovery in Databases (1994) 181\u2013192 Seatle, Washington"},{"key":"5_CR10","unstructured":"Mata, J., Alvarez, J.L., Riquelme, J.C.: Mining Numeric Association Rules with Genetic Algorithms. 5th Internacional Conference on Artificial Neural Networks and Genetic Algorithms, ICANNGA (2001) 264\u2013267 Praga"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Miller, R. J., Yang, Y.: Association Rules over Interval Data. Proceedings of the International ACM SIGMOD Conference (1997) Tucson, Arizona","DOI":"10.1145\/253260.253361"},{"key":"5_CR12","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Park, J. S., Chen, M. S., Yu. P.S.: An Effective Hash Based Algorithm for Mining Association Rules. Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data (1995) San Jos\u00e9, CA","DOI":"10.1145\/223784.223813"},{"key":"5_CR14","unstructured":"Savarese, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. Proc. of the VLDB Conference, Zurich, Switzerland (1995)"},{"key":"5_CR15","unstructured":"Srikant, R, Agrawal, R.: Mining Quantitative Association Rules in Large Relational Tables. Proc. of the ACM SIGMOD (1996) 1\u201312"},{"key":"5_CR16","unstructured":"Wang, K., Tay. S.H., Liu, B.: Interestingness-Based Interval Merger for Numeric Association Rules. Proc. 4th Int. Conf. KDD (1998) 121\u2013128"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47887-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:26:40Z","timestamp":1558258000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47887-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437048","9783540478874"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-47887-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}