2009
DOI: 10.1016/j.patrec.2009.06.013
|View full text |Cite
|
Sign up to set email alerts
|

An incremental dimensionality reduction method on discriminant information for pattern classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…Compared with classifying the original data set { x }, classifying data set { y * = W * x } corresponding to the optimal projection matrix W * is relatively easier and will produce higher accuracy. The LDA technique is a very successful and effective supervised method in pattern classification . Compared with unsupervised methods, LDA is too expensive for high‐dimensional datasets because its computational complexity is determined by the dimensionality of data points.…”
Section: The New Method—ttfo Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Compared with classifying the original data set { x }, classifying data set { y * = W * x } corresponding to the optimal projection matrix W * is relatively easier and will produce higher accuracy. The LDA technique is a very successful and effective supervised method in pattern classification . Compared with unsupervised methods, LDA is too expensive for high‐dimensional datasets because its computational complexity is determined by the dimensionality of data points.…”
Section: The New Method—ttfo Modelmentioning
confidence: 99%
“…However, as our data set has low dimensionality, it is appropriate to use the LDA for our application. The tool used for the data classification in this study is implemented in an earlier work on dimensionality reduction method for pattern classification .…”
Section: The New Method—ttfo Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Classical MDS. MDS [4,8,16] is one of the global nonlinear techniques for dimensionality reduction which attempts to preserve global properties of the data. It maps the highdimensional data representation to a low-dimensional representation while retaining the pairwise distances between the data points as faithfully as possible.…”
Section: Mds and Isomap Techniquesmentioning
confidence: 99%
“…Recently, a great many methods of dimensionality reduction methods based on manifold learning have been introduced and some classical techniques have been further improved [8][9][10][11][12][13][14][15]. In [8], Hu et al proposed a new dimensionality reduction algorithm called discriminant multidimensional mapping (DMM), which combines the advantages of multidimensional scaling (MDS) and LDA. DMM is effective for small sample datasets with high dimensionality.…”
Section: Introductionmentioning
confidence: 99%