2021
DOI: 10.1016/j.eswa.2021.115055
|View full text |Cite
|
Sign up to set email alerts
|

Supervised discriminant Isomap with maximum margin graph regularization for dimensionality reduction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 26 publications
0
12
0
Order By: Relevance
“…Isomap preserves the global geometric features of the initial data and extracts features by reconstructing the underlying smooth manifold of HSI. It is nonlinear dimensionality reduction based on linear and multidimensional scaling transformation 18 . Isomap has been applied in image and HSI classification 19 , 20 , but there is no report on visible-NIR hyperspectral classification of grass.…”
Section: Methodsmentioning
confidence: 99%
“…Isomap preserves the global geometric features of the initial data and extracts features by reconstructing the underlying smooth manifold of HSI. It is nonlinear dimensionality reduction based on linear and multidimensional scaling transformation 18 . Isomap has been applied in image and HSI classification 19 , 20 , but there is no report on visible-NIR hyperspectral classification of grass.…”
Section: Methodsmentioning
confidence: 99%
“…Isomap is a non‐linear stream shape algorithm based on neighbourhood map and multidimensional scaling (MDS) analysis [20, 21], whose main idea is to estimate the global stream shape geodesic distance between each data point using local neighbourhood distance, and to replace the Euclidean distance by establishing the original inter‐data geodesic distance as a similarity measure between sample points that better reflects the true low‐dimensional structure of the manifold. The process of Isomap algorithm is as follows: Construct a neighbourhood graph G. Set the number of transformer sample data to n and the set of samples in high‐dimensional space to X={}xi|i=1,2,,n,XRN $X=\left\{{x}_{i}\vert i=1,2,\text{\ldots },n\right\},X\in {R}^{N}$.…”
Section: Transformer Fault Feature Extractionmentioning
confidence: 99%
“…According to whether the properties retained in manifold learning are global or local, manifold learning can be divided into global property preserving and local property preserving methods. As a classical manifold learning method with global property preservation, ISOMAP [10] calculated geodesic distance between all sample points and constructed global geodesic matrix to maintain global geometric properties of low-dimensional manifolds nested in high-dimensional space. However, in the face of large sample data, the calculation cost of ISOMAP algorithm is very high, resulting in low calculation efficiency.…”
Section: Related Workmentioning
confidence: 99%