Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Deng-Shiang Wang

dblp:96/6855 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 87% Learning theory · 13%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
discriminant analysis
0.112006
A Linear Feature Extraction for Multiclass Classification Problems Based on Class Mean and Covariance Discriminant Information · IEEE Trans. Pattern Anal. Mach. Intell. 2006
Machine learning › Representation and self-supervised learning › representation learning › feature extraction
linear feature extraction
0.112006
A Linear Feature Extraction for Multiclass Classification Problems Based on Class Mean and Covariance Discriminant Information · IEEE Trans. Pattern Anal. Mach. Intell. 2006

Methods — techniques the papers use, named apart from their topics

spanning-tree-based estimation · 0.1common-mean feature extraction · 0.1approximate pairwise accuracy criterion · 0.1
YearPublicationVenuePosition
2006 A Linear Feature Extraction for Multiclass Classification Problems Based on Class Mean and Covariance Discriminant Information
abstract
A parametric linear feature extraction method is proposed for multiclass classification. The skeleton of the proposed method consists of two types of schemes that are complementary to each other with regard to the discriminant information used. The approximate pairwise accuracy criterion (aPAC) and the common-mean feature extraction (CMFE) are chosen to exploit the discriminant information about class mean and about class covariance, respectively. Choosing aPAC rather than the linear discriminant analysis (LDA) can also resolve the problem of overemphasized large distances introduced by LDA, while maintaining other decent properties of LDA. To alleviate the suboptimum problem caused by a direct cascading of the two different types of schemes, there should be a mechanism for sorting and merging features based on their effectiveness. Usage of a sample-based classification error estimation for evaluation of effectiveness of features usually costs a lot of computational time. Therefore, we develop a fast spanning-tree-based parametric classification accuracy estimator as an intermediary for the aPAC and CMFE combination. The entire framework is parametric-based. This avoids paying a costly price in computation, which normally happens to the sample-based approach. Our experiments have shown that the proposed method can achieve a satisfactory performance on real data as well as simulated data.
Pi-Fuei Hsieh, Deng-Shiang Wang, Chia-Wei Hsu
IEEE Trans. Pattern Anal. Mach. Intell.2