Optimizing conflicting objectives in NMF using Pareto simulated annealing

Files in This Item:
File Description SizeFormat 
aics10-nmf-open.pdf318.65 kBAdobe PDFDownload
Title: Optimizing conflicting objectives in NMF using Pareto simulated annealing
Authors: Foley, Kevin
Greene, Derek
Cunningham, Pádraig
Permanent link: http://hdl.handle.net/10197/2733
Date: 30-Aug-2010
Abstract: Non-Negative matrix factorization (NMF) has emerged as an important technique for simplifying high-dimension data into interpretable factors. NMF has the attractive characteristic that the factor matrices are naturally sparse, thus allowing them to be readily interpreted. However, there is a tension between the accuracy of the factorization and the sparseness – it is the management of the trade-off between these two criteria that is the subject of this paper. We introduce a multi-criteria Simulated annealing framework that produces a Pareto set of solutions, which are non-dominated on both criteria. We show that solutions at one end of the Pareto front of solutions correspond to NMF factorizations produced with conventional optimization techniques, while solutions at the other end exhibit enhanced sparseness. Clustering is no longer to be observed either in the raw-data form of the matrix, or the generated heat-map form.
Funding Details: Science Foundation Ireland
Type of material: Conference Publication
Keywords: Machine learningClustering analysis
Subject LCSH: Machine learning
Cluster analysis
Non-negative matrices
Simulated annealing (Mathematics)
Language: en
Status of Item: Peer reviewed
Conference Details: Paper presented at the 21st National Conference on Artificial Intelligence and Cognitive Science (AICS 2010), Galway, Ireland, 30 August - 1 September, 2010
Appears in Collections:Computer Science Research Collection
Clique Research Collection
CASL Research Collection

Show full item record

Google ScholarTM


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.