Using Non-negative Matrix Factorization for Bankruptcy Analysis

Detalhes bibliográficos
Autor(a) principal: Chen, Ning
Data de Publicação: 2011
Outros Autores: Ribeiro, Bernardete, Chen, An
Tipo de documento: Artigo
Idioma: eng
Título da fonte: INFOCOMP: Jornal de Ciência da Computação
Texto Completo: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342
Resumo: Dimensionality reduction is demonstrated crucial to improve the predictive capability of models by means of linear or nonlinear projections. Non-negative matrix factorization (NMF) is a popular multivariate analysis technique for part-based data representation. It attempts to find an approximation of a high dimensional matrix as the product of two low dimensional matrices under the non-negative constraint. Recently a graph regularized non-negative matrix factorization (GNMF) provides a formal way to incorporate the geometrical structure into the NMF decomposition, particularly applicable to the data embedded in submanifolds of the Euclidean space. In this paper, the usage of GNMF in financial analysis is discussed from the perspectives of unsupervised clustering and supervised classification. Experimental results on a French bankruptcy data set show the potential of GNMF on data representation.
id UFLA-5_b72045cb9ecbf7605cf72a832d7dd49d
oai_identifier_str oai:infocomp.dcc.ufla.br:article/342
network_acronym_str UFLA-5
network_name_str INFOCOMP: Jornal de Ciência da Computação
repository_id_str
spelling Using Non-negative Matrix Factorization for Bankruptcy Analysisbankruptcy analysisclusteringclassificationnon-negative matrix factorizationmanifold.Dimensionality reduction is demonstrated crucial to improve the predictive capability of models by means of linear or nonlinear projections. Non-negative matrix factorization (NMF) is a popular multivariate analysis technique for part-based data representation. It attempts to find an approximation of a high dimensional matrix as the product of two low dimensional matrices under the non-negative constraint. Recently a graph regularized non-negative matrix factorization (GNMF) provides a formal way to incorporate the geometrical structure into the NMF decomposition, particularly applicable to the data embedded in submanifolds of the Euclidean space. In this paper, the usage of GNMF in financial analysis is discussed from the perspectives of unsupervised clustering and supervised classification. Experimental results on a French bankruptcy data set show the potential of GNMF on data representation.Editora da UFLA2011-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342INFOCOMP Journal of Computer Science; Vol. 10 No. 4 (2011): December, 2011; 57-641982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342/326Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessChen, NingRibeiro, BernardeteChen, An2015-07-29T12:25:09Zoai:infocomp.dcc.ufla.br:article/342Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:32.995568INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true
dc.title.none.fl_str_mv Using Non-negative Matrix Factorization for Bankruptcy Analysis
title Using Non-negative Matrix Factorization for Bankruptcy Analysis
spellingShingle Using Non-negative Matrix Factorization for Bankruptcy Analysis
Chen, Ning
bankruptcy analysis
clustering
classification
non-negative matrix factorization
manifold.
title_short Using Non-negative Matrix Factorization for Bankruptcy Analysis
title_full Using Non-negative Matrix Factorization for Bankruptcy Analysis
title_fullStr Using Non-negative Matrix Factorization for Bankruptcy Analysis
title_full_unstemmed Using Non-negative Matrix Factorization for Bankruptcy Analysis
title_sort Using Non-negative Matrix Factorization for Bankruptcy Analysis
author Chen, Ning
author_facet Chen, Ning
Ribeiro, Bernardete
Chen, An
author_role author
author2 Ribeiro, Bernardete
Chen, An
author2_role author
author
dc.contributor.author.fl_str_mv Chen, Ning
Ribeiro, Bernardete
Chen, An
dc.subject.por.fl_str_mv bankruptcy analysis
clustering
classification
non-negative matrix factorization
manifold.
topic bankruptcy analysis
clustering
classification
non-negative matrix factorization
manifold.
description Dimensionality reduction is demonstrated crucial to improve the predictive capability of models by means of linear or nonlinear projections. Non-negative matrix factorization (NMF) is a popular multivariate analysis technique for part-based data representation. It attempts to find an approximation of a high dimensional matrix as the product of two low dimensional matrices under the non-negative constraint. Recently a graph regularized non-negative matrix factorization (GNMF) provides a formal way to incorporate the geometrical structure into the NMF decomposition, particularly applicable to the data embedded in submanifolds of the Euclidean space. In this paper, the usage of GNMF in financial analysis is discussed from the perspectives of unsupervised clustering and supervised classification. Experimental results on a French bankruptcy data set show the potential of GNMF on data representation.
publishDate 2011
dc.date.none.fl_str_mv 2011-12-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342
url https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/342/326
dc.rights.driver.fl_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2016 INFOCOMP Journal of Computer Science
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Editora da UFLA
publisher.none.fl_str_mv Editora da UFLA
dc.source.none.fl_str_mv INFOCOMP Journal of Computer Science; Vol. 10 No. 4 (2011): December, 2011; 57-64
1982-3363
1807-4545
reponame:INFOCOMP: Jornal de Ciência da Computação
instname:Universidade Federal de Lavras (UFLA)
instacron:UFLA
instname_str Universidade Federal de Lavras (UFLA)
instacron_str UFLA
institution UFLA
reponame_str INFOCOMP: Jornal de Ciência da Computação
collection INFOCOMP: Jornal de Ciência da Computação
repository.name.fl_str_mv INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)
repository.mail.fl_str_mv infocomp@dcc.ufla.br||apfreire@dcc.ufla.br
_version_ 1799874741386870784