Discriminative Orthogonal Nonnegative matrix factorization with flexibility for data representation
- Publication Type:
- Journal Article
- Citation:
- Expert Systems with Applications, 2014, 41 (4 PART 1), pp. 1283 - 1293
- Issue Date:
- 2014-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Discriminative Orthogonal Nonnegative matrix factorization with.pdf | Published Version | 631.89 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Learning an informative data representation is of vital importance in multidisciplinary applications, e.g., face analysis, document clustering and collaborative filtering. As a very useful tool, Nonnegative matrix factorization (NMF) is often employed to learn a well-structured data representation. While the geometrical structure of the data has been studied in some previous NMF variants, the existing works typically neglect the discriminant information revealed by the between-class scatter and the total scatter of the data. To address this issue, we present a novel approach named Discriminative Orthogonal Nonnegative matrix factorization (DON), which preserves both the local manifold structure and the global discriminant information simultaneously through manifold discriminant learning. In particular, to learn the discriminant structure for the data representation, we introduce the scaled indicator matrix, which naturally satisfies the orthogonality condition. Thus, we impose the orthogonality constraints on the objective function. However, too heavy constraints will lead to a very sparse data representation that is unexpected in reality. So we further make this orthogonality flexible. In addition, we provide the optimization framework with the convergence proof of the updating rules. Extensive comparisons over several state-of-the-art approaches demonstrate the efficacy of the proposed method. © 2013 Elsevier Ltd. All rights reserved.
Please use this identifier to cite or link to this item: