{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T11:28:50Z","timestamp":1769081330178,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Intelligence"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1008339026836","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"285-295","source":"Crossref","is-referenced-by-count":8,"title":["Discretisation of Continuous Commercial Database Features for a Simulated Annealing Data Mining Algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"Justin C.W.","family":"Debuse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor J.","family":"Rayward-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"237539_CR1","unstructured":"J.C.W. Debuse, \u201cExploitation of modern heuristic techniques within a commercial data mining environment,\u201d Ph.D. Thesis, University of East Anglia, 1997."},{"key":"237539_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1008641220268","volume":"9","author":"J.C.W. Debuse","year":"1997","unstructured":"J.C.W. Debuse and V.J. Rayward-Smith, \u201cFeature subset selection within a simulated annealing data mining algorithm,\u201d Journal of Intelligent Information Systems, vol. 9, pp. 57-81, 1997.","journal-title":"Journal of Intelligent Information Systems"},{"key":"237539_CR3","doi-asserted-by":"crossref","unstructured":"J. Dougherty, R. Kohavi, and M. Sahami, \u201cSupervised and unsupervised discretization of continuous features,\u201d in Prieditis and Russell [30], pp. 194-202.","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"237539_CR4","unstructured":"J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1993."},{"key":"237539_CR5","unstructured":"J.R. Quinlan, \u201cSuccessor to C4.5,\u201d Knowledge Discovery Nuggets, vol. 97:09, 1997."},{"key":"237539_CR6","unstructured":"R. Kerber, \u201cChimerge: Discretization of numerical attributes,\u201d in Proc. of the Tenth National Conf. on Artificial Intelligence, MIT Press, 1992, pp. 123-128."},{"key":"237539_CR7","unstructured":"R. Kohavi and M. Sahami, \u201cError-based and entropy-based discretization of continuous features,\u201d in Simoudis et al. [31], pp. 114-119."},{"key":"237539_CR8","unstructured":"J. Catlett, \u201cMegainduction: machine learning on very large databases,\u201d Ph.D. Thesis, University of Sydney, 1991."},{"issue":"6","key":"237539_CR9","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/TPAMI.1987.4767986","volume":"PAMI-9","author":"A.K.C. Wong","year":"1987","unstructured":"A.K.C. Wong and D.K.Y. Cgiu, \u201cSynthesizing statistical knowledge from incomplete mixed-mode data,\u201d IEEE Trans. Pattern Analysis and Machine Intelligence, vol. PAMI-9,no. 6, pp. 796-805, 1987.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"237539_CR10","volume-title":"Integer Programming","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel and G.L. Nemhauser, Integer Programming, Wiley: New York, 1972."},{"key":"237539_CR11","first-page":"377","volume-title":"Proc. of the Conf. on Applied Decision Technologies","author":"J.C.W. Debuse","year":"1995","unstructured":"J.C.W. Debuse and V.J. Rayward-Smith, \u201cOne and a half dimensional clustering,\u201d in Proc. of the Conf. on Applied Decision Technologies, UNICOM, Brunel, 1995, pp. 377-389."},{"key":"237539_CR12","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1080\/01621459.1958.10501479","volume":"53","author":"W.D. Fisher","year":"1958","unstructured":"W.D. Fisher, \u201cOn grouping for maximum homogeneity,\u201d J. Am. Stat. Assoc., vol. 53, pp. 789-798, 1958.","journal-title":"J. Am. Stat. Assoc."},{"key":"237539_CR13","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"J.A. Hartigan, Clustering Algorithms, Wiley: New York, 1975."},{"key":"237539_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.2307\/2412355","volume":"17","author":"J.W. Carmichael","year":"1968","unstructured":"J.W. Carmichael, J.A. George, and R.S. Julius, \u201cFinding natural clusters,\u201d Syst. Zool., vol. 17, pp. 144-150, 1968.","journal-title":"Syst. Zool."},{"key":"237539_CR15","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/2412184","volume":"18","author":"J.W. Carmichael","year":"1969","unstructured":"J.W. Carmichael and P.H. Sneath, \u201cTaxonometric maps,\u201d Syst. Zool., vol. 18, pp. 402-415, 1969.","journal-title":"Syst. Zool."},{"key":"237539_CR16","volume-title":"Cluster Analysis","author":"B. Everitt","year":"1980","unstructured":"B. Everitt, Cluster Analysis, Wiley: New York, 1980."},{"key":"237539_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1022631118932","volume":"11","author":"R.C. Holte","year":"1993","unstructured":"R.C. Holte, \u201cVery simple classification rules perform well on most commonly used datasets,\u201d Machine Learning, vol. 11, pp. 63-91, 1993.","journal-title":"Machine Learning"},{"key":"237539_CR18","doi-asserted-by":"crossref","unstructured":"J. Catlett, \u201cOn changing continuous attributes into ordered discrete attributes,\u201d in Proc. of the European Working Session on Learning, edited by Y. Kodratoff, Springer-Verlag, 1991, pp. 164-178.","DOI":"10.1007\/BFb0017012"},{"key":"237539_CR19","unstructured":"U.M. Fayyad and K.B. Irani, \u201cMulti-interval discretization of continuous-valued attributes for classification learning,\u201d in Proc. of the Thirteenth Int. Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1993, pp. 1022-1027."},{"key":"237539_CR20","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J. Rissanen","year":"1983","unstructured":"J. Rissanen, \u201cA universal prior for integers and estimation by minimum description length,\u201d Annals of Statistics, vol. 11, pp. 416-431, 1983.","journal-title":"Annals of Statistics"},{"key":"237539_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1613\/jair.279","volume":"4","author":"J.R. Quinlan","year":"1996","unstructured":"J.R. Quinlan, \u201cImproved use of continuous attributes in C4.5,\u201d Journal of Artificial Intelligence Research, vol. 4, pp. 77-90, 1996.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"237539_CR22","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J.R. Quinlan","year":"1989","unstructured":"J.R. Quinlan and R.L. Rivest, \u201cInferring decision trees using the minimum description length principle,\u201d Information and Computation, vol. 80, pp. 227-248, 1989.","journal-title":"Information and Computation"},{"key":"237539_CR23","doi-asserted-by":"crossref","unstructured":"W. Maass, \u201cEfficient agnostic PAC-learning with simple hypotheses,\u201d in Proc. of the Seventh Annual ACM Conf. on Computational Learning Theory, 1994, pp. 67-75.","DOI":"10.1145\/180139.181016"},{"key":"237539_CR24","doi-asserted-by":"crossref","unstructured":"P. Auer, R. Holte, and W. Maass, \u201cTheory and application of agnostic pac-learning with small decision trees,\u201d in Prieditis and Russell [30], pp. 21-29.","DOI":"10.1016\/B978-1-55860-377-6.50012-8"},{"key":"237539_CR25","unstructured":"B. de la Iglesia, J.C.W. Debuse, and V.J. Rayward-Smith, \u201cDiscovering knowledge in commercial databases using modern heuristic techniques,\u201d in Simoudis et al. [31], pp. 44-49."},{"key":"237539_CR26","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, \u201cEquation of state calculation by fast computing machines,\u201d Journal of Chemical Physics, vol. 21, pp. 1087-1091, 1953.","journal-title":"Journal of Chemical Physics"},{"key":"237539_CR27","unstructured":"K.A. Dowsland, \u201cSimulated annealing,\u201d in Modern Heuristic Techniques for Combinatorial Problems, edited by C.R. Reeves, Blackwell Scientific, pp. 20-69, 1993."},{"key":"237539_CR28","series-title":"Tech. Rep.","volume-title":"An indexed bibliography of genetic algorithms and simulated annealing: Hybrids and comparisons","author":"J.T. Alander","year":"1995","unstructured":"J.T. Alander, \u201cAn indexed bibliography of genetic algorithms and simulated annealing: Hybrids and comparisons,\u201d Tech. Rep., Department of Information Technology and Production Economics, University of Vaasa, Finland, 1995."},{"key":"237539_CR29","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"M. Lundy and A. Mees, \u201cConvergence of an annealing algorithm,\u201d Mathematical Programming, vol. 34, pp. 111-124, 1986.","journal-title":"Mathematical Programming"},{"key":"237539_CR30","unstructured":"A. Prieditis and S. Russell (Eds.), Proc. of the Twelfth Int. Conf. on Machine Learning, Morgan Kaufmann, 1995."},{"key":"237539_CR31","unstructured":"E. Simoudis, J.W. Han, and U. Fayyad (Eds.), Proc. of the Second Int. Conf. on Knowledge Discovery and Data Mining (KDD-96), 1996."}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008339026836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008339026836\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008339026836.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:47:55Z","timestamp":1747579675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008339026836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["237539"],"URL":"https:\/\/doi.org\/10.1023\/a:1008339026836","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}