Local Search with Probabilistic Modeling for Learning Multiple-Valued Logic Networks

This paper proposes a probabilistic modeling learning algorithm for the local search approach to the Multiple-Valued Logic (MVL) networks. The learning model (PMLS) has two phases: a local search (LS) phase, and a probabilistic modeling (PM) phase. The LS performs searches by updating the parameters of the MVL network. It is equivalent to a gradient decrease of the error measures, and leads to a local minimum of error that represents a good solution to the problem. Once the LS is trapped in local minima, the PM phase attempts to generate a new starting point for LS for further search. It is expected that the further search is guided to a promising area by the probability model. Thus, the proposed algorithm can escape from local minima and further search better results. We test the algorithm on many randomly generated MVL networks. Simulation results show that the proposed algorithm is better than the other improved local search learning methods, such as stochastic dynamic local search (SDLS) and chaotic dynamic local search (CDLS).

[1]  H. C. Lin,et al.  Resonant tunneling diodes for multi-valued digital applications , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[2]  Igor N. Aizenberg,et al.  Application of the Neural Networks Based on Multi-valued Neurons to Classification of the Images of Gene Expression Patterns , 2001, Fuzzy Days.

[3]  Zheng Tang,et al.  A Chaotic Dynamic Local Search Method for Learning Multiple-Valued Logic Networks , 2009, J. Multiple Valued Log. Soft Comput..

[4]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[5]  Yukio Kosugi,et al.  An image storage system using complex-valued associative memories , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[6]  Xiaoming Xu,et al.  A hybrid genetic algorithm for feature selection wrapper based on mutual information , 2007, Pattern Recognit. Lett..

[7]  M. Abd-El-Barr,et al.  Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach , 2006, 2006 International Conference on Microelectronics.

[8]  Zheng Tang,et al.  A Learning Multiple-Valued Logic Network: Algebra, Algorithm, and Applications , 1998, IEEE Trans. Computers.

[9]  Q. Cao,et al.  A Local Search Based Learning Method for Multiple-Valued Logic Networks , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Yunong Zhang,et al.  Competitive Hopfield Network Combined With Estimation of Distribution for Maximum Diversity Problems , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[12]  Koichi Tanno,et al.  A Learning Multiple-Valued Logic Network that can Explain Reasoning (特集 学習と自己組織化のアルゴリズム--理論とその応用) , 1999 .

[13]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[14]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[15]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[16]  Stanley L. Hurst,et al.  Multiple-Valued Logic—its Status and its Future , 1984, IEEE Transactions on Computers.

[17]  Chang Wook Ahn,et al.  Clustering-Based Probabilistic Model Fitting in Estimation of Distribution Algorithms , 2006, IEICE Trans. Inf. Syst..

[18]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[19]  Kenneth C. Smith,et al.  A multiple valued logic: a tutorial and appreciation , 1988, Computer.

[20]  Yalan Zhou,et al.  Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems , 2009, Expert Syst. Appl..

[21]  Claudio Moraga,et al.  Design of multivalued circuits using genetic algorithms , 1996, Proceedings of 26th IEEE International Symposium on Multiple-Valued Logic (ISMVL'96).

[22]  Takao Waho.  Resonant tunneling transistor and its application to multiple-valued logic circuits , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[23]  Koichi Tanno,et al.  Learning multiple-valued logic networks based on backpropagation , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[24]  Michitaka Kameyama,et al.  Design and implementation of quaternary NMOS integrated circuits for pipelined image processing , 1987 .

[25]  Zheng Tang,et al.  An Improved Local Search Learning Method for Multiple-Valued Logic Network Minimization with Bi-objectives , 2009, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[26]  Michitaka Kameyama,et al.  Quantum device model based super pass gate for multiple-valued digital systems , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[27]  Geoffrey E. Hinton,et al.  Learning representations by back-propagating errors , 1986, Nature.

[28]  Andrew Luk,et al.  Fast Convergent Generalized Back-Propagation Algorithm with Constant Learning Rate , 2004, Neural Processing Letters.

[29]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[30]  Jacek M. Zurada,et al.  Complex-valued multistate neural associative memory , 1996, IEEE Trans. Neural Networks.

[31]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[32]  Fernando José Von Zuben,et al.  BAIS: A Bayesian Artificial Immune System for the effective handling of building blocks , 2009, Inf. Sci..

[33]  Donald D. Givone,et al.  A Minimization Technique for Multiple-Valued Logic Systems , 1968, IEEE Transactions on Computers.

[34]  Hiroki Matsumoto,et al.  Algebraic properties of a learning multiple-valued logic network , 1993, [1993] Proceedings of the Twenty-Third International Symposium on Multiple-Valued Logic.

[35]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[36]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.