By Topic

A density-based clustering algorithm for weighted network with attribute information

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
$33 $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

2 Author(s)
Wu Lingyu ; School of economics and management, University of science and technology beijing, China ; Xuedong Gao

Research of clustering method based on density is an important task in data mining. In order to improve the density-based methods for attribute space(such as DBSCAN, CLIQUE, OPTICS and so on) which ignore the relationships between objects, and the density-based methods for network(such as SCAN, DCSBRD and so on) which ignore the attribute information of objects, a density-based clustering algorithm for weighted network with attribute information (DCAWN) is proposed in the paper. After setting up the weighted network based on attribute distance, the algorithm refreshes the definition of near neighbor object and core object, and offers the corresponding clustering policy. For considering both attribute and relationship information, the algorithm increases the clustering accuracy, improves the clustering result, and distinguishes the hub and outlier objects effectively.

Published in:

Advanced Computer Control (ICACC), 2011 3rd International Conference on

Date of Conference:

18-20 Jan. 2011