Pattern Decomposition with Complex Combinatorial Constraints: Application to Materials Discovery
Preprint
Abstract
Identifying important components or factors in large amounts of noisy data is a key problem in machine learning and data mining. Motivated by a pattern decomposition problem in materials discovery, aimed at discovering new materials for renewable energy, e.g. for fuel and solar cells, we introduce CombiFD, a framework for factor based pattern decomposition that allows the incorporation of a-priori knowledge as constraints, including complex combinatorial constraints. In addition, we propose a new pattern decomposition algorithm, called AMIQO, based on solving a sequence of (mixed-integer) quadratic programs. Our approach considerably outperforms the state of the art on the materials discovery problem, scaling to larger datasets and recovering more precise and physically meaningful decompositions. We also show the effectiveness of our approach for enforcing background knowledge on other application domains.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Symmetric Nonnegative Matrix Factorization for Graph Clustering2012
- Constraint Reasoning and Kernel Clustering for Pattern Decomposition with ScalingLecture Notes in Computer Science, 2011
- On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic IndexingComputational Statistics & Data Analysis, 2008
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set MethodSIAM Journal on Matrix Analysis and Applications, 2008
- Combinatorial Synthesis and Evaluation of Functional Inorganic Materials Using Thin-Film TechniquesMRS Bulletin, 2002
- Discovery of a useful thin-film dielectric using a composition-spread approachNature, 1998