Abstract
This paper explores the issue of input randomization in decision tree ensembles for time series classification. We suggest an unsupervised discretization method to create diverse discretized datasets. We introduce a novel ensemble method, in which each decision tree is trained on one dataset from the pool of different discretized datasets created by the proposed discretization method. As the discretized data has a small number of boundaries the decision tree trained on it is forced to learn on these boundaries. Different decision trees trained on datasets having different discretization boundaries are diverse. The proposed ensembles are simple but quite accurate. We study the performance of the proposed ensembles against the other popular ensemble techniques. The proposed ensemble method matches or outperforms Bagging, and is competitive with Adaboost.M1 and Random Forests.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hansen, L.K., Salamon, P.: Neural Network Ensembles. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 993–1001 (1990)
Brieman, L.: Bagging Predictiors. Machine Learning 2, 123–140 (1996)
Freund, Y., Schapire, R.E.: A Decision Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences 55, 119–139 (1997)
Ho, T.K.: The Random Subspace Method for Constructing Decision Forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20, 832–844 (1998)
Random Forest. Machine Learning 1, 5-32 (2001)
Chan, K., Fu, A.W.: Efficient time Series Matching by wavelets. In: The Proceedings of the 15th IEEE International Conference on Data Engineering, sydney, Australia, pp. 126–133 (1999)
Keogh, E., Chakrabarthi, K., Pazzani, M., Mehrotra, S.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Seriece Database. In: The Proceedings of ACM SIGMOD Conference on Management of Data, Santa Bardara, CA, pp. 151–162 (2001)
Gerurt, P.: Pattern Extraction for Time Series Classification. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 115–127. Springer, Heidelberg (2001)
Lin, J., Keogh, E., Lonardi, S., Chiu, B.: Asymbolic Representaion of Time Series with Implication Demonstration. In: The Proceedings of the 8th ACM SIGMODI Worshop on Research Issues in Data Mining and Knowledge Discovery, San Diego, pp. 2–11 (2002)
Keogh, E., Kasetty, S.: On the Need for Time Series Data Mining Benchmarck: A Survey and Emprical Demostration. In: Proceedings of the 8th ACM SIGKDD Internation Conference on Knowledge Discovery and Data Mining, pp. 102–111 (2002)
Dougherty, J., Kahavi, R., Sahami, M.: Supervised Discretization of Continuous Features. In: Proceeding of the 12th International Conference on Machine Learning (1995)
Daw, C.S., Finney, E.A., Tracy, E.R.: A Review of Symbolic Anaysis of Experimental Data. Review of Scientific Instruments 2, 915–930 (2003)
Quinlan, J.R.: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Fancisco (1993)
Tumer, K., Ghosh, J.: Error Correlation and Error Reduction in Ensemble Classifiers, vol. 3, pp. 385–404 (1996)
Witten, I.H., Frank, E.: Data Mining, Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Dietterich, T.G.: Approximation Statistical Test for Comparing Supervised Classification Learning Algorithms. Neural Computation, 1895–1923 (1998)
Alpaydin, E.: Combined 5 x 2 c v f Test Comparing Supervised Classification Learning Algorithms. Neural Computation 8, 1885–1892 (1999)
Utgoff, P.E.: Incremental Induction of Desicion Trees. Machine Learning 2, 161–186 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halawani, S.M., Albidewi, I.A., Ahmad, A. (2011). A Novel Ensemble Method for Time Series Classification. In: Venugopal, K.R., Patnaik, L.M. (eds) Computer Networks and Intelligent Computing. ICIP 2011. Communications in Computer and Information Science, vol 157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22786-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-22786-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22785-1
Online ISBN: 978-3-642-22786-8
eBook Packages: Computer ScienceComputer Science (R0)