Kriteriji kompleksnosti za k-means algoritam

Šeperić, Stela

prikaz prve stranice dokumenta Kriteriji kompleksnosti za k-means algoritam

Download
PDF 1.28 MB

master's thesis

98 415

Kriteriji kompleksnosti za k-means algoritam

Zagreb: University of Zagreb, Faculty of Science, 2014. urn:nbn:hr:217:213762

Šeperić, Stela

University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

APA 6th Edition

Šeperić, S. (2014). Kriteriji kompleksnosti za k-means algoritam (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:213762

MLA 8th Edition

Šeperić, Stela. "Kriteriji kompleksnosti za k-means algoritam." Master's thesis, University of Zagreb, Faculty of Science, 2014. https://urn.nsk.hr/urn:nbn:hr:217:213762

Chicago 17th Edition

Šeperić, Stela. "Kriteriji kompleksnosti za k-means algoritam." Master's thesis, University of Zagreb, Faculty of Science, 2014. https://urn.nsk.hr/urn:nbn:hr:217:213762

Harvard

Šeperić, S. (2014). 'Kriteriji kompleksnosti za k-means algoritam', Master's thesis, University of Zagreb, Faculty of Science, accessed 05 April 2025, https://urn.nsk.hr/urn:nbn:hr:217:213762

Vancouver

Šeperić S. Kriteriji kompleksnosti za k-means algoritam [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2014 [cited 2025 April 05] Available at: https://urn.nsk.hr/urn:nbn:hr:217:213762

IEEE

S. Šeperić, "Kriteriji kompleksnosti za k-means algoritam", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2014. Available at: https://urn.nsk.hr/urn:nbn:hr:217:213762

Cite this item: https://urn.nsk.hr/urn:nbn:hr:217:213762

Metadata

Title	Kriteriji kompleksnosti za k-means algoritam
Author	Stela Šeperić
Mentor	Pavle Goldstein (mentor)
Committee member	Pavle Goldstein (predsjednik povjerenstva)
Committee member	Juraj Šiftar (član povjerenstva)
Committee member	Miljenko Marušić (član povjerenstva)
Committee member	Ivica Nakić (član povjerenstva)
Granter	University of Zagreb Faculty of Science (Department of Mathematics) Zagreb
Defense date and country	2014-07-11, Croatia
Scientific / art field, discipline and subdiscipline	NATURAL SCIENCES Mathematics
Abstract	U ovom radu obrađena je metoda za određivanje $k$ u k-means algoritmu, što je vrlo česti problem u klasteriranju podataka. Pokazano je da funkcija cilja u k-means algoritmu konvergira. Nadalje, u potpoglavlju (1.3) pokazano je da su koordinate težišta skupa jednake aritmetičkim sredinama odgovarajućih koordinata elemenata tog skupa, te se u slučaju standardnog k-means algoritma novi centri određuju na takav način. U lemama smo dokazali da ako su podaci ekvidistantni, odnosno uniformno... More
Abstract (english)	In this thesis, we have studied method for determining $k$ in k-means algorithm, which is a well known problem. It is shown that the objective function coverges. Furthermore, a couple of lemmas proved that, if data follow a uniform distribution, then the objective function behaves as $C\cdot\frac{1}{k^2}$ . Assumption about data is not as strong as assumption in G-means algorithm which requires normal distribution of data. We have shown that with relatively limited assumptions, we... More
Keywords
Keywords (english)
Language	croatian
URN:NBN	urn:nbn:hr:217:213762
Study programme	Title: Mathematical Statistics Study programme type: university Study level: graduate Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resource	Text
File origin	Born digital
Access conditions	Open access
Terms of use
Created on	2019-02-13 10:17:45

Search form

closeAccessibilityrefresh

Accessibility