Complex Moment-Based Supervised Eigenmap for Dimensionality Reduction
Akira Imakura,Momo Matsuda,Xiucai Ye,Tetsuya Sakurai +3 more
- 17 Jul 2019
- Vol. 33, Iss: 01, pp 3910-3918
TL;DR: This work proposes a novel complex moment-based supervised eigenmap including multiple eigenvectors for dimensionality reduction and provides a general formulation for matrix trace optimization methods to incorporate with ridge regression, which models the linear dependency between covariate variables and univariate labels.
read more
Abstract: Dimensionality reduction methods that project highdimensional data to a low-dimensional space by matrix trace optimization are widely used for clustering and classification. The matrix trace optimization problem leads to an eigenvalue problem for a low-dimensional subspace construction, preserving certain properties of the original data. However, most of the existing methods use only a few eigenvectors to construct the low-dimensional space, which may lead to a loss of useful information for achieving successful classification. Herein, to overcome the deficiency of the information loss, we propose a novel complex moment-based supervised eigenmap including multiple eigenvectors for dimensionality reduction. Furthermore, the proposed method provides a general formulation for matrix trace optimization methods to incorporate with ridge regression, which models the linear dependency between covariate variables and univariate labels. To reduce the computational complexity, we also propose an efficient and parallel implementation of the proposed method. Numerical experiments indicate that the proposed method is competitive compared with the existing dimensionality reduction methods for the recognition performance. Additionally, the proposed method exhibits high parallel efficiency.
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
An oversampling framework for imbalanced classification based on Laplacian eigenmaps
TL;DR: The proposed framework utilizes the Laplacian eigenmaps to find an optimal dimensional space, where the data are well separated and the generation of noise by SMOTE based oversampling methods can be avoided.
42
Data Collaboration Analysis Framework Using Centralization of Individual Intermediate Representations for Distributed Data Sets
Akira Imakura,Tetsuya Sakurai +1 more
TL;DR: This paper proposes a data collaboration analysis framework for distributed data sets that involves centralized machine learning while the original data sets and models are modified.
38
Collaborative Data Analysis: Non-model Sharing-Type Machine Learning for Distributed Data
Akira Imakura,Xiucai Ye,Tetsuya Sakurai +2 more
- 07 Jan 2021
TL;DR: In this paper, a non-model sharing-type collaborative learning method for distributed data analysis is proposed, in which data are partitioned in both samples and features, by centralizing the intermediate representations which are individually constructed in each party.
20
Another Use of SMOTE for Interpretable Data Collaboration Analysis
TL;DR: This study proposes an anchor data construction technique to improve the recognition performance without increasing the risk of data leakage and provides another use of SMOTE not for imbalanced data classifications but for a key technology of privacy-preserving integrated analysis.
10
References
LIII. On lines and planes of closest fit to systems of points in space
TL;DR: This paper is concerned with the construction of planes of closest fit to systems of points in space and the relationships between these planes and the planes themselves.
•Book
Pattern Recognition and Machine Learning (Information Science and Statistics)
Christopher M. Bishop
- 01 Aug 2006
TL;DR: Looking for competent reading resources?
10.1K
Nonlinear component analysis as a kernel eigenvalue problem
TL;DR: A new method for performing a nonlinear form of principal component analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
Objective Criteria for the Evaluation of Clustering Methods
TL;DR: This article proposes several criteria which isolate specific aspects of the performance of a method, such as its retrieval of inherent structure, its sensitivity to resampling and the stability of its results in the light of new data.