PARAFAC-based multilinear subspace clustering for tensor data

Panagiotis A. Traganitis, Georgios B Giannakis

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

2 Scopus citations

Abstract

Subspace clustering has become an increasingly popular data analysis and machine learning method, whose main assumption is that data are generated from a union of linear subspaces modeling. While successful in many applications these methods do not take into account the multilinear structure of data such as images and video. Prompted by this observation, the present work introduces a multilinear subspace clustering scheme that exploits the structure of the data, and its performance is evaluated on synthetic and real datasets against state-of-the-art subspace clustering algorithms.

Original languageEnglish (US)
Title of host publication2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1280-1284
Number of pages5
ISBN (Electronic)9781509045457
DOIs
StatePublished - Apr 19 2017
Event2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Washington, United States
Duration: Dec 7 2016Dec 9 2016

Publication series

Name2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings

Other

Other2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016
Country/TerritoryUnited States
CityWashington
Period12/7/1612/9/16

Bibliographical note

Funding Information:
1Work supported by NSF grants 1500713, 1514056; ARO W911NF-15-1- 0492; and NIH 1R01GM104975-01.

Publisher Copyright:
© 2016 IEEE.

Keywords

  • Canonical Polyadic Decomposition
  • PARAFAC
  • Subspace clustering
  • Tensor

Fingerprint

Dive into the research topics of 'PARAFAC-based multilinear subspace clustering for tensor data'. Together they form a unique fingerprint.

Cite this