Comparisons between data clustering algorithms

المؤلف

Abu Abbas, Usamah

المصدر

The International Arab Journal of Information Technology

العدد

المجلد 5، العدد 3 (31 يوليو/تموز 2008)، ص ص. 320-325، 6ص.

الناشر

جامعة الزرقاء

تاريخ النشر

2008-07-31

دولة النشر

الأردن

عدد الصفحات

6

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

الملخص EN

Clustering is a division of data into groups of similar objects.

Each group, called a cluster, consists of objects that are similar between themselves and dissimilar compared to objects of other groups.

This paper is intended to study and compare different data clustering algorithms.

The algorithms under investigation are : k-means algorithm, hierarchical clustering algorithm, self-organizing maps algorithm, and expectation maximization clustering algorithm.

All these algorithms are compared according to the following factors : size of dataset, number of clusters, type of dataset and type of software used.

Some conclusions that are extracted belong to the performance, quality, and accuracy of the clustering algorithms.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Abu Abbas, Usamah. 2008. Comparisons between data clustering algorithms. The International Arab Journal of Information Technology،Vol. 5, no. 3, pp.320-325.
https://search.emarefa.net/detail/BIM-11511

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Abu Abbas, Usamah. Comparisons between data clustering algorithms. The International Arab Journal of Information Technology Vol. 5, no. 3 (Jul. 2008), pp.320-325.
https://search.emarefa.net/detail/BIM-11511

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Abu Abbas, Usamah. Comparisons between data clustering algorithms. The International Arab Journal of Information Technology. 2008. Vol. 5, no. 3, pp.320-325.
https://search.emarefa.net/detail/BIM-11511

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

includes bibliographical references : p. 25

رقم السجل

BIM-11511