MLC++: a machine learning library in C++
Published 17 December 2002
Ron Kohavi, George H. John, Ryan Long, Duncan Manley, Karl Pfleger
Citations197
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The problems M LC++ aims to solve, the design of MLC++, and the current functionality are discussed, including the attempt to extract commonalities of algorithms and decompose them for a unified view that is simple, coherent, and extensible.
Abstract
We present MLC++, a library of C++ classes and tools for supervised machine learning. While MLC++ provides general learning algorithms that can be used by end users, the main objective is to provide researchers and experts with a wide variety of tools that can accelerate algorithm development, increase software reliability, provide comparison tools, and display information visually. More than just a collection of existing algorithms, MLC++ is can attempt to extract commonalities of algorithms and decompose them for a unified view that is simple, coherent, and extensible. In this paper we discuss the problems MLC++ aims to solve, the design of MLC++, and the current functionality.>
Keywords
Computer Science
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
Machine LearningInduction of decision trees
12,383 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
Machine LearningInstance-Based Learning Algorithms
4,117 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
Machine LearningInstance-based learning algorithms
2,915 Citations1991David W. Aha, Dennis Kibler +1 more
This paper describes how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy and extends the nearest neighbor algorithm, which has large storage requirements.
Elsevier eBooksIrrelevant Features and the Subset Selection Problem
2,374 Citations1994George H. John, Ron Kohavi +1 more
A method for feature subset selection using cross-validation that is applicable to any induction algorithm is described, and experiments conducted with ID3 and C4.5 on artificial and real datasets are discussed.
TechnometricsMachine Learning, Neural and Statistical Classification
2,188 Citations1995Bill Fulkerson, D. Michie +2 more
Machine LearningVery Simple Classification Rules Perform Well on Most Commonly Used Datasets
1,798 Citations1993Robert C. Holte
On most datasets studied, the best of very simple rules that classify examples on the basis of a single attribute is as accurate as the rules induced by the majority of machine learning systems.
IEEE Transactions on Software EngineeringA technique for drawing directed graphs
668 Citations1993Emden R. Gansner, E. Koutsofios +2 more
A four-pass algorithm for drawing directed graphs is presented, which creates good drawings and is fast.
Encyclopedia of Artificial Intelligence
425 Citations2021
Computational learning theory
322 Citations1992Dana Angluin
The general AI meetings, AAAI and IJCAI, currently have a large number of papers devoted to learning, as do the neural net meetings, and the European meetings on Analogical and Inductive Inference and the AI machine learning communit y’s annual International Conference on Machine Learning.
Machine LearningHypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments
187 Citations1994Janusz Wnek, Ryszard S. Michalski
The developed AQ17-HCI system consistently outperformed, in terms of the prediction accuracy on new examples, all systems that it was compared to, including the AQ15 rule learning system, GREEDY3 and GROVE decision-list learning systems, and REDWOOD and FRINGE decision-tree learning systems.
Feature Subset Selection as Search with Probabilistic Estimates
60 Citations1994Ron Kohavi
This work formulate the search for a feature subset as an abstract search problem with probabilistic estimates, and shows how recent feature subset selection algorithms in the machine learning literature fit into this search problem as simple hill climbing approaches.
Bottom-up induction of oblivious read-once decision graphs: strengths and limitations
39 Citations1994Ron Kohavi
Useful Feature Subsets and Rough Set Reducts
34 Citations1994Ron Kohavi, Brian Frasca
It is demonstrated that by choosing a useful subset of features for the indis-cernibility relation, an induction algorithm based on simple decision table can have high prediction accuracy on artiicial and real-world datasets.