Distribution Bottlenecks in Classification Algorithms

Share/Save/Bookmark

Zwartjes, G.J. and Havinga, P.J.M. and Smit, G.J.M. and Hurink, J.L. (2012) Distribution Bottlenecks in Classification Algorithms. Procedia Computer Science, 10 . pp. 960-967. ISSN 1877-0509

[img] PDF
Restricted to UT campus only
: Request a copy
126kB
Abstract:The abundance of data available on Wireless Sensor Networks makes online processing necessary. In industrial applications for example, the correct operation of equipment can be the point of interest while raw sampled data is of minor importance. Classification algorithms can be used to make state classifications based on the available data. The distributed nature of Wireless Sensor Networks is a complication that needs to be considered when implementing classification algorithms. In this work, we investigate the bottlenecks that limit the options for distributed execution of three widely used algorithms: Feed Forward Neural Networks, naive Bayes classifiers and decision trees. By analyzing theoretical boundaries and using simulations of various network topologies, we show that the naive Bayes classifier is the most flexible algorithm for distribution. Decision trees can be distributed efficiently but are unpredictable. Feed Forward Neural Networks show severe limitations.
Item Type:Article
Additional information:Second International Symposium on Frontiers in Ambient and Mobile Systems (FAMS-2012), Niagara Falls, Canada, 27-29 August 2012
Copyright:© 2012 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/82145
Official URL:http://dx.doi.org/10.1016/j.procs.2012.06.131
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page