سال انتشار: ۱۳۸۶

محل انتشار: اولین کنفرانس داده کاوی ایران

تعداد صفحات: ۸

نویسنده(ها):

Mohamad Saraee – Department of Electrical and Computer Engineering Isfahan University of Techno1ogy, Isfahan , 84156-83111
Najmeh Ahmadian – Department of Electrical and Computer Engineering Isfahan University of Techno1ogy, Isfahan , 84156-83111
Zahra Narimani – Department of Electrical and Computer Engineering Isfahan University of Techno1ogy, Isfahan , 84156-83111

چکیده:

Clustering is a basic and useful method in understanding and exploring a data set. Clustering is division of data into groups of similar objects. Each group, called cluster, consists of objects that are similar between themselves and dissimilar to objects of other groups. Interest in clustering has increased recently in new areas of applications including data mining, bioinformatics, web mining, text mining, image analysis andsoon. This survey focuses on clustering in data mining. The goal of this survey is to provide a review of different clustering algorithms in data mining. A Categorization of clustering algorithms has been provided closely followed by this survey. The basics of Hierarchical Clustering include Linkage Metrics, Hierarchical Clusters of Arbitrary and Binary Divisive Partitioning is discussed at first. Next discussion is Algorithms of the Partitioning Relocation Clustering include Probabilistic Clustering, K-Medoids Methods, K-Means Methods. Density-Based-Partitioning, Grid-Based Methods and Co-Occurrence of Categorical Data are other sections. Their comparisons are mostly based on some specific applications and under certain conditions. So the results may become quite different if the conditions change.