<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Matrix tri-factorization over the tropical semiring</dc:title><dc:creator>Omanović,	Amra	(Avtor)
	</dc:creator><dc:creator>Oblak,	Polona	(Avtor)
	</dc:creator><dc:creator>Curk,	Tomaž	(Avtor)
	</dc:creator><dc:subject>tropical semiring</dc:subject><dc:subject>tri-factorization</dc:subject><dc:subject>network structure analysis</dc:subject><dc:subject>four-partition network</dc:subject><dc:description>Tropical semiring has proven successful in several research areas, including optimal control,
bioinformatics, discrete event systems, and decision problems. Previous studies have applied a matrix
two-factorization algorithm based on the tropical semiring to investigate bipartite and tripartite networks.
Tri-factorization algorithms based on standard linear algebra are used to solve tasks such as data fusion, co-clustering, matrix completion, community detection, and more. However, there is currently no tropical matrix tri-factorization approach that would allow for the analysis of multipartite networks with many parts. To address this, we propose the triFastSTMF algorithm, which performs tri-factorization over the tropical semiring. We applied it to analyze a four-partition network structure and recover the edge lengths of the network. We show that triFastSTMF performs similarly to Fast-NMTF in terms of approximation and prediction performance when fitted on the whole network. When trained on a specific subnetwork and used to predict the entire network, triFastSTMF outperforms Fast-NMTF by several orders of magnitude smaller error. The robustness of triFastSTMF is due to tropical operations, which are less prone to predict large values compared to standard operations.</dc:description><dc:date>2023</dc:date><dc:date>2023-08-24 09:53:57</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>148483</dc:identifier><dc:identifier>UDK: 004:51</dc:identifier><dc:identifier>ISSN pri članku: 2169-3536</dc:identifier><dc:identifier>DOI: 10.1109/ACCESS.2023.3287833</dc:identifier><dc:identifier>COBISS_ID: 162079235</dc:identifier><dc:language>sl</dc:language></metadata>
