The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Modified Single Pass Clustering Algorithm Based on Median as a Threshold Similarity Value
|
|
Author(s): Mamta Mittal (G. B. Pant Govt. Engineering College, India), R. K. Sharma (Thapar University, India), V.P. Singh (Thapar University, India)and Lalit Mohan Goyal (Bharati Vidyapeeth College of Enineering, India)
Copyright: 2017
Pages: 25
Source title:
Collaborative Filtering Using Data Mining and Analysis
Source Author(s)/Editor(s): Vishal Bhatnagar (Ambedkar Institute of Advanced Communication Technologies and Research, India)
DOI: 10.4018/978-1-5225-0489-4.ch002
Purchase
|
Abstract
Clustering is one of the data mining techniques that investigates these data resources for hidden patterns. Many clustering algorithms are available in literature. This chapter emphasizes on partitioning based methods and is an attempt towards developing clustering algorithms that can efficiently detect clusters. In partitioning based methods, k-means and single pass clustering are popular clustering algorithms but they have several limitations. To overcome the limitations of these algorithms, a Modified Single Pass Clustering (MSPC) algorithm has been proposed in this work. It revolves around the proposition of a threshold similarity value. This is not a user defined parameter; instead, it is a function of data objects left to be clustered. In our experiments, this threshold similarity value is taken as median of the paired distance of all data objects left to be clustered. To assess the performance of MSPC algorithm, five experiments for k-means, SPC and MSPC algorithms have been carried out on artificial and real datasets.
Related Content
|
.
© 2023.
34 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
18 pages.
|
|
.
© 2023.
24 pages.
|
|
.
© 2023.
32 pages.
|
|
.
© 2023.
21 pages.
|
|
|