An algebraic method for approximate rank one factorization of rank deficient matrices

Franz J. Király, Andreas Ziehe, Klaus Robert Müller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper we consider the problem of finding approximate common rank one factors for a set of matrices. Instead of jointly diagonalizing the matrices, we perform calculations directly in the problem intrinsic domain: we present an algorithm, AROFAC, which searches the approximate linear span of the matrices using an indicator function for the rank one factors, finding specific single sources. We evaluate the feasibility of this approach by discussing simulations on generated data and a neurophysiological dataset. Note however that our contribution is intended to be mainly conceptual in nature.

Original languageEnglish
Title of host publicationLatent Variable Analysis and Signal Separation - 10th International Conference, LVA/ICA 2012, Proceedings
Pages272-279
Number of pages8
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event10th International Conference on Latent Variable Analysis and Signal Separation, LVA/ICA 2012 - Tel Aviv, Israel
Duration: 2012 Mar 122012 Mar 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7191 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Latent Variable Analysis and Signal Separation, LVA/ICA 2012
Country/TerritoryIsrael
CityTel Aviv
Period12/3/1212/3/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'An algebraic method for approximate rank one factorization of rank deficient matrices'. Together they form a unique fingerprint.

Cite this