NDLI: Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery

Content Provider	IEEE Xplore Digital Library
Author	Jingu Kim Ramakrishnan, N. Marwah, M. Shah, A. Haesun Park
Copyright Year	2013
Abstract	The nonnegative least squares problems are useful in applications where the physical nature of problem domain permits only additive linear combinations. We discuss the $l_{1}-regularized$ nonnegative least squares (L1-NLS) problem, where l1-regularization is used to induce sparsity. Although $l_{1}-regularization$ has been successfully used in least squares regression, when combined with nonnegativity constraints, developments of algorithms and their understandings have been limited. We propose an algorithm that generates the entire regularization paths of the L1-NLS problem. We prove the correctness of the proposed algorithm and illustrate a novel application in environmental sustainability. The application relates to life cycle assessment (LCA), a technique used to estimate environmental impact during the entire lifetime of a product. We address an inverse problem in LCA. Given environmental impact factors of a target product and of a large library of constituents, the goal is to reverse engineer an inventory tree for the product. Using real-world data sets, we demonstrate how our L1-NLS approach controls the size of discovered trees, and how the full regularization paths effectively illustrate the spectrum of discovered trees with varying sparsity and compositions.
Sponsorship	Toshiba
Starting Page	360
Ending Page	369
File Size	595274
Page Count	10
File Format	PDF
ISBN	9780769551081
ISSN	15504786
DOI	10.1109/ICDM.2013.125
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-07
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vegetation Indexes Libraries Electronic publishing Books Materials full regularization path nonnegative least squares life cycle assessment l1-regularization
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery

Sparse kernel recursive least squares using l1 regularization and a fixed-point sub-iteration.

A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications

Exact Sparse Nonnegative Least Squares

Exact Biobjective k-Sparse Nonnegative Least Squares

On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems

Nonnegative matrix and tensor factorizations, least squares problems, and applications

Robust nonnegative matrix factorization via L1 norm regularization by multiplicative updating rules

A fast Iterative Shrinkage-Thresholding Algorithm with application to wavelet-based image deblurring

Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery

Similar Documents

Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery

Sparse kernel recursive least squares using l1 regularization and a fixed-point sub-iteration.

A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications

Exact Sparse Nonnegative Least Squares

Exact Biobjective k-Sparse Nonnegative Least Squares

On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems

Nonnegative matrix and tensor factorizations, least squares problems, and applications

Robust nonnegative matrix factorization via L1 norm regularization by multiplicative updating rules

A fast Iterative Shrinkage-Thresholding Algorithm with application to wavelet-based image deblurring

Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery