
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:format>115, [10] listova</dc:format>
  <dc:format>3005214 bytes</dc:format>
  <dc:title xml:lang="srp">Algoritmi za brzo aproksimativno spektralno učenje</dc:title>
  <dc:language>srp</dc:language>
  <dc:date>2021</dc:date>
  <dc:contributor id="https://plus.cobiss.net/cobiss/sr/sr/conor/28413287">Todorović, Branimir, 1967-</dc:contributor>
  <dc:contributor>Ćirić, Miroslav</dc:contributor>
  <dc:contributor>Ognjanović, Zoran</dc:contributor>
  <dc:contributor>Janković, Dragan</dc:contributor>
  <dc:contributor>Petković, Marko</dc:contributor>
  <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/at/legalcode</dc:rights>
  <dc:description xml:lang="srp">This thesis presents learning algorithms which use theinformation stored in the spectrum (eigenvalues andeigenvectors) of a matrix derived from the input set. Matricesin question are graph matrices or kernel matrices. However, thealgorithms which use these matrices have either a quadratic orcubic time complexity and quadratic memory complexity.Therefore, in this thesis the algorithms will be presented thatapproximate those matrices and reduce the time and memorycomplexity to the linear one. Also, these algorithms will becompared with the other algorithms that solve this problem, andtheir empirical and theoretical analysis will be presented.</dc:description>
  <dc:description xml:lang="srp">Biobibliografija: list. 114-115;Bibliografija: list. 108-113.  Datum odbrane:  Artificial Intelligence; Machine Learning</dc:description>
  <dc:type>info:eu-repo/semantics/bachelorThesis</dc:type>
  <dc:creator id="https://plus.cobiss.net/cobiss/sr/sr/conor/79656969">Trokicić, Aleksandar B., 1989-</dc:creator>
  <dc:identifier>https://phaidrani.ni.ac.rs/o:1790</dc:identifier>
  <dc:identifier>cobiss:56370441</dc:identifier>
  <dc:identifier>thesis:8522</dc:identifier>
</oai_dc:dc>
