2008
DOI: 10.1109/tkde.2008.88
|View full text |Cite
|
Sign up to set email alerts
|

Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters

Abstract: Abstract-In this paper, we present an agglomerative fuzzy K-Means clustering algorithm for numerical data, an extension to the standard fuzzy K-Means algorithm by introducing a penalty term to the objective function to make the clustering process not sensitive to the initial cluster centers. The new algorithm can produce more consistent clustering results from different sets of initial clusters centers. Combined with cluster validation techniques, the new algorithm can determine the number of clusters in a dat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
75
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 238 publications
(76 citation statements)
references
References 33 publications
1
75
0
Order By: Relevance
“…Many systems uses the recommender systems to form the dataset, the recommender system also uses the direct recommender algorithm to give out the data in the form of services [7]. Mostly the data set formed will not look in to the description value of the data instant it checks only for the migrant value of the data based on the usage of the data information.…”
Section: Data Set Formationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Many systems uses the recommender systems to form the dataset, the recommender system also uses the direct recommender algorithm to give out the data in the form of services [7]. Mostly the data set formed will not look in to the description value of the data instant it checks only for the migrant value of the data based on the usage of the data information.…”
Section: Data Set Formationsmentioning
confidence: 99%
“…To overcome these issues exact content mining techniques has been proposed and named as EPCRR (Enabled Pile Clustered exact content retrieval and repository). This work is similar but advanced web content mining which can be viewed as the use of data mining techniques with the advancement towards the automatic data retrieval [7]. It facilitates the web mining procedure namely usage, structure, content and user profiles.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Macy's merchandise pricing optimization application provides a classic example of reducing the cycle time for complex and large-scale analytical calculations from hours or even days to minutes or seconds [13]. The department store chain has been able to reduce the time to optimize pricing of its 73 million items for sale from over 27 hours to just over 1 hour.…”
Section: Big Data For Time Reductionmentioning
confidence: 99%
“…For instance, to find out who are similar to A in Table 1, the traditional recommendation system may use cosine similarity [2] or k-means algorithm [6], [7] to do the calculations. However, Finding similar users of this kind has its shortcomings.…”
Section: Introductionmentioning
confidence: 99%