Inductive knowledge acquisition: a case study
Proceedings of the Second Australian Conference on Applications of expert systems
Machine Learning
Pruning Algorithms for Rule Learning
Machine Learning
Machine Learning
Machine Learning
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Interactive Approach to Building Classification Models by Clustering and Cluster Validation
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
A Visual Method of Cluster Validation with Fastmap
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
A Machine Learning Algorithm Based on Supervised Clustering and Classification
AMT '01 Proceedings of the 6th International Computer Science Conference on Active Media Technology
CBC: Clustering Based Text Classification Requiring Minimal Labeled Data
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automated Variable Weighting in k-Means Type Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
What are the grand challenges for data mining?: KDD-2006 panel report
ACM SIGKDD Explorations Newsletter
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Two credit scoring models based on dual strategy ensemble trees
Knowledge-Based Systems
Nearest neighbor pattern classification
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper presents a Crotch Ensemble classification model for high dimensional data. A Crotch Ensemble is obtained from a decision cluster tree built by calling a clustering algorithm recursively. A crotch is an inner node of the tree together with its direct children. If the children of a crotch have more than one dominant class, the crotch is defined as a crotch predictor. Each crotch predictor constructs a classifier by itself. A Crotch Ensemble consists of a set of crotch predictors. When classifying a new object, a subset of crotch predictors is selected according to the distances between the object and the crotch predictors. A classification is made on the object as the class predicted by the crotch predictors with the maximum accumulative weights. The experimental results on both synthetic and real data have shown that the Crotch Ensemble model can get better classification results on high dimensional data than other classification methods.