Fuzzy relational clustering around medoids: A unified view
نویسندگان
چکیده
Medoid-based fuzzy clustering generates clusters of objects based on relational data, which records pairwise similarities or dissimilarities among objects. Compared with single-medoid based approaches, our recently proposed fuzzy clustering with multipleweighted medoids has shown superior performance in clustering via experimental study. In this paper, we present a new version of fuzzy relational clustering in this family called fuzzy clustering with multi-medoids (FMMdd). Based on the new objective function of FMMdd, update equations can be derived more conveniently. Moreover, a unified view of FMMdd and two existing fuzzy relational approaches fuzzy c-medoids (FCMdd) and assignment-prototype (A-P) can be established, which allows us to conduct further analytical study to investigate the effectiveness and feasibility of the proposed approach as well as the limitations of existing ones. The robustness of FMMdd is also investigated. Our theoretical and numerical studies show that the proposed approach produces good quality of clusters with rich cluster-based information and it is less sensitive to noise. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
A Fuzzy Relational Clustering Algorithm with q-weighted Medoids ?
Medoids-based fuzzy relational clustering generates clusters of objects based on relational data, which records pairwise similarity or dissimilarities among objects. Compared with single-medoid based approaches, multiple-weighted medoids has shown superior performance in clustering. In this paper, we present a new version of fuzzy relational clustering in this family called fuzzy clustering wit...
متن کاملA Subtractive Relational Fuzzy C-Medoids Clustering Approach To Cluster Web User Sessions from Web Server Logs
In this paper, a subtractive relational fuzzy c-medoids clustering approach is discussed to identify web user session clusters from weblogs, based on their browsing behavior. In this approach, the internal arrangement of data along with the density of pairwise dissimilarity values is favored over arbitrary starting estimations of medoids as done in the conventional relational fuzzy c-medoids al...
متن کاملMultiple Medoids based Multi-view Relational Fuzzy Clustering with Minimax Optimization
Multi-view data becomes prevalent nowadays because more and more data can be collected from various sources. Each data set may be described by different set of features, hence forms a multi-view data set or multi-view data in short. To find the underlying pattern embedded in an unlabelled multiview data, many multi-view clustering approaches have been proposed. Fuzzy clustering in which a data ...
متن کاملLow-complexity fuzzy relational clustering algorithms for Web mining
This paper presents new algorithms (Fuzzy c-Medoids or FCMdd and Robust Fuzzy c-Medoids or RFCMdd) for fuzzy clustering of relational data. The objective functions are based on selecting c representative objects (medoids) from the data set in such a way that the total fuzzy dissimilarity within each cluster is minimized. A comparison of FCMdd with the well-known Relational Fuzzy c-Means algorit...
متن کاملFuzzy Relatives of the CLARANS Algorithm With Application to Text Clustering
This paper introduces new algorithms (Fuzzy relative of the CLARANS algorithm FCLARANS and Fuzzy c Medoids based on randomized search FCMRANS) for fuzzy clustering of relational data. Unlike existing fuzzy c-medoids algorithm (FCMdd) in which the within cluster dissimilarity of each cluster is minimized in each iteration by recomputing new medoids given current memberships, FCLARANS minimizes t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fuzzy Sets and Systems
دوره 183 شماره
صفحات -
تاریخ انتشار 2011