Abstract
In a previous work we used a popular bio-inspired algorithm; particle swam optimization (PSO) to improve the performance of a well-known representation method of time series data which is the symbolic aggregate approximation (SAX), where PSO was used to propose a new weighted minimum distance WMD for SAX to recover some of the information loss resulting from the original minimum distance MINDIST on which SAX is based. WMD sets different weights to different segments of the time series according to their information content, where these weights are determined using PSO. We showed how SAX in conjunction with WMD can give better results in times series classification than the original SAX which uses MINDIST. In this paper we revisit this problem and propose optimizing WMD by using a hybrid of PSO and another bio-inspired optimization method which is Bacterial Foraging (BF); an effective bio-inspired optimization algorithm in solving difficult optimization problems. We show experimentally how by using this hybrid to set the weights of WMD we can obtain better classification results than those obtained when using PSO to set these weights.
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
Agnes, M.: Webster’s New World College Dictionary, Webster’s New World (May 2004) ISBN 0764571257
Biswas, A., Dasgupta, S., Das, S., Abraham, A.: Synergy of PSO and Bacterial Foraging Optimization-A Comparative Study on Numerical Benchmarks. In: Corchado, E., Corchado, J.M., Abraham, A. (eds.) Innovations in Hybrid Intelligent Systems. ASC, vol. 44, pp. 255–263. Springer, Heidelberg (2007)
Das, S., Biswas, A., Dasgupta, S., Abraham, A.: Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. Foundations of Computational Intelligence 3, 23–55 (2009)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-series Databases. In: Proc. ACM SIGMOD Conf., Minneapolis (1994)
Fernández-Martínez, J.L., García-Gonzalo, E.: What Makes Particle Swarm Optimization a Very Interesting and Powerful Algorithm? In: Panigrahi, B.K., Shi, Y., Lim, M.-H. (eds.) Handbook of Swarm Intelligence, ALO, vol. 8, pp. 37–65 (2011)
Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms with CD-ROM. Wiley-Interscience (2004)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases. J. of Know. and Inform. Sys. (2000)
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Locally Adaptive Dimensionality Reduction for Similarity Search in Large Time Series Databases. In: SIGMOD, pp. 151–162 (2001)
Keogh, E., Zhu, Q., Hu, B., Hao, Y., Xi, X., Wei, L., Ratanamahatana: The UCR Time Series Classification/Clustering Homepage: www.cs.ucr.edu/~eamonn/time_series_data/
Lin, J., Keogh, E., Lonardi, S., Chiu, B.Y.: A Symbolic Representation of Time Series, with Implications for Streaming Algorithms. In: DMKD 2003, pp. 2–11 (2003)
Megalooikonomou, C.: Multiresolution Symbolic Representation of Time Series. In: Proceedings of the 21st IEEE International Conference on Data Engineering (ICDE), Tokyo, Japan (2005)
Morinaka, Y., Yoshikawa, M., Amagasa, T., Uemura, S.: The L-index: An Indexing Structure for Efficient Subsequence Matching in Time Sequence Databases. In: Proc. 5th Pacific Conf. on Knowledge Discovery and Data Mining, pp. 51–60 (2001)
Muhammad Fuad, M.M.: Particle Swarm Optimization of Information-Content Weighting of Symbolic Aggregate Approximation. In: Zhou, S., Zhang, S., Karypis, G. (eds.) ADMA 2012. LNCS (LNAI), vol. 7713, pp. 443–455. Springer, Heidelberg (2012)
Muhammad Fuad, M.M.: When Optimization Is Just an Illusion. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013, Part I. LNCS (LNAI), vol. 8346, pp. 121–132. Springer, Heidelberg (2013)
Muhammad Fuad, M.M., Marteau, P.-F.: Fast Retrieval of Time Series Using a Multi-resolution Filter with Multiple Reduced Spaces. In: Cao, L., Feng, Y., Zhong, J. (eds.) ADMA 2010, Part I. LNCS, vol. 6440, pp. 137–148. Springer, Heidelberg (2010)
Muhammad Fuad, M.M., Marteau, P.F.: Multi-resolution Approach to Time Series Retrieval. In: Fourteenth International Database Engineering and Applications Symposium, IDEAS 2010, Montreal, QC, Canada, August 16-18 (2010)
Muhammad Fuad, M.M., Marteau, P.F.: Speeding-up the Similarity Search in Time Series Databases by Coupling Dimensionality Reduction Techniques with a Fast-and-dirty Filter. In: Fourth IEEE International Conference on Semantic Computing, ICSC 2010, September 22-24. Carnegie Mellon University, Pittsburgh (2010)
Passino, K.M.: Biomimicry of Bacterial Foraging for Distributed Optimization and Control. IEEE Control Systems Magazine (2002)
Reynolds, C.W.: Flocks, Herds and Schools: A Distributed Behavioral Model. SIGGRAPH Comput. Graph. 21, 4 (1987)
Yi, B.K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary Lp Norms. In: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt (2000)
Zavala, A.M., Aguirre, A.H., Diharce, E.V.: Robust PSO-based Constrained Optimization by Perturbing the Particle’s Memory. In: Chan, F.T.S., Tiwari, M.K. (eds.) Swarm Intelligence: Focus on Ant and Particle Swarm Optimization. I-Tech Education and Publishing (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Muhammad Fuad, M.M. (2014). A Weighted Minimum Distance Using Hybridization of Particle Swarm Optimization and Bacterial Foraging. In: Pham, DN., Park, SB. (eds) PRICAI 2014: Trends in Artificial Intelligence. PRICAI 2014. Lecture Notes in Computer Science(), vol 8862. Springer, Cham. https://doi.org/10.1007/978-3-319-13560-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-13560-1_25
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13559-5
Online ISBN: 978-3-319-13560-1
eBook Packages: Computer ScienceComputer Science (R0)