hrcak mascot   Srce   HID

Croatian Operational Research Review, Vol.5 No.1 Ožujak 2014.

Izvorni znanstveni članak

Data clustering for circle detection

Tomislav Marošević ; Josip Juraj Strossmayer University of Osijek, Osijek, Croatia

Puni tekst: engleski, pdf (586 KB) str. 15-24 preuzimanja: 630* citiraj
APA
Marošević, T. (2014). Data clustering for circle detection. Croatian Operational Research Review, 5(1), 15-24. Preuzeto s https://hrcak.srce.hr/120189

Sažetak
This paper considers a multiple-circle detection problem on the basis of given data. The problem is solved by application of the center-based clustering method. For the purpose of searching for a locally optimal partition modeled on the well-known k-means algorithm, the k-closest circles algorithm has been constructed. The method has been illustrated by several numerical examples.

Ključne riječi
data clustering; circle detection; k-means; locally optimal partition

Hrčak ID: 120189

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

Posjeta: 788 *