Abstract
Decomposition into Simple Components (DESICOM) is a constrained matrix factorization method to decompose asymmetric square data matrices and represent them as combinations of very sparse basis matrices as well as dense asymmetric affinity matrices. When cast as a least squares problem, the process of finding the factor matrices needs special attention as solving for the basis matrices with fixed affinities is a combinatorial optimization problem usually requiring iterative updates that tend to result in locally optimal solutions. Aiming at computing globally optimal basis matrices, in this work we show how we can cast the problem of finding optimal basis matrices for DESICOM as a metaheuristic search and present an algorithm to factorize asymmetric data matrices. We empirically evaluate our algorithm on synthetic datasets and show that it can not only find interpretable factors but also, compared to the existing approach, can better represent the data and escape locally optimal solutions.
Supported by the Competence Center for Machine Learning Rhine Ruhr (ML2R) which is funded by the Federal Ministry of Education and Research of Germany (grant no. 01|S18038B).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bader, B.W., Kolda, T.G., Harshman, R.A.: Temporal analysis of social networks using three-way dedicom. Technical report, Sandia National Lab. (SNL-NM), Albuquerque, NM, US (2006)
Bauckhage, C., Sifa, R., Wrobel, S.: Quantum computing for max-sum diversification. In: SIAM International Conference on Data Mining (2020)
Fogel, D.B., Fogel, L.J., Porto, V.: Evolving neural networks. Biol. Cybern. 63(6), 487–493 (1990)
Harshman, R.: Models for analysis of asymmetrical relationships among N objects or stimuli. In: Proceeding of the Joint Meeting of the Psychometric Society and the Society for Mathematical Psychology (1978)
Kiers, H.: DESICOM: decomposition of asymmetric relationships data into simple components. Behaviormetrika 24(2), 203–217 (1997)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Sifa, R.: Matrix and Tensor Factorization for Profiling Player Behavior. LeanPub (2019)
Sifa, R., Ojeda, C., Bauckhage, C.: User Churn Migration Analysis with DEDICOM. In: Proceedings ACM RecSys (2015)
Sifa, R., Bauckhage, C.: k-Maxoids Via Adiabatic Quantum Computing. Research gate technical report (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sifa, R. (2020). DESICOM as Metaheuristic Search. In: Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2020. Lecture Notes in Computer Science(), vol 12096. Springer, Cham. https://doi.org/10.1007/978-3-030-53552-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-53552-0_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-53551-3
Online ISBN: 978-3-030-53552-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)