A Tsetlin Machine with Multigranular Clauses

The recently introduced Tsetlin Machine (TM) has provided competitive pattern recognition accuracy in several benchmarks, however, requires a 3-dimensional hyperparameter search. In this paper, we introduce the Multigranular Tsetlin Machine (MTM). The MTM eliminates the specificity hyperparameter, used by the TM to control the granularity of the conjunctive clauses that it produces for recognizing patterns. Instead of using a fixed global specificity, we encode varying specificity as part of the clauses, rendering the clauses multigranular. This makes it easier to configure the TM because the dimensionality of the hyperparameter search space is reduced to only two dimensions. Indeed, it turns out that there is significantly less hyperparameter tuning involved in applying the MTM to new problems. Further, we demonstrate empirically that the MTM provides similar performance to what is achieved with a finely specificity-optimized TM, by comparing their performance on both synthetic and real-world datasets.

[1]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[2]  A. Asuncion,et al.  UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences , 2007 .

[3]  Mandayam A. L. Thathachar,et al.  Learning Optimal Discriminant Functions through a Cooperative Game of Automata , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  Seyed-Hamid Zahiri Classification rule discovery using learning automata , 2012, Int. J. Mach. Learn. Cybern..

[5]  M. Thathachar,et al.  Learning automata algorithms for pattern classification , 1999 .

[6]  Arif Orhun Uzun,et al.  A solution to the classification problem with cellular automata , 2018, Pattern Recognit. Lett..

[7]  M. L. Tsetlin On the Behavior of Finite Automata in Random Media , 1961 .

[8]  Hamid Beigy,et al.  Associative cellular learning automata and its applications , 2017, Appl. Soft Comput..

[9]  Sorour Afshar,et al.  Presenting a new multiclass classifier based on learning automata , 2013, Neurocomputing.

[10]  M. Meybodi,et al.  Node Classification in Social Network by Distributed Learning Automata , 2017 .

[11]  Seyed-Hamid Zahiri,et al.  Learning automata based classifier , 2008, Pattern Recognit. Lett..

[12]  P. Anandan,et al.  Pattern-recognizing stochastic learning automata , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Seyed Hamid Zahiri,et al.  Data Mining Using Learning Automata , 2009 .

[14]  Naresh Manwani,et al.  A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[15]  Anis Yazidi,et al.  Distributed learning automata for solving a classification task , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[16]  Zarina Shukur,et al.  Cellular learning automata approach for data classification , 2012 .

[17]  Ole-Christoffer Granmo,et al.  The Tsetlin Machine - A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic , 2018, ArXiv.