Discretisation of Continuous Commercial Database Features for a Simulated Annealing Data Mining Algorithm
Authors:
- 1 November 1999
- journal article
- Published by Springer Nature in Applied Intelligence
- Vol. 11 (3) , 285-295
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Feature Subset Selection within a Simulated Annealing Data Mining AlgorithmJournal of Intelligent Information Systems, 1997
- Supervised and Unsupervised Discretization of Continuous Features1995
- Theory and Applications of Agnostic PAC-Learning with Small Decision Trees1995
- Very Simple Classification Rules Perform Well on Most Commonly Used DatasetsMachine Learning, 1993
- On changing continuous attributes into ordered discrete attributes1991
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Synthesizing Statistical Knowledge from Incomplete Mixed-Mode DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 1987
- Convergence of an annealing algorithmMathematical Programming, 1986
- On Grouping for Maximum HomogeneityJournal of the American Statistical Association, 1958
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953