2012 International Conference on Emerging Trends in Science, Engineering and Technology (INCOSET) 2012
DOI: 10.1109/incoset.2012.6513891
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of k-Medoids and Fuzzy C-Means clustering algorithms for clustering telecommunication data

Abstract: Data mining approach and its technology is used to extract the unknown pattern from the large set of data for the business as well as real time applications. This research work deals with two of the most delegated, partition based clustering algorithms in data mining namely k-Medoids and Fuzzy C-Means. These two algorithms are implemented and the performance is analyzed based on their clustering result quality. The connection oriented broad band data is the source of data for this analysis. To test the perform… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
12
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 5 publications
0
12
0
Order By: Relevance
“…Many methods are used for data organization in clusters according to their similarities. The clustering process is usually based on measuring similarities of attributes in data [14].…”
Section: K-means Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…Many methods are used for data organization in clusters according to their similarities. The clustering process is usually based on measuring similarities of attributes in data [14].…”
Section: K-means Clusteringmentioning
confidence: 99%
“…Many methods are used for data organization in clusters according to their similarities. The clustering process is usually based on measuring similarities of attributes in data [14].K-Means algorithm is one of the popular unsupervised learning algorithms, relatively easy for implementation. The basic idea is to define k centroids, one for each cluster.…”
mentioning
confidence: 99%
“…The main aim of K-mean Clustering is to minimize an objective functions. The objective function is defined as in a following way [20],…”
Section: K-mean Clusteringmentioning
confidence: 99%
“…Where x i (j) -c j 2 is a chosen distance measure between a data point x i (j) and the cluster center c j is an indicator of the distance of the n data points from their respective cluster centers [20]. The objective function is also called as cost function 1 .…”
Section: K-mean Clusteringmentioning
confidence: 99%
“…In another study entitled Performance Evaluation of K-Means and Fuzzy C-Means Clustering Algorithms for Statistical Distributions of Input Data Points [12] explained that the two algorithms are implemented and its performance was analyzed based on the quality of the clustering. Behavior of both algorithms depends on the number of data points and the number of clusters.…”
Section: Literature Reviewmentioning
confidence: 99%