Pattern classification using projection pursuit
Pattern Recognition
C4.5: programs for machine learning
C4.5: programs for machine learning
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Machine Learning
Decision Queue Classifier for Supervised Learning Using Rotated Hyperboxes
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
A decision-theoretic generalization of on-line learning and an application to boosting
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
The Journal of Machine Learning Research
VIS '91 Proceedings of the 2nd conference on Visualization '91
K-means clustering via principal component analysis
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Concise descriptions of subsets of structured sets
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Very sparse random projections
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Margin Trees for High-dimensional Classification
The Journal of Machine Learning Research
Hyper-rectangle-based discriminative data generalization and applications in data mining
Hyper-rectangle-based discriminative data generalization and applications in data mining
Solving multiclass learning problems via error-correcting output codes
Journal of Artificial Intelligence Research
An L-infinity Norm Visual Classifier
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Better GP benchmarks: community survey results and proposals
Genetic Programming and Evolvable Machines
Hi-index | 0.00 |
We introduce a classifier based on the L-infinity norm. This classifier, called CHIRP, is an iterative sequence of three stages (projecting, binning, and covering) that are designed to deal with the curse of dimensionality, computational complexity, and nonlinear separability. CHIRP is not a hybrid or modification of existing classifiers; it employs a new covering algorithm. The accuracy of CHIRP on widely-used benchmark datasets exceeds the accuracy of competitors. Its computational complexity is sub-linear in number of instances and number of variables and subquadratic in number of classes.