ID | 113538 |
著者 |
Takeuchi, Yohei
The University of Tokushima
|
キーワード | Pattern recognition
principal component analysis
supervised learning
|
資料タイプ |
学術雑誌論文
|
抄録 | In the field of pattern recognition, principal component analysis (PCA) is one of the most well-known feature extraction methods for reducing the dimensionality of high-dimensional datasets. Simple-PCA (SPCA), which is a faster version of PCA, performs effectively with iterative operated learning. However, SPCA might not be efficient when input data are distributed in a complex manner because it learns without using the class information in the dataset. Thus, SPCA cannot be said to be optimal from the perspective of feature extraction for classification. In this study, we propose a new learning algorithm that uses the class information in the dataset. Eigenvectors spanning the eigenspace of the dataset are produced by calculating the data variations within each class. We present our proposed algorithm and discuss the results of our experiments that used UCI datasets to compare SPCA and our proposed algorithm.
|
掲載誌名 |
International Journal of Machine Learning and Computing
|
ISSN | 20103700
|
巻 | 2
|
号 | 5
|
開始ページ | 720
|
終了ページ | 724
|
発行日 | 2012-10
|
権利情報 | This article is licensed under an open access Creative Commons CC BY 4.0 license(https://creativecommons.org/licenses/by/4.0/), which means all papers can be downloaded, shared, and reused without restriction, as long as the original authors are properly cited.
|
EDB ID | |
出版社版DOI | |
出版社版URL | |
フルテキストファイル | |
言語 |
eng
|
著者版フラグ |
出版社版
|
部局 |
理工学系
|