返回
Feature selection for unsupervised learning through local learning
DOI:10.1016/j.patrec.2014.11.006.png)
摘要
En 中文
We consider the problem of feature selection for unsupervised learning and develop a new algorithm capable of identifying informative features supporting complex structures embedded in a high-dimensional space. The development of the algorithm is inspired by human learning in detecting complex data structures. We formulate it as an optimization problem with a well-defined objective function, and solve the problem by using an iterative approach. The algorithm can be easily implemented and is computationally very efficient. We use gap statistics to estimate the parameters so that the proposed method is completely parameter-free. We also develop a scheme based on permutation tests to estimate the statistical significance of the presence of a data structure. We demonstrate the effectiveness and versatility of the algorithm by comparing it with seven existing methods on a set of synthetic datasets with a wide variety of structures and cancer microarray gene expression datasets. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Feature selection
Unsupervised learning
Clustering
Manifold learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
Gene expression profiles of prostate cancer reveal involvement of multiple molecular pathways in the metastatic process
BMC CANCER
IF3.4
MLL translocations specify a distinct gene expression profile that distinguishes a unique leukemia
NATURE GENETICS
IF31.8


