Harmony Search algorithm for optimal word size in symbolic time series representation

Conference on Data Mining and Optimization

Volumn , Issue , 2011, Pages 57-62

  Mohammed Ahmed, Almahdi ^a   Bakar, Azuraliza Abu ^a   Hamdan, Abdul Razak ^a  

^a UNIVERSITI KEBANGSAAN MALAYSIA   (Malaysia)

Author keywords

data minin; discretization time series; Harmony algorithm; optimization; pre processing

Indexed keywords

ALPHABET SIZE; CLASSIFICATION ACCURACY; DATA INFORMATIONS; DATA MININ; DATA SETS; DISCRETIZATIONS; ERROR RATE; HARMONY ALGORITHM; HARMONY SEARCH ALGORITHMS; HIGH QUALITY; METAHEURISTIC; OPTIMIZATION ALGORITHMS; PRE-PROCESSING; REPRESENTATION METHOD; SERIES REPRESENTATIONS; TIME-SERIES DATA;

CLASSIFICATION (OF INFORMATION); DATA COMPRESSION; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; OPTIMIZATION; TIME SERIES;

DATA MINING;

EID: 80055034204     PISSN: 21556938     EISSN: 21556946     Source Type: Conference Proceeding    
DOI: 10.1109/DMO.2011.5976505     Document Type: Conference Paper

References (15)

1. F. Mu, et al., "Optimizing time series discretization for knowledge discovery," presented at the Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, Chicago, Illinois, USA, 2005.
2. Brian, B., B. Shivnath. Models and issues in data stream systems. Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. Madison, Wisconsin, ACM (2002).
3. Bakar, A.A.; Othman, Z.A.; Shuib, N.L.M. 2009. Building a new taxonomy for data discretization techniques. 10-14. Proceedings of the 2nd Conference on Data Mining and Optimization, DMO 2009, 27-28 Oct. Malaysia, ISBN 978-1-4244-4944-6.
4. Jessica, L., K. Eamonn,. A symbolic representation of time series, with implications for streaming algorithms. Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery. San Diego, California, ACM (2003).
5. Acosta Mesa, H.G., Nicandro, C.R., Daniel-Alejandro, G.-L.: Entropy Based Linear Approximation Algorithm for Time Series Discretization. In: Advances in Artificial Intelligence and Applications, vol. 32, pp. 214-224. Research in Computers Science
6. Alejandro, G.-L.D.: Algoritmo de Discretizacíon de Series de Tiempo Basado en Entropía y su Aplicacíon en Datos Colposcopicos. Universidad Veracruzana (2007).
7. Acosta-Mesa, D.-A. G.-L. a. H.-G. "Discretization of Time Series Dataset with a Genetic Search " Lecture Notes in Computer Science Volume 5845/2009: 201-212.
8. G. Pierre, "Pattern Extraction for Time Series Classification," Book Pattern Extraction for Time Series Classification, Series Pattern Extraction for Time Series Classification, ed., Editor ed. eds., Springer-Verlag, 2001, pp
9. Bakar, A. A., A. Mohammed Ahmed, et al. (2010). Discretization of Time Series Dataset Using Relative Frequency and K-Nearest Neighbor Approach. Advanced Data Mining and Applications. L. Cao, Y. Feng and J. Zhong, Springer Berlin / Heidelberg. 6440: 193-201.
10. Brian, B., B. Shivnath. Models and issues in data stream systems. Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. Madison, Wisconsin, ACM (2002).
11. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: Harmony search. Simulation 76, 60-68 (2001)
12. Lee, K. S. and Z. W. Geem (2005). "A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice." Computer Methods in Applied Mechanics and Engineering 194(36-38): 3902-3933.
13. Geem, Z.W., K.S. Lee and Y. Park, 2005. Application of Harmony Search to Vehicle Routing. Am. J. Applied Sci., 2: 1552-1557.
14. Park, Z. W. G. K. S. L. Y. (2005). "Application of Harmony Search to Vehicle Routing." American Journal of Applied Sciences 2(12): 1552-1557.
15. Degertekin, S. O. (2009). "Optimum Design of Steel Frames via Harmony Search Algorithm." Studies in Computational Intelligence Volume 239/2009: 51-78.