File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/tsp.2018.2865407
- Scopus: eid_2-s2.0-85051774729
- WOS: WOS:000446159800003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Scaling Probabilistic Tensor Canonical Polyadic Decomposition to Massive Data
Title | Scaling Probabilistic Tensor Canonical Polyadic Decomposition to Massive Data |
---|---|
Authors | |
Keywords | automatic rank determination Large-scale tensor decomposition scalable algorithm variational inference |
Issue Date | 2018 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78 |
Citation | IEEE Transactions on Signal Processing, 2018, v. 66 n. 21, p. 5534-5548 How to Cite? |
Abstract | ensor canonical polyadic decomposition (CPD) has recently emerged as a promising mathematical tool in multidimensional data analytics. Traditionally, the alternating least-squares method is the workhorse for tensor CPD, but it requires knowing the tensor rank. A probabilistic approach overcomes this challenge by incorporating the tensor rank determination as an integral part of the CPD process. However, the current probabilistic tensor CPD method is derived for batch-mode operation, meaning that it needs to process the whole dataset at the same time. Obviously, this is no longer suitable for large datasets. To enable tensor CPD in a massive data paradigm, in this paper, the idea of stochastic optimization is introduced into the probabilistic tensor CPD, rendering a scalable algorithm that only processes mini-batch data at a time. Numerical studies on synthetic data and real-world applications are presented to demonstrate that the proposed scalable tensor CPD algorithm performs almost identically to the corresponding batch-mode algorithm while saving a significant amount of computation time. |
Persistent Identifier | http://hdl.handle.net/10722/273880 |
ISSN | 2021 Impact Factor: 4.875 2020 SCImago Journal Rankings: 1.638 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheng, L | - |
dc.contributor.author | Wu, YC | - |
dc.contributor.author | Poor, HV | - |
dc.date.accessioned | 2019-08-18T14:50:30Z | - |
dc.date.available | 2019-08-18T14:50:30Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | IEEE Transactions on Signal Processing, 2018, v. 66 n. 21, p. 5534-5548 | - |
dc.identifier.issn | 1053-587X | - |
dc.identifier.uri | http://hdl.handle.net/10722/273880 | - |
dc.description.abstract | ensor canonical polyadic decomposition (CPD) has recently emerged as a promising mathematical tool in multidimensional data analytics. Traditionally, the alternating least-squares method is the workhorse for tensor CPD, but it requires knowing the tensor rank. A probabilistic approach overcomes this challenge by incorporating the tensor rank determination as an integral part of the CPD process. However, the current probabilistic tensor CPD method is derived for batch-mode operation, meaning that it needs to process the whole dataset at the same time. Obviously, this is no longer suitable for large datasets. To enable tensor CPD in a massive data paradigm, in this paper, the idea of stochastic optimization is introduced into the probabilistic tensor CPD, rendering a scalable algorithm that only processes mini-batch data at a time. Numerical studies on synthetic data and real-world applications are presented to demonstrate that the proposed scalable tensor CPD algorithm performs almost identically to the corresponding batch-mode algorithm while saving a significant amount of computation time. | - |
dc.language | eng | - |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=78 | - |
dc.relation.ispartof | IEEE Transactions on Signal Processing | - |
dc.rights | IEEE Transactions on Signal Processing. Copyright © IEEE. | - |
dc.rights | ©20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | automatic rank determination | - |
dc.subject | Large-scale tensor decomposition | - |
dc.subject | scalable algorithm | - |
dc.subject | variational inference | - |
dc.title | Scaling Probabilistic Tensor Canonical Polyadic Decomposition to Massive Data | - |
dc.type | Article | - |
dc.identifier.email | Wu, YC: ycwu@eee.hku.hk | - |
dc.identifier.authority | Wu, YC=rp00195 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/tsp.2018.2865407 | - |
dc.identifier.scopus | eid_2-s2.0-85051774729 | - |
dc.identifier.hkuros | 302296 | - |
dc.identifier.volume | 66 | - |
dc.identifier.issue | 21 | - |
dc.identifier.spage | 5534 | - |
dc.identifier.epage | 5548 | - |
dc.identifier.isi | WOS:000446159800003 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1053-587X | - |