Subsets more representative than random ones

Authors:
Ilia Nouretdinov
Affiliations:
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, England
Venue:
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
Year:
2007

Citing 4
Cited 0

Ridge Regression Confidence Machine

ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Machine-Learning Applications of Algorithmic Randomness

ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Transduction with confidence and credibility

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Learning by transduction

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

Suppose we have a database that describes a set of objects, and our aim is to find its representative subset of a smaller size. Representativeness here means the measure of quality of prediction when the subset is used instead of the whole set in a typical machine learning procedure. We research how to find a subset that is more representative than a random selection of the same size.