Pregled bibliografske jedinice broj: 1003000
An Overview of Clustering Models with an Application to Document Clustering
An Overview of Clustering Models with an Application to Document Clustering // Proceedings of the 42nd International Convention MIPRO 2019, Computers in Education / Skala, Karolj (ur.).
Opatija: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2019. str. 1928-1933 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 1003000 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
An Overview of Clustering Models with an
Application to Document Clustering
Autori
Pauletić, Iva ; Načinović Prskalo, Lucia ; Brkić Bakarić, Marija
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 42nd International Convention MIPRO 2019, Computers in Education
/ Skala, Karolj - Opatija : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2019, 1928-1933
Skup
42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2019) ; Computer in Education (CE 2019)
Mjesto i datum
Opatija, Hrvatska, 20.05.2019. - 24.05.2019
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
clustering ; clustering algorithms ; K-Means ; Mean-shift ; hierarchical clustering ; DBSCAN, Birch ; clustering evaluation
(clustering ; clustering algorithms ; K-Means ; Mean-shift ; hierarchical clustering ; DBSCAN ; Birch, clustering evaluation)
Sažetak
This paper presents an overview of selected clustering models and shows an application of K-Means algorithm to document clustering. In the introductory part, the definitions of basic concepts and common characteristics of clustering models are described. Then an overview of clustering models is given. The methods of clustering, basic characteristics, visualization and possible input data for each algorithm are presented. The authors also explain the assessment of each algorithm taking into consideration measures such as Rand index, homogeneity, completeness, Vmeasure and Silhouette coefficient. Furthermore, the paper describes the application of the K-Means algorithm to document clustering showing the final result and elaborating the procedures applied when clustering the documents.
Izvorni jezik
Engleski
Znanstvena područja
Informacijske i komunikacijske znanosti
POVEZANOST RADA
Projekti:
18.14.2.2.02
17.14.2.2.01
Ustanove:
Fakultet informatike i digitalnih tehnologija, Rijeka
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Conference Proceedings Citation Index - Science (CPCI-S)