G-OPTICS: fast ordering density-based cluster objects using graphics processing units Online publication date: Fri, 22-Jun-2018
by Wookey Lee; Woong-Kee Loh
International Journal of Web and Grid Services (IJWGS), Vol. 14, No. 3, 2018
Abstract: Clustering is the process of forming groups or clusters of similar objects in the dataset and has been used as an important tool for many data mining applications including the web-based ones. While density-based clustering algorithms are widely adopted, their clustering result is highly sensitive to parameter values. The OPTICS algorithm presents a solution to this problem; it produces an ordering of objects that is equivalent to the clustering results for a wide range of thresholds ϵ. In this paper, we propose an algorithm named G-OPTICS to significantly improve the performance of OPTICS using a graphics processing unit (GPU). The experimental results using real and synthetic datasets demonstrated that G-OPTICS outperformed the previously fastest FOPTICS algorithm by up to 118.3 times (67.7 times on the average).
Online publication date: Fri, 22-Jun-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org