Accessibility navigation

Distributed hoeffding trees for pocket data mining

Stahl, F. ORCID:, Gaber, M. M., Bramer, M. and Yu, P. S. (2011) Distributed hoeffding trees for pocket data mining. In: International Conferance on High Performance Computing and Simulation (HPCS), 2011. IEEE, pp. 686-692. ISBN 9781612843803

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1109/HPCSim.2011.5999893


Collaborative mining of distributed data streams in a mobile computing environment is referred to as Pocket Data Mining PDM. Hoeffding trees techniques have been experimentally and analytically validated for data stream classification. In this paper, we have proposed, developed and evaluated the adoption of distributed Hoeffding trees for classifying streaming data in PDM applications. We have identified a realistic scenario in which different users equipped with smart mobile devices run a local Hoeffding tree classifier on a subset of the attributes. Thus, we have investigated the mining of vertically partitioned datasets with possible overlap of attributes, which is the more likely case. Our experimental results have validated the efficiency of our proposed model achieving promising accuracy for real deployment.

Item Type:Book or Report Section
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:30157

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation