Polynomial Runtime Bounds for Fixed-Rank Unsupervised Least-Squares Classification.
Fabian GiesekeTapio PahikkalaChristian IgelPublished in: ACML (2013)
Keyphrases
- least squares
- unsupervised learning
- supervised learning
- supervised classification
- pattern recognition
- machine learning
- feature selection
- partially supervised
- classification systems
- classification method
- classification accuracy
- decision trees
- unsupervised classification
- support vector
- automatic classification
- generalization ability
- linear regression
- support vector machine
- unsupervised clustering
- preprocessing
- classification models
- feature space
- decision rules
- support vector machine svm
- text classification
- feature vectors
- semi supervised
- cross validation
- benchmark datasets
- classification algorithm
- lower bound
- model selection
- image classification
- feature set
- training set
- upper and lower bounds
- upper bound