Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

ODDC: A Novel Clustering Algorithm Based on One-Dimensional Distance Calculation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhongzhi Li ; Sch. of Electron. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Xuegang Wang ; Zhongzhi Li

The scale of spatial data is usually very large. Clustering algorithm needs very high performance, good scalability, and able to deal with noise data and high-dimensional data. Proposed a quickly clustering algorithm based on one-dimensional distance calculation. The algorithm first partitions space-sets by one-dimensional distance, then clusters space-sets by set-distance and set-density. Next, uses the same approach to the next dimension, until all dimensions have been processed. Experimental results show ODDC algorithm has high-efficient features and is not sensitive to noise data.

Published in:

Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on

Date of Conference:

20-22 Dec. 2008