By Topic

An Efficient Method for Battlefield Information Data Stream Mining

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)
Ning Wang ; Nanjing Army Command Coll., Nanjing, China ; Tao Wang

The data model generated by battlefield information is data streams. Because of the rapid data arriving speed and huge size of data set in stream model, novel one-pass algorithms are devised to support data aggregation on demand. VFDT is one of the most successful algorithms for data streams mining, which uses Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed; we revisit this problem and propose an efficient algorithm for handling battlefield information streaming data. In order to examine this algorithm, we study its performance with different data noise level, number of battlefield information nodes and number of data. Overall, the techniques introduced here can handle battlefield information data efficiently.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009