JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2011, Vol. 41 ›› Issue (4): 85-90.

• Articles • Previous Articles     Next Articles

Enhanced visual-based density clustering algorithm

JIANG Sheng-yi1, LUO Fang-lun1, YU  Wen2   

  1. 1. School of Informatics; 2. School of Management, Guangdong University of Foreign Studies, Guangzhou 510006, China
  • Received:2011-02-01 Online:2011-08-16 Published:2011-02-01

Abstract:

 Visual-based density clustering algorithm is insensitive to the initialized parameters, identify the data with any shape and can find the optimal cluster. One-pass clustering algorithm is efficient and fast. Based on their features we do research on a clustering algorithm which can process the data with mixing attributes. At first, the visual-based density clustering algorithm was improved slightly, which enabled it to process the data with categorical attributes. Then, the two-stage clustering algorithm was put forward. In the first stage, single pass clustering algorithm was used to group the data as an original partition. In the second stage, improved visual-based density clustering algorithm was used to merge the original partition so that the clusters are finally obtained. The experimental results of both the actual and synthetic datasets show that the presented clustering algorithm is effective and practicable.

Key words:  single pass clustering algorithm, visual theory clustering, arbitrary shape cluster

No related articles found!
Viewed
Full text
341
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 341

  From Others local
  Times 34 307
  Rate 10% 90%

Abstract
731
Just accepted Online first Issue
0 0 731
  From Others
  Times 731
  Rate 100%

Cited

Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!