Unsupervised dimensionality reduction versus supervised regularization for classification from sparse data
From MaRDI portal
Publication:2218343
DOI10.1007/s10618-019-00616-4zbMath1458.68160OpenAlexW2916503760MaRDI QIDQ2218343
Publication date: 15 January 2021
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-019-00616-4
Directional data; spatial statistics (62H11) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bi-cross-validation of the SVD and the nonnegative matrix factorization
- The SVD and reduced rank signal processing
- Comparative study on classifying human activities with miniature inertial and magnetic sensors
- Selection of relevant features and examples in machine learning
- Multiple comparisons in induction algorithms
- Measuring classifier performance: a coherent alternative to the area under the ROC curve
- Document clustering using nonnegative matrix factorization
- Modern Multivariate Statistical Techniques
- Estimation of the Click Volume by Large Scale Regression Analysis
- 10.1162/jmlr.2003.3.4-5.993
- 10.1162/153244303322753616
- 10.1162/153244303322753670
- An Introduction to Statistical Learning
- Model Averaging and Dimension Selection for the Singular Value Decomposition
- Learning the parts of objects by non-negative matrix factorization
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Unsupervised dimensionality reduction versus supervised regularization for classification from sparse data