VDBSCAN and α-Bisecting Spherical K-Means in Distributed Information Retrieval Systems

Daniel Jiménez *(Department of Computer Systems and Computation (Polytechnic University of Valencia))*

Vicente Vidal

*(Department of Computer Systems and Computation (Polytechnic University of Valencia))*

Leroy Anthony Drummond

*(Computational Research Division (Lawrence Berkeley National Laboratory))*

Abstract:

*We present a comparative study between VDBSCAN and α-Bisecting Spherical K-Means algorithms. The first algorithm, VDBSCAN, is a variation of the DBSCAN algorithm, which produces the same results as DBSCAN but add the possibility of selecting a parameter for the DBSCAN. The second algorithm, α-Bisecting Spherical K-Means, is a variation of the well known K-Means algorithm that improves the K-Means performance. Here, we have implemented parallel versions of the VDBSCAN and α-Bisecting Spherical K-Means algorithms and compare the performance of these implementations.*

Keywords:

*Parallel and Distributed Computing*