paper-with-me

Papers

Tensor Analysis with n-Mode Generalized Difference Subspace

2019-09-04 · Bernardo B. Gatto, Eulanda M. dos Santos, Alessandro L. Koerich, Kazuhiro Fukui, Waldir S. S. Junior

The increasing use of multiple sensors, which produce a large amount of multi-dimensional data, requires efficient representation and classification methods. In this paper, we present a new method for multi-dimensional data classification that relies on two premises: 1) multi-dimensional data are usually represented by tensors, since this brings benefits from multilinear algebra and established tensor factorization methods; and 2) multilinear data can be described by a subspace of a vector space. The subspace representation has been employed for pattern-set recognition, and its tensor representation counterpart is also available in the literature. However, traditional methods do not use discriminative information of the tensors, degrading the classification accuracy. In this case, generalized difference subspace (GDS) provides an enhanced subspace representation by reducing data redundancy and revealing discriminative structures. Since GDS does not handle tensor data, we propose a new projection called n-mode GDS, which efficiently handles tensor data. We also introduce the n-mode Fisher score as a class separability index and an improved metric based on the geodesic distance for tensor data similarity. The experimental results on gesture and action recognition show that the proposed method outperforms methods commonly used in the literature without relying on pre-trained models or transfer learning.

📄 PDF Abstract BibTeX arXiv:1909.01954

Code (1)

bernardo-gatto/n-mode-GDS 공식 구현

Tasks

Action RecognitionGeneral ClassificationTransfer Learning

Similar Papers 제목 키워드 기반

Efficient Generalized Low-Rank Tensor Contextual Bandits

2023-11-03 · Qianxin Yi, Yiyang Yang, Shaojie Tang, Jiapeng Liu 외

In this paper, we aim to build a novel bandits algorithm that is capable of fully harnessing the power of multi-dimensional data and the inherent non-linearity of reward functions to provide high-usable and accountable d…

Decision MakingMulti-Armed Bandits

Subspace Clustering of Subspaces: Unifying Canonical Correlation Analysis and Subspace Clustering

2025-09-23 · Paris A. Karakasis, Nicholas D. Sidiropoulos arxiv

We introduce a novel framework for clustering a collection of tall matrices based on their column spaces, a problem we term Subspace Clustering of Subspaces (SCoS). Unlike traditional subspace clustering methods that ass…

Discriminant analysis based on projection onto generalized difference subspace

2019-10-29 · Kazuhiro Fukui, Naoya Sogi, Takumi Kobayashi, Jing-Hao Xue 외

This paper discusses a new type of discriminant analysis based on the orthogonal projection of data onto a generalized difference subspace (GDS). In our previous work, we have demonstrated that GDS projection works as th…

Higher-Order Partial Least Squares (HOPLS): A Generalized Multi-Linear Regression Method

2012-07-05 · Qibin Zhao, Cesar F. Caiafa, Danilo P. Mandic, Zenas C. Chao 외

A new generalized multilinear regression model, termed the Higher-Order Partial Least Squares (HOPLS), is introduced with the aim to predict a tensor (multiway array) $\tensor{Y}$ from a tensor $\tensor{X}$ through proje…

regression

Generalized Inverses of Matrix Products: From Fundamental Subspaces to Randomized Decompositions

2026-01-30 · Michał P. Karpowicz, Gilbert Strang arxiv

We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first princip…