20.500.12556/RUL-141007 Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the classical non-negative matrix tri-factorization problem and includes a non-convex objective function which is a multivariate sixth degree polynomial and a has convex feasibility set. It has a special importance in data science, since it serves as a mathematical model for the fusion of different data sources in data clustering. We develop four methods to solve the SNMTF. They are based on four theoretical approaches known from the literature: the fixed point method (FPM), the block-coordinate descent with projected gradient (BCD), the gradient method with exact line search (GMELS) and the adaptive moment estimation method (ADAM). For each of these methods we offer a software implementation: for the former two methods we use Matlab and for the latter Python with the TensorFlow library. We test these methods on three data-sets: the synthetic data-set we generated, while the others represent real-life similarities between different objects. Extensive numerical results show that with sufficient computing time all four methods perform satisfactorily and ADAM most often yields the best mean square error (MSE). However, if the computation time is limited, FPM gives the best MSE because it shows the fastest convergence at the beginning. All data-sets and codes are publicly available on our GitLab profile. non-negative matrix factorization fixed point method block coordinate descent projected gradient method adaptive moment estimation method negativna matrična faktorizacija metoda negibne točke bločno koordinatni spust metoda projiciranega gradienta ADAM true false true Angleški jezik Slovenski jezik Članek v reviji 2022-09-22 08:01:12 2022-09-22 08:01:16 2023-03-22 03:30:22 0000-00-00 00:00:00 2022 0 0 30 str. Vol. 82 2022 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 512.622.462 0925-5001 10.1007/s10898-021-01074-3 75116803 Hribar_..._-_Four_algorithms_to_solve_symmetric_multi-type_....pdf Hribar_..._-_Four_algorithms_to_solve_symmetric_multi-type_....pdf 1 6BC60F8BEEC515226A5CAB3DC6342A41 4a16137fa38739aaaf4c66c17f762c13bd60fa94a7c6bc6a592d546aab7caeb8 12938480-3a3e-11ed-92af-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=161904 https://link.springer.com/article/10.1007%2Fs10898-021-01074-3 1 e3cf965a-3a3b-11ed-92af-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=161880 Fakulteta za strojništvo 0 0 0