hrcak mascot   Srce   HID

Original scientific paper

Data clustering for circle detection

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

Fulltext: english, pdf (586 KB) pages 15-24 downloads: 1.390* cite
APA 6th Edition
Marošević, T. (2014). Data clustering for circle detection. Croatian Operational Research Review, 5 (1), 15-24. Retrieved from https://hrcak.srce.hr/120189
MLA 8th Edition
Marošević, Tomislav. "Data clustering for circle detection." Croatian Operational Research Review, vol. 5, no. 1, 2014, pp. 15-24. https://hrcak.srce.hr/120189. Accessed 16 Oct. 2021.
Chicago 17th Edition
Marošević, Tomislav. "Data clustering for circle detection." Croatian Operational Research Review 5, no. 1 (2014): 15-24. https://hrcak.srce.hr/120189
Harvard
Marošević, T. (2014). 'Data clustering for circle detection', Croatian Operational Research Review, 5(1), pp. 15-24. Available at: https://hrcak.srce.hr/120189 (Accessed 16 October 2021)
Vancouver
Marošević T. Data clustering for circle detection. Croatian Operational Research Review [Internet]. 2014 [cited 2021 October 16];5(1):15-24. Available from: https://hrcak.srce.hr/120189
IEEE
T. Marošević, "Data clustering for circle detection", Croatian Operational Research Review, vol.5, no. 1, pp. 15-24, 2014. [Online]. Available: https://hrcak.srce.hr/120189. [Accessed: 16 October 2021]

Abstracts
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.

Keywords
data clustering; circle detection; k-means; locally optimal partition

Hrčak ID: 120189

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

Visits: 1.755 *