By Topic

A data streams clustering algorithm using DNA computing techniques based on mobile agent

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)
Zhang Hongyan ; School of Information and Management, Shandong Normal University Jinan, China ; Liu Xiyu

D-Stream algorithm is an extended grid-based clustering algorithm for the data streams. Actually, grid-based clustering can be considered to be a combinatorial problem of the grids and DNA computing techniques are more suitable to solve the combinatorial problem since its first application, which is the Hamilton path problem. In this paper, we propose a new strategy to do CLIQUE clustering using DNA computing techniques and a new framework based on the mobile agent in order to save time and space. The parallelism of DNA computing, the flexibility, autonomy and interaction of the mobile agent improve the executing efficiency of the data streams clustering.

Published in:

Pervasive Computing (JCPC), 2009 Joint Conferences on

Date of Conference:

3-5 Dec. 2009