Skip to main content

The Regression Tsetlin Machine: A Tsetlin Machine for Continuous Output Problems

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11805))

Included in the following conference series:

  • 1993 Accesses

Abstract

The recently introduced Tsetlin Machine (TM) has provided competitive pattern classification accuracy in several benchmarks, composing patterns with easy-to-interpret conjunctive clauses in propositional logic. In this paper, we go beyond pattern classification by introducing a new type of TMs, namely, the Regression Tsetlin Machine (RTM). In all brevity, we modify the inner inference mechanism of the TM so that input patterns are transformed into a single continuous output, rather than to distinct categories. We achieve this by: (1) using the conjunctive clauses of the TM to capture arbitrarily complex patterns; (2) mapping these patterns to a continuous output through a novel voting and normalization mechanism; and (3) employing a feedback scheme that updates the TM clauses to minimize the regression error. The feedback scheme uses a new activation probability function that stabilizes the updating of clauses, while the overall system converges towards an accurate input-output mapping. The performance of the RTM is evaluated using six different artificial datasets with and without noise, in comparison with the Classic Tsetlin Machine (CTM) and the Multiclass Tsetlin Machine (MTM). Our empirical results indicate that the RTM obtains the best training and testing results for both noisy and noise-free datasets, with a smaller number of clauses. This, in turn, translates to higher regression accuracy, using significantly less computational resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In this expression, “four clauses to represent the pattern (1 ✳ ✳)” is written as “4 \(\times \) (1 ✳ ✳)”.

References

  1. Granmo, O.-C.: The Tsetlin machine - a game theoretic bandit driven approach to optimal pattern recognition with propositional logic, arXiv e-prints, arXiv:1804.01508, April 2018

  2. Tsetlin, M.L.: On behaviour of finite automata in random medium. Avtom I Telemekhanika 22, 1345–1354 (1961)

    Google Scholar 

  3. Granmo, O.-C., Oommen, B.J.: Solving stochastic nonlinear resource allocation problems using a hierarchy of twofold resource allocation automata. IEEE Trans. Comput. 59(4), 545–560 (2010)

    Article  MathSciNet  Google Scholar 

  4. Oommen, B.J., Kim, S.-W., Samuel, M.T., Granmo, O.-C.: A solution to the stochastic point location problem in metalevel nonstationary environments. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 38(2), 466–476 (2008)

    Article  Google Scholar 

  5. Tung, B., Kleinrock, L.: Using finite state automata to produce self-optimization and self-control. IEEE Trans. Parallel Distrib. Syst. 7(4), 439–448 (1996)

    Article  Google Scholar 

  6. Bouhmala, N., Granmo, O.-C.: Stochastic learning for SAT-encoded graph coloring problems. Int. J. Appl. Metaheuristic Comput. (IJAMC) 1(3), 1–19 (2010)

    Article  Google Scholar 

  7. Abeyrathna, K., Granmo, O.-C., Goodwin, M.: A novel Tsetlin automata scheme to forecast dengue outbreaks in the Philippines. In: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 680–685. IEEE (2018)

    Google Scholar 

  8. Berge, G.T., Granmo, O.-C., Oddbjørn Tveit, T., Goodwin, M., Jiao, L., Viggo Matheussen, B.: Using the Tsetlin machine to learn human-interpretable rules for high-accuracy text categorization with medical applications, arXiv e-prints, arXiv:1809.04547, September 2018

  9. Abeyrathna, K., Granmo, O.-C., Zhang, X., Goodwin, M.: A scheme for continuous input to the Tsetlin machine with applications to forecasting disease outbreaks, arXiv e-prints, arXiv:1905.04199, May 2019

  10. Misra, S., Krishna, P.V., Abraham, K.I.: A simple learning automata-based solution for intrusion detection in wireless sensor networks. Wirel. Commun. Mob. Comput. 11(3), 426–441 (2011)

    Article  Google Scholar 

  11. Tuan, T.A., Tong, L.C., Premkumar, A.: An adaptive learning automata algorithm for channel selection in cognitive radio network. In: 2010 International Conference on Communications and Mobile Computing, pp. 159–163. IEEE (2010)

    Google Scholar 

  12. Narendra, K.S., Thathachar, M.A.: Learning Automata: An Introduction. Courier Corporation, North Chelmsford (2012)

    Google Scholar 

  13. Narendra, K., Thathachar, M.: Learning automata-a survey. IEEE Trans. Syst. Man Cybern. 4, 323–334 (1974)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Darshana Abeyrathna .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Abeyrathna, K.D., Granmo, OC., Jiao, L., Goodwin, M. (2019). The Regression Tsetlin Machine: A Tsetlin Machine for Continuous Output Problems. In: Moura Oliveira, P., Novais, P., Reis, L. (eds) Progress in Artificial Intelligence. EPIA 2019. Lecture Notes in Computer Science(), vol 11805. Springer, Cham. https://doi.org/10.1007/978-3-030-30244-3_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-30244-3_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-30243-6

  • Online ISBN: 978-3-030-30244-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics