Distribution bottlenecks in classification algorithms

Ardjan Zwartjes, Paul J.M. Havinga, Gerard J.M. Smit, Johann L. Hurink

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
82 Downloads (Pure)


The abundance of data available on Wireless Sensor Networks makes online processing necessary. In industrial appli–cations 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 implement–ing 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.
Original languageEnglish
Pages (from-to)960-967
Number of pages8
JournalProcedia computer science
Publication statusPublished - 2012
EventSecond International Symposium on Frontiers in Ambient and Mobile Systems (FAMS-2012) - Niagara Falls, Canada
Duration: 27 Aug 201229 Aug 2012

Cite this