Data complexity in machine learning
- Creators
- Li, Ling
- Abu-Mostafa, Yaser S.
Abstract
We investigate the role of data complexity in the context of binary classification problems. The universal data complexity is defined for a data set as the Kolmogorov complexity of the mapping enforced by the data set. It is closely related to several existing principles used in machine learning such as Occam's razor, the minimum description length, and the Bayesian approach. The data complexity can also be defined based on a learning model, which is more realistic for applications. We demonstrate the application of the data complexity in two learning problems, data decomposition and data pruning. In data decomposition, we illustrate that a data set is best approximated by its principal subsets which are Pareto optimal with respect to the complexity and the set size. In data pruning, we show that outliers usually have high complexity contributions, and propose methods for estimating the complexity contribution. Since in practice we have to approximate the ideal data complexity measures, we also discuss the impact of such approximations.
Attached Files
Submitted - dcomplex.pdf
Files
Name | Size | Download all |
---|---|---|
md5:7b08c6f6eb70866146a8787a458fdd97
|
1.6 MB | Preview Download |
Additional details
- Eprint ID
- 27081
- Resolver ID
- CaltechCSTR:2006.004
- Created
-
2006-05-31Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports
- Series Volume or Issue Number
- 2006.003