2016 2nd International Conference on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics (AEEIC 2016
DOI: 10.1109/aeeicb.2016.7538328
|View full text |Cite
|
Sign up to set email alerts
|

An empirical comparison of Clustering using hierarchical methods and K-means

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…The results of cluster analysis reveal internal data structure and improve understanding of data. There are many cluster algorithms that are available for data partitioning into clusters and k-means being a popular algorithm apportions each data point in data set in such a fashion that it falls in just one cluster (Praveen & Rama, 2016). Fuzzy k-means cluster analysis was done and the optimum number of clusters were obtained by using FuzME software (Davatgar et al, 2012;Minasny & McBratney, 2002).…”
Section: Fuzzy Cluster Algorithm Analysismentioning
confidence: 99%
“…The results of cluster analysis reveal internal data structure and improve understanding of data. There are many cluster algorithms that are available for data partitioning into clusters and k-means being a popular algorithm apportions each data point in data set in such a fashion that it falls in just one cluster (Praveen & Rama, 2016). Fuzzy k-means cluster analysis was done and the optimum number of clusters were obtained by using FuzME software (Davatgar et al, 2012;Minasny & McBratney, 2002).…”
Section: Fuzzy Cluster Algorithm Analysismentioning
confidence: 99%
“…They are applicable to medium-sized datasets. The most representative is the k-means clustering [15]. -Hierarchical methods: they derive multiple cluster subdivisions, exploit the tree structure and use different threshold values within each cluster and inhomogeneity thresholds between distinct clusters [16].…”
Section: Clustering Methodsmentioning
confidence: 99%
“…These agents could also be thought of visiting these locations through an abstract sense.Thoughthe actual execution is fastened by implanting a physical machine over mobile agents who tend to offer an acceptable mechanism for gathering knowledge from web. A typical example is a net spider agent [15] that visits and processes a series of websites by following machine readable text links called as net crawlers.…”
Section: Logically Mobilementioning
confidence: 99%