Incremental clustering via nonnegative matrix factorization

Serhat Selcuk Bucak, Bilge Gunsel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)


Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF̀s batch nature necessitates recomputation of whole basis set for new samples. Although NMF is a powerful content representation tool, this limits the use of NMF in online processing of large data sets. Another problem with NMF, like other partitional methods, is determining the actual number of clusters. Deciding the rank of the factorization is also critical since it has a significant effect on clustering performance. This paper introduces an NMF based incremental clustering algorithm which allows increasing number of clusters adaptively thus eliminates optimal rank selection problem. Test results obtained on large video data sets demonstrate that the proposed clustering scheme is capable of labeling linearly separable data as well as non-separable samples with a small false positive ratio.

Original languageEnglish
Title of host publication2008 19th International Conference on Pattern Recognition, ICPR 2008
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781424421756
Publication statusPublished - 2008

Publication series

NameProceedings - International Conference on Pattern Recognition
ISSN (Print)1051-4651


Dive into the research topics of 'Incremental clustering via nonnegative matrix factorization'. Together they form a unique fingerprint.

Cite this