Orthogonal decision trees for resource-constrained physiological data stream monitoring using mobile devices

Authors:
Haimonti Dutta;Hillol Kargupta;Anupam Joshi
Affiliations:
Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 10
Cited 1

Original Contribution: Stacked generalization

Neural Networks
C4.5: programs for machine learning

C4.5: programs for machine learning
Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)
Boosting a weak learning algorithm by majority

Information and Computation
Bagging predictors

Machine Learning
A streaming ensemble algorithm (SEA) for large-scale classification

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Random Forests

Machine Learning
A Principal Components Approach to Combining Regression Estimates

Machine Learning
A Fourier Spectrum-Based Approach to Represent Decision Trees for Mining Data Streams in Mobile Environments

IEEE Transactions on Knowledge and Data Engineering
Orthogonal Decision Trees

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining

MineFleet®: an overview of a widely adopted distributed vehicle performance data mining system

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of monitoring physiological data streams obtained from resource-constrained wearable sensing devices for pervasive health-care management. It considers Orthogonal decision trees (ODTs) that offer an effective way to construct a redundancy-free, accurate, and meaningful representation of large decision-tree-ensembles often created by popular techniques such as Bagging, Boosting, Random Forests and many distributed and data stream mining algorithms. ODTs are functionally orthogonal to each other and they correspond to the principal components of the underlying function space. This paper offers experimental results to document the performance of ODTs on grounds of accuracy, model complexity, and resource consumption.