Neurally plausible, non-combinatorial iterative independent process analysis

András Lorincz, Zoltán Szabó

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

It has been shown recently that the identification of mixed hidden independent auto-regressive processes (independent process analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to independent subspace analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to independent component analysis. Here, we introduce an iterative scheme and its neural network representation that takes advantage of the reduction method and can accomplish the IPA task. Computer simulation illustrates the working of the algorithm.

Original languageEnglish
Pages (from-to)1569-1573
Number of pages5
JournalNeurocomputing
Volume70
Issue number7-9
DOIs
Publication statusPublished - Mar 2007

Fingerprint

Explosions
Independent component analysis
Computer Simulation
Neural networks
Decomposition
Computer simulation

Keywords

  • Independent process analysis
  • Neural network implementation

ASJC Scopus subject areas

  • Artificial Intelligence
  • Cellular and Molecular Neuroscience

Cite this

Neurally plausible, non-combinatorial iterative independent process analysis. / Lorincz, András; Szabó, Zoltán.

In: Neurocomputing, Vol. 70, No. 7-9, 03.2007, p. 1569-1573.

Research output: Contribution to journalArticle

@article{e90c3961321a4177923dcf167f8179d0,
title = "Neurally plausible, non-combinatorial iterative independent process analysis",
abstract = "It has been shown recently that the identification of mixed hidden independent auto-regressive processes (independent process analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to independent subspace analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to independent component analysis. Here, we introduce an iterative scheme and its neural network representation that takes advantage of the reduction method and can accomplish the IPA task. Computer simulation illustrates the working of the algorithm.",
keywords = "Independent process analysis, Neural network implementation",
author = "Andr{\'a}s Lorincz and Zolt{\'a}n Szab{\'o}",
year = "2007",
month = "3",
doi = "10.1016/j.neucom.2006.10.145",
language = "English",
volume = "70",
pages = "1569--1573",
journal = "Neurocomputing",
issn = "0925-2312",
publisher = "Elsevier",
number = "7-9",

}

TY - JOUR

T1 - Neurally plausible, non-combinatorial iterative independent process analysis

AU - Lorincz, András

AU - Szabó, Zoltán

PY - 2007/3

Y1 - 2007/3

N2 - It has been shown recently that the identification of mixed hidden independent auto-regressive processes (independent process analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to independent subspace analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to independent component analysis. Here, we introduce an iterative scheme and its neural network representation that takes advantage of the reduction method and can accomplish the IPA task. Computer simulation illustrates the working of the algorithm.

AB - It has been shown recently that the identification of mixed hidden independent auto-regressive processes (independent process analysis, IPA), under certain conditions, can be free from combinatorial explosion. The key is that IPA can be reduced (i) to independent subspace analysis and then, via a novel decomposition technique called Separation Theorem, (ii) to independent component analysis. Here, we introduce an iterative scheme and its neural network representation that takes advantage of the reduction method and can accomplish the IPA task. Computer simulation illustrates the working of the algorithm.

KW - Independent process analysis

KW - Neural network implementation

UR - http://www.scopus.com/inward/record.url?scp=33847395390&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847395390&partnerID=8YFLogxK

U2 - 10.1016/j.neucom.2006.10.145

DO - 10.1016/j.neucom.2006.10.145

M3 - Article

AN - SCOPUS:33847395390

VL - 70

SP - 1569

EP - 1573

JO - Neurocomputing

JF - Neurocomputing

SN - 0925-2312

IS - 7-9

ER -