The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
Open accessAbstract
This paper introduces ICET, a new algorithm for cost-sensitive classification. ICET uses a genetic algorithm to evolve a population of biases for a decision tree induction algorithm. The fitness function of the genetic algorithm is the average cost of classification when using the decision tree, including both the costs of tests (features, measurements) and the costs of classification errors. ICET is compared here with three other algorithms for cost-sensitive classification - EG2, CS-ID3, and IDX - and also with C4.5, which classifies without regard to cost. The five algorithms are evaluated empirically on five real-world medical datasets. Three sets of experiments are performed. The first set examines the baseline performance of the five algorithms on the five datasets and establishes that ICET performs significantly better than its competitors. The second set tests the robustness of ICET under a variety of conditions and shows that ICET maintains its advantage. The third set looks at ICET's search in bias space and discovers a way to improve the search.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
(1988) · Cited by 16,582
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
CANALIZATION OF DEVELOPMENT AND THE INHERITANCE OF ACQUIRED CHARACTERS
WADDINGTON, C. H. (1942) · Nature · doi:10.1038/150563a0 · Cited by 3,255
Optimization of Control Parameters for Genetic Algorithms
Grefenstette, J. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289288 · Cited by 2,854
Friedman, J. H., & Stuetzle, W. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477729 · Cited by 2,216
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
UCI Repository of Machine Learning Databases
Murphy, P. M. (1994) · Medical Entomology and Zoology · Cited by 1,844
Baldwin, J. M. (1896) · The American Naturalist · doi:10.1086/276408 · Cited by 1,781
Heuristics: Intelligent search strategies for computer problem solving.
(1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90100-1 · Cited by 1,430
How Learning Can Guide Evolution.
Hinton, G. E., & Nowlan, S. J. (1987) · Cited by 682
Combinations of genetic algorithms and neural networks: a survey of the state of the art
Schaffer, J. D., Whitley, D., & Eshelman, L. J. (2003) · [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks · doi:10.1109/cogann.1992.273950 · Cited by 570
Using genetic algorithms for concept learning
De Jong, K. A., Spears, W. M., & Gordon, D. F. (1993) · Machine Learning · doi:10.1007/bf00993042 · Cited by 445
Selecting a classification method by cross-validation
Schaffer, C. (1993) · Machine Learning · doi:10.1007/bf00993106 · Cited by 442
Letter recognition using Holland-style adaptive classifiers
Frey, P. W., & Slate, D. J. (1991) · Machine Learning · doi:10.1007/bf00114162 · Cited by 409
Arita, T., & Suzuki, R. (2000) · Artificial Life VII · doi:10.7551/mitpress/1432.003.0027 · Cited by 353
Lamarckian evolution, the Baldwin effect and function optimization
Whitley, D., Gordon, V. S., & Mathias, K. E. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58484-6_245 · Cited by 326
Classifier systems and the animat problem
Wilson, S. W. (1987) · Machine Learning · doi:10.1007/bf00058679 · Cited by 285
Learning sequential decision rules using simulation models and competition
Grefenstette, J. J., Ramsey, C. L., & Schultz, A. C. (1990) · Machine Learning · doi:10.1007/bf00116876 · Cited by 271
Interactions between learning and evolution:
Suzuki, R., & Arita, T. (2004) · Biosystems · doi:10.1016/j.biosystems.2004.04.002 · Cited by 241
Genetic Reinforcement Learning for Neurocontrol Problems
Whitley, D., Dominic, S., Das, R., & Anderson, C. W. (1993) · Machine Learning · doi:10.1007/bf00993045 · Cited by 215
Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect
Gruau, F., & Whitley, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.3.213 · Cited by 206
The Use of Background Knowledge in Decision Tree Induction
Núñez, M. (1991) · Machine Learning · doi:10.1023/a:1022609710832 · Cited by 196
Morgan, C. L. (1896) · Science · doi:10.1126/science.4.99.733 · Cited by 193
Cost-Sensitive Learning of Classification Knowledge and Its Applications in Robotics
Tan, M. (1993) · Machine Learning · doi:10.1007/bf00993101 · Cited by 151
Introduction: The challenge of reinforcement learning
Sutton, R. S. (1992) · Machine Learning · doi:10.1007/bf00992695 · Cited by 150
Feature Selection for Case-Based Classification of Cloud Types: An Empirical Comparison
Aha, D. W., & Bankert, R. L. (1994) · Cited by 130
When learning guides evolution
Smith, J. M. (1987) · Nature · doi:10.1038/329761a0 · Cited by 129
Technical note: Bias and the quantification of stability
Turney, P. D. (1995) · Machine Learning · doi:10.1007/bf00993473 · Cited by 121
Self-citationIntroduction: The Challenge of Reinforcement Learning
Sutton, R. S. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3618-5_1 · Cited by 114
The use of background knowledge in decision tree induction
N��ez, M. (1991) · Machine Learning · doi:10.1007/bf00114778 · Cited by 113
Generating better decision trees
Norton, S. W. (1989) · International Joint Conference on Artificial Intelligence · Cited by 109
Inductive Policy: The Pragmatics of Bias Selection
Provost, F. J., & Buchanan, B. G. (1995) · Machine Learning · doi:10.1007/bf00993474 · Cited by 89
Lookahead Feature Construction for Learning Hard Concepts
Ragavan, H., & Rendell, L. A. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50039-3 · Cited by 79
Cost-sensitive pruning of decision trees
Knoll, U., Nakhaeizadeh, G., & Tausend, B. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_79 · Cited by 68
Building robust learning systems by combining induction and optimization
Tcheng, D., Lambert, B. L., Lu, S. C.-Y., & Rendell, L. A. (1989) · Cited by 43
Economic Induction: A Case Study.
Núñez, M. (1988) · Cited by 37
Explicitly biased generalization
Gordon, D. F., & Perlis, D. R. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00317.x · Cited by 37
CSL: a cost-sensitive learning system for sensing and grasping objects
Tan, M. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1990.126097 · Cited by 35
Automated network troubleshooting knowledge acquisition
Lirov, Y., & Yue, O.-C. (1991) · Applied Intelligence · doi:10.1007/bf00058878 · Cited by 11
Cited by
A review of methods for the assessment of prediction errors in conservation presence/absence models
FIELDING, A. H., & BELL, J. F. (1997) · Environmental Conservation · doi:10.1017/s0376892997000088 · Cited by 6,956
López, V., Fernández, A., García, S., Palade, V., & Herrera, F. (2013) · Information Sciences · doi:10.1016/j.ins.2013.07.007 · Cited by 1,590
Feature subset selection using a genetic algorithm
Yang, J., & Honavar, V. (1998) · IEEE Intelligent Systems · doi:10.1109/5254.671091 · Cited by 1,362
Training cost-sensitive neural networks with methods addressing the class imbalance problem
Zhou, Z.-H., & Liu, X.-Y. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.17 · Cited by 1,326
Get another label? improving data quality and data mining using multiple, noisy labelers
Sheng, V. S., Provost, F., & Ipeirotis, P. G. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401965 · Cited by 1,165
Metadata
- Authors
- Turney, P. D.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 1995-03-01
- Volume
- 2
- Pages
- 369-409
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2104597806
- Cited by
- 570
- References
- 42
- FWCI
- 35.29
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.