hrcak mascot   Srce   HID

Stručni rad

Spectral partitioning of graph

Ivančica Mirošević   ORCID icon orcid.org/0000-0002-6356-1943 ; ∗Fakultet elektrotehnike, strojarstva i brodogradnje, Sveučilište u Splitu

Puni tekst: hrvatski, pdf (538 KB) str. 71-87 preuzimanja: 275* citiraj
APA 6th Edition
Mirošević, I. (2017). Spektralno particioniranje grafa. Osječki matematički list, 17 (1), 71-87. Preuzeto s https://hrcak.srce.hr/186510
MLA 8th Edition
Mirošević, Ivančica. "Spektralno particioniranje grafa." Osječki matematički list, vol. 17, br. 1, 2017, str. 71-87. https://hrcak.srce.hr/186510. Citirano 06.05.2021.
Chicago 17th Edition
Mirošević, Ivančica. "Spektralno particioniranje grafa." Osječki matematički list 17, br. 1 (2017): 71-87. https://hrcak.srce.hr/186510
Harvard
Mirošević, I. (2017). 'Spektralno particioniranje grafa', Osječki matematički list, 17(1), str. 71-87. Preuzeto s: https://hrcak.srce.hr/186510 (Datum pristupa: 06.05.2021.)
Vancouver
Mirošević I. Spektralno particioniranje grafa. Osječki matematički list [Internet]. 2017 [pristupljeno 06.05.2021.];17(1):71-87. Dostupno na: https://hrcak.srce.hr/186510
IEEE
I. Mirošević, "Spektralno particioniranje grafa", Osječki matematički list, vol.17, br. 1, str. 71-87, 2017. [Online]. Dostupno na: https://hrcak.srce.hr/186510. [Citirano: 06.05.2021.]

Sažetak
In this paper, the clustering problem is formulated as a graph bipartitioning
problem which is a discrete optimization problem, and
the relaxed version of it leads to the eigenvectors of the corresponding
Laplacian matrix. Two versions of the cost functions are defined, ratio
cut and normalized cut, and it is shown that they are minimized by
the Fiedler vector of the Laplacian and the normalized Laplacian of
the graph.

Ključne riječi
Spectral clustering; graph partitioning; ratio cut; normalized cut

Hrčak ID: 186510

URI
https://hrcak.srce.hr/186510

[hrvatski]

Posjeta: 490 *