The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic — mentioned by shakna

Wed, 02 Jan 2019 11:50:44 GMT

For a detailed understanding, you need the paper. [0] But, loosely speaking, it is a classifier that works best with less information, utilising a series of formulas. It only really does bitwise ops for recognition, and is easy to implement and fast. If I were to describe it in more flowery terms, hashing and finite automata had a baby. [0] https://arxiv.org/abs/1804.01508

Paper and discussion history. A mention is not an endorsement.

The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic — mentioned by kurthr

Wed, 02 Jan 2019 04:27:35 GMT

Just go straight to the paper or code... the write-up is almost content free. Paper: https://arxiv.org/abs/1804.01508 Code: https://github.com/cair/TsetlinMachine

Paper and discussion history. A mention is not an endorsement.

The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic · HackerPapers discussions

The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic — mentioned by shakna

The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic — mentioned by kurthr