Journal Article10.1016/J.ESWA.2021.115055
Supervised discriminant Isomap with maximum margin graph regularization for dimensionality reduction
37
TL;DR: A novel dimensionality reduction method called supervised discriminant Isomap is proposed to solve the first two problems mentioned above and can capture more discriminative information from raw data than other isomap based methods.
read more
Abstract: As one of the most popular nonlinear dimensionality reduction methods, Isomap has been widely used in pattern recognition and machine learning. However, Isomap has the following problems: (1) Isomap is an unsupervised dimensionality reduction method, it cannot use class label information to obtain discriminative low dimensional embedding for classification; (2) The embedding performance of Isomap is sensitive to neighborhood size parameter; (3) Isomap cannot deal with outside new data by direct embedding. In this paper, a novel dimensionality reduction method called supervised discriminant Isomap is proposed to solve the first two problems mentioned above. Specifically, first, raw data points are partitioned into different manifolds by using their class label information. Then, supervised discriminant Isomap aims at seeking an optimal nonlinear subspace to preserve the geometrical structure of each manifold according to the Isomap criterion, and to enhance the discriminating capability by maximizing the distances between data points of different classes and the maximum margin graph regularization term. Finally, the corresponding optimization problems are solved by using eigen-decomposition algorithm. Further, we extend supervised discriminant Isomap to a linear dimensionality reduction method called supervised discriminant Isomap projection for handling the above three problems. Moreover, our approaches have three important characteristics: (1) Proposed methods adaptively estimate the local neighborhood surrounding each sample based on data density and similarity; (2) The objective functions of proposed methods can maximize margins between the each classes in the dimension-reduced feature space; (3) The objective functions of proposed methods have closed-form solutions. Furthermore, our methods can capture more discriminative information from raw data than other Isomap based methods. Extensive experiments on nine data sets demonstrate that the proposed methods are superior to the related state-of-the-art methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Semisupervised dynamic soft sensor based on complementary ensemble empirical mode decomposition and deep learning
Runyuan Guo,Han Liu +1 more
TL;DR: A semi-supervised dynamic soft sensor is proposed to capture the dynamic characteristics of data while removing noise and redundancy within the data, thus ensuring improved accuracy.
27
Effects of loss function and data sparsity on smooth manifold extraction with deep model
TL;DR: In this article , a deep model based on the Brenier theorem was proposed to extract smooth manifold, which outperformed the state-of-the-art models in many metrics, such as manifold smoothness and computational error.
15
Robust discriminative projection with dynamic graph regularization for feature extraction and classification
TL;DR: Wang et al. as mentioned in this paper proposed robust discriminative projection with dynamic graph regularization (RDPDG) to deal with the problem of noisy and outlier mixed data.
8
A deep hypersphere approach to high-dimensional anomaly detection
TL;DR: In this paper , the authors proposed a detection method using the combination of an autoencoder and a hypersphere, where an angle kernel and a radius kernel are derived in order to learn a compact boundary of distinguishing anomalous and normal instances.
8
Theoretical framework in graph embedding-based discriminant dimensionality reduction
TL;DR: A theoretical framework considering hypothesis-margin is derived in this study to guide the selection of weight functions, whose truth is verified in a popular algorithm and a more effective supervised discriminant graph embedding-based dimensionality reduction method is introduced.
7
References
•Journal Article
Visualizing Data using t-SNE
TL;DR: A new technique called t-SNE that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map, a variation of Stochastic Neighbor Embedding that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map.
Deep learning in neural networks
TL;DR: This historical survey compactly summarizes relevant work, much of it from the previous millennium, review deep supervised learning, unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.
18.7K
Nonlinear dimensionality reduction by locally linear embedding.
Sam T. Roweis,Lawrence K. Saul +1 more
TL;DR: Locally linear embedding (LLE) is introduced, an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs that learns the global structure of nonlinear manifolds.
A global geometric framework for nonlinear dimensionality reduction.
TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
Related Papers (5)
Rui-jun Gu,Wen-bo Xu +1 more
- 01 Apr 2007
Bo Yang,Ming Xiang,Yupei Zhang +2 more
- 12 Jul 2015
Jian Cheng,Can Cheng,Yi-nan Guo +2 more
- 12 Nov 2012