IT-map: an Effective Nonlinear Dimensionality Reduction Method for Interactive Clustering
Scientists in many fields have the common and basic need of dimensionality reduction: visualizing the underlying structure of the massive multivariate data in a low-dimensional space. However, many dimensionality reduction methods confront the so-called "crowding problem" that clusters tend to overlap with each other in the embedding. Previously, researchers expect to avoid that problem and seek to make clusters maximally separated in the embedding. However, the proposed in-tree (IT) based method, called IT-map, allows clusters in the embedding to be locally overlapped, while seeking to make them distinguishable by some small yet key parts. IT-map provides a simple, effective and novel solution to cluster-preserving mapping, which makes it possible to cluster the original data points interactively and thus should be of general meaning in science and engineering.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDimensionality ReductionSimilar Papers 제목 키워드 기반
DRtool: An Interactive Tool for Analyzing High-Dimensional Clusterings
When faced with new data, we often conduct a cluster analysis to obtain a better understanding of the data's structure and the archetypical samples present in the data. This process often includes visualization of the da…
Deep Continuous Clustering
Clustering high-dimensional datasets is hard because interpoint distances become less informative in high-dimensional spaces. We present a clustering algorithm that performs nonlinear dimensionality reduction and cluster…
ClusteringDimensionality ReductionSparse Manifold Clustering and Embedding
We propose an algorithm called Sparse Manifold Clustering and Embedding (SMCE) for simultaneous clustering and dimensionality reduction of data lying in multiple nonlinear manifolds. Similar to most dimensionality reduct…
ClusteringDimensionality ReductionA Local Similarity-Preserving Framework for Nonlinear Dimensionality Reduction with Neural Networks
Real-world data usually have high dimensionality and it is important to mitigate the curse of dimensionality. High-dimensional data are usually in a coherent structure and make the data in relatively small true degrees o…
ClusteringDimensionality ReductionRepresentation LearningLearning Deep Representations By Distributed Random Samplings
In this paper, we propose an extremely simple deep model for the unsupervised nonlinear dimensionality reduction -- deep distributed random samplings, which performs like a stack of unsupervised bootstrap aggregating. Fi…
ClusteringDimensionality Reduction