<?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>A variational autoencoder for n-ary trees</dc:title><dc:creator>Perčinić,	Martin	(Avtor)
	</dc:creator><dc:creator>Todorovski,	Ljupčo	(Mentor)
	</dc:creator><dc:creator>Mežnar,	Sebastian	(Komentor)
	</dc:creator><dc:subject>neural networks</dc:subject><dc:subject>variational autoencoders</dc:subject><dc:subject>generative models</dc:subject><dc:subject>n-ary
trees</dc:subject><dc:subject>machine learning</dc:subject><dc:subject>deep learning</dc:subject><dc:description>The growth of generative AI and deep learning has caused an increase in the number of deep generative models that generate data of various types. Variational autoencoders (VAEs) are deep generative models, which, apart from generating data, also embed input data into a vector latent space. The hierarchical variational autoencoder (HVAE) is an autoencoder that is used for hierarchical data and can encode and decode binary trees. In this thesis, we introduce its upgrade, the hierarchical variational autoencoder nHVAE, which can encode and decode trees of arbitrary degrees. This upgrade increases the autoencoder's applicability, extending it to various fields where the data is represented with n-ary trees. The nHVAE model implements two gated recurrent units (GRUs) with the ability to encode and decode individual tree nodes of arbitrary degree. Results of the experimental comparison of nHVAE with HVAE show that the two autoencoders have similar performance. They also show that nHVAE can efficiently generate high-degree trees and is more efficient than HVAE when trained on small data sets.</dc:description><dc:date>2024</dc:date><dc:date>2024-11-08 08:15:03</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>164705</dc:identifier><dc:identifier>UDK: 004.42</dc:identifier><dc:identifier>VisID: 149618</dc:identifier><dc:identifier>COBISS_ID: 213840131</dc:identifier><dc:language>sl</dc:language></metadata>
