Stacking class probabilities obtained from view-based cluster ensembles

Authors:
Heysem Kaya;Olcay Kurşun;Hüseyin Şeker
Affiliations:
Department of Computer Engineering, Bogazici University, Bebek, Istanbul, Turkey;Department of Computer Engineering, Istanbul University, Avcilar, Istanbul, Turkey;Bio-Health Informatics Research Group at the Centre for Computational Intelligence, Department of Informatics, Faculty of Technology, De Montfort University, Leicester, UK
Venue:
ICAISC'10 Proceedings of the 10th international conference on Artificial intelligence and soft computing: Part I
Year:
2010

Citing 11
Cited 0

ARTMAP: Supervised real-time learning and classification of nonstationary data by a self-organizing neural network

Neural Networks
Fuzzy ART: Fast stable learning and categorization of analog patterns by an adaptive resonance system

Neural Networks
Combining labeled and unlabeled data with co-training

COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Neural Networks for Pattern Recognition

Neural Networks for Pattern Recognition
Intelligent Data Analysis: An Introduction

Intelligent Data Analysis: An Introduction
An introduction to variable and feature selection

The Journal of Machine Learning Research
Is Combining Classifiers with Stacking Better than Selecting the Best One?

Machine Learning
Unsupervised word sense disambiguation rivaling supervised methods

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Multi-View Clustering

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Introduction to Machine Learning (Adaptive Computation and Machine Learning)

Introduction to Machine Learning (Adaptive Computation and Machine Learning)
A comparison of methods for multiclass support vector machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In pattern recognition applications with high number of input features and insufficient number of samples, the curse of dimensionality can be overcome by extracting features from smaller feature subsets. The domain knowledge, for example, can be used to group some of the features together, which are also known as "views". The features extracted from views can later be combined (i.e. stacking) to train a final classifier. In this work, we demonstrate that even very simple features such as class-distributions within clusters of each view can serve as such valuable features.