Pregled bibliografske jedinice broj: 653408
Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters
Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters // Knowledge-based systems, 57 (2014), 1-7 doi:10.1016/j.knosys.2013.11.010 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 653408 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters
Autori
Scitovski, Rudolf ; Sabo, Kristian
Izvornik
Knowledge-based systems (0950-7051) 57
(2014);
1-7
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
k-means; clustering; data mining
Sažetak
In this paper, the well-known $k$-means algorithm for searching for a locally optimal partition of the set $\mathcal{; ; ; ; ; A}; ; ; ; ; \subset\R^n$ is analyzed in the case if some data points occur on the border of two or more clusters. For this special case, a useful strategy by implementation of the $k$-means algorithm is proposed.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
235-2352818-1034 - Nelinearni problemi procjene parametara u matematičkim modelima (Jukić, Dragan, MZOS ) ( CroRIS)
Ustanove:
Sveučilište u Osijeku, Odjel za matematiku
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
