Next Article in Journal
Necessary and Sufficient Optimality Conditions for Vector Equilibrium Problems on Hadamard Manifolds
Next Article in Special Issue
Forecasting for Ultra-Short-Term Electric Power Load Based on Integrated Artificial Neural Networks
Previous Article in Journal
Revisiting a Negative Cosmological Constant from Low-Redshift Data
Previous Article in Special Issue
Behavior Modality of Internet Technology on Reliability Analysis and Trust Perception for International Purchase Behavior
Article Menu

Export Article

Open AccessReview

Locality Sensitive Discriminative Unsupervised Dimensionality Reduction

1
Department of Automation, Xiamen University, Xiamen 361005, China
2
School of Information Engineering, Jimei University, Xiamen 361021, China
*
Authors to whom correspondence should be addressed.
Symmetry 2019, 11(8), 1036; https://doi.org/10.3390/sym11081036
Received: 15 July 2019 / Revised: 4 August 2019 / Accepted: 7 August 2019 / Published: 12 August 2019
(This article belongs to the Special Issue Selected Papers from IIKII 2019 conferences in Symmetry)
  |  
PDF [7014 KB, uploaded 12 August 2019]
  |  

Abstract

Graph-based embedding methods receive much attention due to the use of graph and manifold information. However, conventional graph-based embedding methods may not always be effective if the data have high dimensions and have complex distributions. First, the similarity matrix only considers local distance measurement in the original space, which cannot reflect a wide variety of data structures. Second, separation of graph construction and dimensionality reduction leads to the similarity matrix not being fully relied on because the original data usually contain lots of noise samples and features. In this paper, we address these problems by constructing two adjacency graphs to stand for the original structure featuring similarity and diversity of the data, and then impose a rank constraint on the corresponding Laplacian matrix to build a novel adaptive graph learning method, namely locality sensitive discriminative unsupervised dimensionality reduction (LSDUDR). As a result, the learned graph shows a clear block diagonal structure so that the clustering structure of data can be preserved. Experimental results on synthetic datasets and real-world benchmark data sets demonstrate the effectiveness of our approach. View Full-Text
Keywords: machine learning; graph embedding method; dimensionality reduction; diversity learning; adaptive neighbors machine learning; graph embedding method; dimensionality reduction; diversity learning; adaptive neighbors
Figures

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Gao, Y.-L.; Luo, S.-Z.; Wang, Z.-H.; Chen, C.-C.; Pan, J.-Y. Locality Sensitive Discriminative Unsupervised Dimensionality Reduction. Symmetry 2019, 11, 1036.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top