Feature Selection For High-Dimensional Clustering
We present a nonparametric method for selecting informative features in high-dimensional clustering problems. We start with a screening step that uses a test for multimodality. Then we apply kernel density estimation and mode clustering to the selected features. The output of the method consists of a list of relevant features, and cluster assignments. We provide explicit bounds on the error rate of the resulting clustering. In addition, we provide the first error bounds on mode based clustering.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDensity Estimationfeature selectionVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
GOLFS: Feature Selection via Combining Both Global and Local Information for High Dimensional Clustering
It is important to identify the discriminative features for high dimensional clustering. However, due to the lack of cluster labels, the regularization methods developed for supervised feature selection can not be direct…
Correlation based feature selection with clustering for high dimensional data
Feature selection is an essential technique to reduce the dimensionality problem in data mining task. Traditional feature selection algorithms are fail to scale on large space. This paper proposes a new method to solve …
Clusteringfeature selectionVocal Bursts Intensity Predictioni-IF-Learn: Iterative Feature Selection and Unsupervised Learning for High-Dimensional Complex Data
Unsupervised learning of high-dimensional data is challenging due to irrelevant or noisy features obscuring underlying structures. It's common that only a few features, called the influential features, meaningfully defin…
Deep ClusteringA Supervised Feature Selection Method For Mixed-Type Data using Density-based Feature Clustering
Feature selection methods are widely used to address the high computational overheads and curse of dimensionality in classifying high-dimensional data. Most conventional feature selection methods focus on handling homoge…
Clusteringfeature selectionRandomized Dimensionality Reduction for k-means Clustering
We study the topic of dimensionality reduction for $k$-means clustering. Dimensionality reduction encompasses the union of two approaches: \emph{feature selection} and \emph{feature extraction}. A feature selection based…
ClusteringDimensionality Reductionfeature selection