Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/103518
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, W. | - |
dc.contributor.author | Tan, M. | - |
dc.contributor.author | Sheng, Q. | - |
dc.contributor.author | Yao, L. | - |
dc.contributor.author | Shi, Q. | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Proceedings of the 25th ACM International Conference on Information and Knowledge Management (CIKM '16), 2016, vol.24-28-October-2016, pp.1743-1752 | - |
dc.identifier.isbn | 9781450340731 | - |
dc.identifier.uri | http://hdl.handle.net/2440/103518 | - |
dc.description.abstract | Orthogonal Non-negative Matrix Factorization (ONMF) ap- proximates a data matrix X by the product of two lower- dimensional factor matrices: X ≈ UVT, with one of them orthogonal. ONMF has been widely applied for clustering, but it often suffers from high computational cost due to the orthogonality constraint. In this paper, we propose a method, called Nonlinear Riemannian Conjugate Gradient ONMF (NRCG-ONMF), which updates U and V alterna- tively and preserves the orthogonality of U while achiev- ing fast convergence speed. Specifically, in order to update U, we develop a Nonlinear Riemannian Conjugate Gradi- ent (NRCG) method on the Stiefel manifold using Barzilai- Borwein (BB) step size. For updating V, we use a closed- form solution under non-negativity constraint. Extensive experiments on both synthetic and real-world data sets show consistent superiority of our method over other approaches in terms of orthogonality preservation, convergence speed and clustering performance. | - |
dc.description.statementofresponsibility | Wei Emma Zhang, Mingkui Tan, Quan Z. Sheng, Lina Yao, Qingfeng Shi | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery (ACM) | - |
dc.rights | © 2016 ACM | - |
dc.source.uri | http://dx.doi.org/10.1145/2983323.2983761 | - |
dc.subject | Orthogonal NMF; Stiefel Manifold; Clustering | - |
dc.title | Efficient orthogonal non-negative matrix factorization over stiefel manifold | - |
dc.type | Conference paper | - |
dc.contributor.conference | ACM International Conference on Information and Knowledge Management (CIKM '16) (24 Oct 2016 - 28 Oct 2016 : Indianapolis, IN, USA) | - |
dc.identifier.doi | 10.1145/2983323.2983761 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/DP140102270 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/DP160100703 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/DP140100104 | - |
dc.relation.grant | http://purl.org/au-research/grants/arc/FT140101247 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Zhang, W. [0000-0002-0406-5974] | - |
dc.identifier.orcid | Shi, Q. [0000-0002-9126-2107] | - |
Appears in Collections: | Aurora harvest 7 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.