A Comparative Study of Clustering Algorithms

View Sample PDF

Author(s): Kanna AlFalahi (United Arab Emirates University-Al Ain, UAE), Saad Harous (United Arab Emirates University-Al Ain, UAE)and Yacine Atif (United Arab Emirates University-Al Ain, UAE)
Copyright: 2011
Volume: 3
Issue: 3
Pages: 18
Source title: International Journal of Virtual Communities and Social Networking (IJVCSN)
Editor(s)-in-Chief: Subhasish Dasgupta (George Washington University, USA)and Rohit Rampal (State University of New York at Plattsburgh, USA)
DOI: 10.4018/jvcsn.2011070101

Keywords: Information Science Reference / Media & Communications / Social Computing / Social Networking

Purchase

View A Comparative Study of Clustering Algorithms on the publisher's website for pricing and purchasing information.

Abstract

Clustering is a major problem when dealing with organizing and dividing data. There are multiple algorithms proposed to handle this issue in many scientific areas such as classifications, community detection and collaborative filtering. The need for clustering arises in Social Networks where huge data generated daily and different relations are established between users. The ability to find groups of interest in a network can help in many aspects to provide different services such as targeted advertisements. The authors surveyed different clustering algorithms from three different clustering groups: Hierarchical, Partitional, and Density-based algorithms. They then discuss and compare these algorithms from social web point view and show their strength and weaknesses in handling social web data. They also use a case study to support our finding by applying two clustering algorithms on articles collected from Delicious.com and discussing the different groups generated by each algorithm.

The IRMA Community

Research IRM

A Comparative Study of Clustering Algorithms

Purchase

Abstract

Related Content

IRMA Sponsors