2017
DOI: 10.26483/ijarcs.v8i7.4301
|View full text |Cite
|
Sign up to set email alerts
|

A Review on K-Mode Clustering Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 0 publications
0
10
0
Order By: Relevance
“…Finally, students' responses were clustered. K-mode clustering was applied (Goyal & Aggarwal, 2017) using the library "k-modes". Clustering is defined as the process of grouping similar data based on features (based on students' responses).…”
Section: Methodsmentioning
confidence: 99%
“…Finally, students' responses were clustered. K-mode clustering was applied (Goyal & Aggarwal, 2017) using the library "k-modes". Clustering is defined as the process of grouping similar data based on features (based on students' responses).…”
Section: Methodsmentioning
confidence: 99%
“…Presenting thorough use cases and analyses of these techniques is beyond the scope of this paper. Instead, we refer the reader interested in a review of image processing techniques to Buades et al (2005) and Goyal et al (2012), and to Punzo et al (2016) for application to HI spectral cube data.…”
Section: Filtering and Fragment Shadersmentioning
confidence: 99%
“…Partitioning clustering can be interpreted by the centroidal Voronoi tessellation method in mathematics ( Du and Wong, 2002 ). It can be further specified to -means ( Forgy, 1965 , Hartigan and Wong, 1979 , Lloyd, 1982 , MacQueen, 1967 ), -medians ( Charikar and Guha, 2002 ), and -modes ( Goyal and Aggarwal, 2017 ), where -means is the most popular. To implement those, one needs to express observations of the data in a metric space, such that a distance measure can be defined.…”
Section: Introductionmentioning
confidence: 99%