Integer matrix approximation and data mining

DOI10.1007/s10915-017-0531-7zbMath1388.90092OpenAlexW2754084568MaRDI QIDQ1747623

Matthew M. Lin, Bo Dong, Haesun Park

Publication date: 26 April 2018

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-017-0531-7

zbMATH Keywords

clusteringdata miningassociation rulematrix factorizationinteger least squares problempattern extraction

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Matrices of integers (15B36)

Related Items (1)

An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization

Uses Software

• UCI-ml
• PROXIMUS

Cites Work

• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Using underapproximations for sparse nonnegative matrix factorization
• Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
• Discrete Eckart–Young Theorem for Integer Matrices
• Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
• Solving Ellipsoid-Constrained Integer Least Squares Problems
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
• Closest point search in lattices
• 10.1162/153244303322753616
• Elements of Information Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer matrix approximation and data mining