Show simple item record

dc.contributor.authorGonzalez, Edward F.
Zhang, Yin
dc.date.accessioned 2018-06-18T17:56:57Z
dc.date.available 2018-06-18T17:56:57Z
dc.date.issued 2005-03
dc.identifier.citation Gonzalez, Edward F. and Zhang, Yin. "Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization." (2005) https://hdl.handle.net/1911/102034.
dc.identifier.urihttps://hdl.handle.net/1911/102034
dc.description.abstract Approximate nonnegative matrix factorization is an emerging technique with a wide spectrum of potential applications in data analysis. Currently, the most-used algorithms for this problem are those proposed by Lee and Seung. In this paper we present a variation of one of the Lee-Seung algorithms with a notably improved performance. We also show that algorithms of this type do not necessarily converge to local minima.
dc.format.extent 13 pp
dc.title Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization
dc.type Technical report
dc.date.note March 2005
dc.identifier.digital TR05-02
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record