DocumentCode :
2462873
Title :
QIDBSCAN: A Quick Density-Based Clustering Technique
Author :
Tsai, Cheng-Fa ; Huang, Tang-Wei
Author_Institution :
Dept. of Manage. Inf. Syst., Nat. Pingtung Univ. of Sci. & Technol., Pingtung, Taiwan
fYear :
2012
fDate :
4-6 June 2012
Firstpage :
638
Lastpage :
641
Abstract :
Of the many data clustering algorithms proposed in recent years, the most effective are the density-based clustering algorithms, DBSCAN and IDBSCAN. Although density-based clustering method is effective for identifying graphs, filtering out noise, and obtaining good clustering results, it is extremely time consuming. The IDBSCAN is faster than DBSCAN but is still unsatisfactory. This study therefore developed QIDBSCAN (Quick IDBSCAN), a new data clustering algorithm based on IDBSCAN that uses four MBOs (Marked Boundary Objects) to expand computing directly without an actual dataset selection. The experimental results in this study confirm that QIDBSCAN is substantially faster than IDBSCAN and DBSCAN.
Keywords :
data mining; graph theory; pattern clustering; MBO; QIDBSCAN; data clustering algorithms; dataset selection; graph identification; marked boundary objects; noise filtering; quick IDBSCAN; quick density-based clustering technique; Algorithm design and analysis; Clustering algorithms; Clustering methods; Data mining; Noise; Spatial databases; data clustering; data mining; large database;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer, Consumer and Control (IS3C), 2012 International Symposium on
Conference_Location :
Taichung
Print_ISBN :
978-1-4673-0767-3
Type :
conf
DOI :
10.1109/IS3C.2012.166
Filename :
6228389
Link To Document :
بازگشت