.png){kind=icon}
返回
An effective framework for supervised dimension reduction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.02.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider supervised dimension reduction (SDR) for problems with discrete inputs. Existing methods are computationally expensive, and often do not take the local structure of data into consideration when searching for a low-dimensional space. In this paper, we propose a novel framework for SDR with the aims that it can inherit scalability of existing unsupervised methods, and that it can exploit well label information and local structure of data when searching for a new space. The way we encode local information in this framework ensures three effects: preserving inner-class local structure, widening inter-class margin, and reducing possible overlap between classes. These effects are vital for success in practice. Such an encoding helps our framework succeed even in cases that data points reside in a nonlinear manifold, for which existing methods fail. The framework is general and flexible so that it can be easily adapted to various unsupervised topic models. We then adapt our framework to three unsupervised models which results in three methods for SDR. Extensive experiments on 10 practical domains demonstrate that our framework can yield scalable and qualitative methods for SDR. In particular, one of the adapted methods can perform consistently better than the state-of-the-art method for SDR while enjoying 30-450 times faster speed. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Supervised dimension reduction
Topic models
Scalability
Local structure
Manifold learning
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Unsupervised learning by probabilistic latent semantic analysis基于概率潜在语义分析的无监督学习.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏Discretization for naive-Bayes learning: managing discretization bias and varianceMACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏 没有更多内容
没有更多内容