Tailored Aggregation for Classification

Authors:
Tristan Mary-Huard;Stephane Robin
Affiliations:
UMR AgroParisTech/INRIA, Paris;UMR AgroParisTech/INRIA, Paris
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2009

Citing 0
Cited 4

Locally centralizing samples for nearest neighbors

PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Variable selection in model-based discriminant analysis

Journal of Multivariate Analysis
Perceptual relativity-based local hyperplane classification

Neurocomputing
Cognitive gravitation model for classification on small noisy data

Neurocomputing

Quantified Score

Hi-index	0.15

Visualization

Abstract

Compression and variable selection are two classical strategies to deal with large-dimension data sets in classification. We propose an alternative strategy, called aggregation, which consists of a clustering step of redundant variables and a compression step within each group. We develop a statistical framework to define tailored aggregation methods that can be combined with selection methods to build reliable classifiers that benefit from the information contained in redundant variables. Two algorithms are proposed for ordered and nonordered variables, respectively. Applications to the kNN and CART algorithms are presented.