Year: 2016
Type: preprint
Abstract: The traditional algorithms do not meet the latest multiple requirements simultaneously for objects. Density-based method is one of the methodologies, which can detect arbitrary shaped clusters where clusters are defined as dense regions separated by low density regions. In this paper, we present a new clustering algorithm to enhance the density-based algorithm DBSCAN. This enables an automatic parameter generation strategy to create clusters with different densities and enables noises recognition, and generates arbitrary shaped clusters. The kdtree is used for increasing the memory efficiency. Experimental result shows that proposed algorithm is capable of handling complex objects with good memory efficiency and accuracy.
Source: arXiv (Cornell University)
Authors: Vijendra, Singh, Trikha, Priyanka
Institution: Mody University of Science and Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W159949530
