.png){kind=icon}
返回
Optimal subspace classification method for complex data
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-012-0080-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
KNNModel algorithm is an improved version for k-nearest neighbor method. However, it has the problem of high time complexity and lower performance when dealing with complex data. An optimal subspace classification method called IKNNModel is proposed in this paper by projecting different training samples onto their own optimal subspace and constructing the corresponding class cluster and pure cluster as the basis of classification. For datasets with complex structure, that is, the training samples from different categories are overlapped with one another on the original space or have a high dimensionality, the proposed method can construct the corresponding clusters for the overlapped samples on their own subspaces easily. Experimental results show that compared with KNNModel, the proposed method not only significantly improves the classification performance on datasets with complex structure, but also improves the efficiency of the classification.
Keyword:
k-nearest neighbor
KNNModel
Subspace
Classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Text categorization with support vector machines.: How to represent texts in input space?.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏Adaptive least squares support vector machines filter for hand tremor canceling in microsurgery
PREAI
分享收藏An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data基于熵权的高维稀疏数据子空间聚类k-means算法
PREAI
分享收藏A WordNet-based semantic approach to textual entailment and cross-lingual textual entailment基于WordNet的文本蕴涵和跨语言文本蕴涵的语义方法
PREAI
分享收藏
查看更多内容