Advertisement

A Parallel Genetic Algorithm for Pattern Recognition in Mixed Databases

  • Angel Kuri-MoralesEmail author
  • Javier Sagastuy-Breña
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10267)

Abstract

Structured data bases may include both numerical and non-numerical attributes (categorical or CA). Databases which include CAs are called “mixed” databases (MD). Metric clustering algorithms are ineffectual when presented with MDs because, in such algorithms, the similarity between the objects is determined by measuring the differences between them, in accordance with some predefined metric. Nevertheless, the information contained in the CAs of MDs is fundamental to understand and identify the patterns therein. A practical alternative is to encode the instances of the CAs numerically. To do this we must consider the fact that there is a limited subset of codes which will preserve the patterns in the MD. To identify such pattern-preserving codes (PPC) we appeal to neural networks (NN) and genetic algorithms (GA). It is possible to identify a set of PPCs by trying out a bounded number of codes (the individuals of a GA’s population) and demanding the GA to identify the best individual. Such individual is the best practical PPC for the MD. The computational complexity of this task is considerable. To decrease processing time we appeal to multi-core architectures and the implementation of multiple threads in an algorithm called ParCENG. In this paper we discuss the method and establish experimental bounds on its parameters. This will allow us to tackle larger databases in much shorter execution times.

Keywords

Categorical databases Neural networks Genetic algorithms Parallel computation 

References

  1. 1.
    Norusis, M.: SPSS 16.0 statistical procedures companion. Prentice Hall Press, Upper Saddle River (2008)Google Scholar
  2. 2.
    Goebel, M., Gruenwald, L.: A survey of data mining and knowledge discovery software tools. ACM SIGKDD Explor. Newslett. 1(1), 20–33 (1999)CrossRefGoogle Scholar
  3. 3.
    Sokal, R.R.: The principles of numerical taxonomy: twenty-five years later. Comput.-Assist. Bacterial Syst. 15, 1 (1985)CrossRefGoogle Scholar
  4. 4.
    Barbará, D., Yi, L., Julia C.: COOLCAT: an entropy-based algorithm for categorical clustering. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 582–589. ACM (2002)Google Scholar
  5. 5.
    Kuri-Morales, A.F.: Categorical encoding with neural networks and genetic algorithms. In: Zhuang, X., Guarnaccia, C. (eds.) WSEAS Proceedings of the 6th International Conference on Applied Informatics and. Computing Theory, pp. 167–175, 01 July 2015. ISBN 9781618043139, ISSN: 1790-5109Google Scholar
  6. 6.
    Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control, Signals Syst. 2(4), 303–314 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Networks 5(1), 96–101 (1994)CrossRefGoogle Scholar
  8. 8.
    Castro, F., Gelbukh, A., González, M. (eds.): MICAI 2013. LNCS (LNAI), vol. 8266. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-45111-9 Google Scholar
  9. 9.
    Widrow, B., Lehr, M.A.: 30 years of adaptive neural networks: perceptron, madaline, and backpropagation. Proc. IEEE 78(9), 1415–1442 (1990)CrossRefGoogle Scholar
  10. 10.
    Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J., Schwefel, H.-P. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000). doi: 10.1007/3-540-45356-3_83 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Instituto Tecnológico Autónomo de MéxicoMexico D.F.Mexico

Personalised recommendations