{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:26Z","timestamp":1761596786735},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s1568-4946(02)00031-5","type":"journal-article","created":{"date-parts":[[2003,1,9]],"date-time":"2003-01-09T07:13:14Z","timestamp":1042096394000},"page":"75-88","source":"Crossref","is-referenced-by-count":38,"title":["A genetic-algorithm for discovering small-disjunct rules in data mining"],"prefix":"10.1016","volume":"2","author":[{"given":"Deborah R.","family":"Carvalho","sequence":"first","affiliation":[]},{"given":"Alex A.","family":"Freitas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1568-4946(02)00031-5_BIB1","unstructured":"D.R. Carvalho, A.A. Freitas, A hybrid decision-tree\/genetic-algorithm for coping with the problem of small disjuncts in data mining, in: Proceedings of the 2000 Genetic and Evolutionary Computation Conference (Gecco-2000), Las Vegas, NV, USA, July 2000, pp. 1061\u20131068."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB2","doi-asserted-by":"crossref","unstructured":"D.R. Carvalho, A.A. Freitas, A genetic algorithm-based solution for the problem of small disjuncts: principles of data mining and knowledge discovery, in: Proceedings of the 4th European Conference, PKDD-2000, Lyon, France. Lecture Notes in Artificial Intelligence 1910, Springer, Berlin, 2000, pp. 345\u2013352.","DOI":"10.1007\/3-540-45372-5_35"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB3","doi-asserted-by":"crossref","unstructured":"T.M. Cover, J.A. Thomas, Elements of Information Theory, Wiley, New York, 1991.","DOI":"10.1002\/0471200611"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB4","doi-asserted-by":"crossref","unstructured":"A.P. Danyluk, F.J. Provost, Small disjuncts in action: learning to diagnose errors in the local loop of the telephone network, in: Proceedings of the 10th International Conference Machine Learning, Morgan Kaufmann, Los Altos, CA, 1993, pp. 81\u201388.","DOI":"10.1016\/B978-1-55860-307-3.50017-4"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB5","unstructured":"A.A. Freitas, S.H. Lavington, Mining Very Large Databases with Parallel Processing, Kluwer Academic Publishers, Dordrecht, 1998."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB6","unstructured":"A.A. Freitas, Evolutionary computation, in: Handbook of Data Mining and Knowledge Discovery, Oxford University Press, Oxford, 2002 (in press)."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB7","doi-asserted-by":"crossref","unstructured":"A.A. Freitas, Data Mining and Knowledge Discovery with Evolutionary Algorithms, Springer, Berlin, 2002, p. 956.","DOI":"10.1007\/978-3-662-04923-5"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB8","unstructured":"J.H. Friedman, R. Kohavi, Y. Yun, Lazy decision trees, in: Proceedings of the 1996 National Conference of the AAAI (AAAI-1996)."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB9","unstructured":"D.E. Goldberg, Genetic algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, New York, 1989."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB10","unstructured":"D.J. Hand, Construction and Assessment of Classification Rules, Wiley, New York, 1997."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB11","first-page":"813","article-title":"Concept learning and the problem of small disjuncts","volume":"89","author":"Holte","year":"1989","journal-title":"Proc. IJCAI"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB12","doi-asserted-by":"crossref","unstructured":"B. Liu, M. Hu, W. Hsu, Multi-level organization and summarization of the discovered rules, in: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovered and Data Mining (KDD-2000), ACM Press, 2000, pp. 208\u2013220.","DOI":"10.1145\/347090.347128"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB13","doi-asserted-by":"crossref","unstructured":"A.A. Lopes, A. Jorge, Integrating rules and cases in learning via case explanation and paradigm shift, advances in artificial intelligence. In: Proceedings opf the IBERAMIA\u2014SBIA 2000. Lecture Notes in Artificial Intelligence 1952, Springer, Berlin, 2000, pp. 33\u201342.","DOI":"10.1007\/3-540-44399-1_5"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB14","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, Genetic algorithms + Data Structures = Evolution Programs, 3rd ed. Springer, Berlin, 1996.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB15","unstructured":"R. Michalski, K. Kaufman, Data mining and knowledge discovery: a review of issues and multistrategy approach, in: Ryszard S. Michalski, Ivan Bratko, Miroslav Kubat (Eds.), Machine Learning and Data Mining Methods and Applications, Wiley, New York, 1998."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB16","unstructured":"T. Mitchell, Machine Learning, McGraw-Hill, New York, 1997."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB17","doi-asserted-by":"crossref","unstructured":"K. Nazar, M.A. Bramer, Estimating concept difficulty with cross entropy, in: M.A. Bramer (Ed.), Knowledge Discovery and Data Mining, The Institution of Electrical Engineers, London, 1999, pp. 3\u201331.","DOI":"10.1049\/PBPC001E_ch1"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB18","doi-asserted-by":"crossref","unstructured":"E. Noda, H.S. Lopes, A.A. Freitas, Discovering interesting prediction rules with a genetic-algorithm, in: Proceedings of the Congress on Evolutionary Computation (CEC-99), IEEE Press, 1999, pp. 1322\u20131329.","DOI":"10.1109\/CEC.1999.782601"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB19","unstructured":"J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, Los Altos, CA, 1993."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1111\/j.1467-8640.1990.tb00298.x","article-title":"Learning hard concepts through constructive induction: framework and rationale","volume":"6","author":"Rendell","year":"1990","journal-title":"Computat. Intell."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB21","unstructured":"K.M. Ting, The problem of small disjuncts: its remedy in decision trees, in: Proceedings of the 10th Canadian Conference on AI, 1994, pp. 91\u201397."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB22","doi-asserted-by":"crossref","unstructured":"G.M. Weiss, Learning with rare cases and small disjuncts, in: Proceedings of the 12th International Conference on Machine Learning (ICML-95), Morgan Kaufmann, Los Altos, CA, 1995, pp. 558\u2013565.","DOI":"10.1016\/B978-1-55860-377-6.50075-X"},{"key":"10.1016\/S1568-4946(02)00031-5_BIB23","unstructured":"G.M. Weiss, The problem with noise and small disjuncts, in: Proceedings of the International Conference on Machine Learning (ICML-98), Morgan Kaufmann, Los Altos, CA, 1998, pp. 574\u2013578."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB24","unstructured":"G.M. Weiss, H. Hirsh, A quantitative study of small disjuncts, Proceedings of the of 17th National Conference on Artificial Intelligence (AAAI-2000), Austin, TX, 2000, pp. 665\u2013670."},{"key":"10.1016\/S1568-4946(02)00031-5_BIB25","unstructured":"I.H. Witten, E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann, Los Altos, CA, 2000."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494602000315?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494602000315?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T08:29:52Z","timestamp":1583915392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494602000315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1568494602000315"],"URL":"https:\/\/doi.org\/10.1016\/s1568-4946(02)00031-5","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}