A Fast Algorithm for Identifying Density-Based Clustering Structures Using a Constraint Graph
- Authors
- Kim, Jeong-Hun; Choi, Jong-Hyeok; Yoo, Kwan-Hee; Loh, Woong-Kee; Nasridinov, Aziz
- Issue Date
- Oct-2019
- Publisher
- MDPI
- Keywords
- OPTICS; density-based clustering structure; visualization; constraint graph
- Citation
- ELECTRONICS, v.8, no.10
- Journal Title
- ELECTRONICS
- Volume
- 8
- Number
- 10
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/18108
- DOI
- 10.3390/electronics8101094
- ISSN
- 2079-9292
- Abstract
- OPTICS is a state-of-the-art algorithm for visualizing density-based clustering structures of multi-dimensional datasets. However, OPTICS requires iterative distance computations for all objects and is thus computed in O(n(2)) time, making it unsuitable for massive datasets. In this paper, we propose constrained OPTICS (C-OPTICS) to quickly create density-based clustering structures that are identical to those by OPTICS. C-OPTICS uses a bi-directional graph structure, which we refer to as the constraint graph, to reduce unnecessary distance computations of OPTICS. Thus, C-OPTICS achieves a good running time to create density-based clustering structures. Through experimental evaluations with synthetic and real datasets, C-OPTICS significantly improves the running time in comparison to existing algorithms, such as OPTICS, DeLi-Clu, and Speedy OPTICS (SOPTICS), and guarantees the quality of the density-based clustering structures.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 소프트웨어학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/18108)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.