Fuzlearn: A Fuzzy Clusterization based Machine Learning using Learning Automata

被引:0
作者
Shmarov, Ivan [1 ]
Docampo, Pablo [3 ]
Billam, Thomas [1 ]
Shafik, Rishad [2 ]
Yakovlev, Alex [2 ]
机构
[1] Newcastle Univ, Sch Math Stat & Phys, Newcastle Upon Tyne, Tyne & Wear, England
[2] Newcastle Univ, Sch Engn, Newcastle Upon Tyne, Tyne & Wear, England
[3] Univ Glasgow, Sch Chem, Glasgow, Lanark, Scotland
来源
2022 INTERNATIONAL SYMPOSIUM ON THE TSETLIN MACHINE (ISTM 2022) | 2022年
基金
英国工程与自然科学研究理事会;
关键词
Machine learning; learning automata; clustering; model classification;
D O I
10.1109/ISTM54910.2022.00023
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Existing machine learning (ML) algorithms, such as Neural Networks (NNs), typically consist of complex data encoding and preprocessing on real-world data followed by extensive arithmetic. As such when implemented in hardware or software they incur high energy consumption as well as increased data-to-decision latency. Recently, the Tsetlin Machine (TM) was proposed as a promising new alternative which takes advantage of logic propositions founded on the principle of Tsetlin Automata, leading to higher energy efficiency, faster training convergence and lower latency. However, TM interfaces require complex data encoding procedures which can add significant overheads. In this paper, we propose a new machine learning approach that is built on the principle of fuzzy clusterization of decision boundaries directly from analog data. This approach effectively excludes the usual booleanization or analog-to-digital (A2D) conversion necessary in conventional approaches, thus offering low-complexity and potentially energy efficiency gains. Fundamental to this algorithm is a team of Learning Automata constituting a clusterization unit termed Clause that act as an Analog-to-Boolean classifier. Depending on the complexity of the ML dataset, a team of clauses derive the classification rules with minimal algorithmic and arithmetic complexities. The software implementation of the algorithm is tested against several problems. Experiments show that the proposed algorithm manages to achieve comparable accuracy as the Tsetlin Machine with fewer clauses. To study the impact of noise in the input features, we subsequently validate our algorithm with a few variants of noisy XOR datasets. Experiments with these datasets show that our approach is capable of mitigating noise effectively due to fuzzy classification boundaries.
引用
收藏
页码:89 / 96
页数:8
相关论文
共 18 条
[1]   A Scheme for Continuous Input to the Tsetlin Machine with Applications to Forecasting Disease Outbreaks [J].
Abeyrathna, Kuruge Darshana ;
Granmo, Ole-Christoffer ;
Zhang, Xuan ;
Goodwin, Morten .
ADVANCES AND TRENDS IN ARTIFICIAL INTELLIGENCE: FROM THEORY TO PRACTICE, 2019, 11606 :564-578
[2]  
[Anonymous], 1989, Learning Automata: An Introduction
[3]  
[Anonymous], 2009, Introduction to Algorithms
[4]  
Bayrakci H., 2022, ADV ARTIFICIAL INTEL, V2, P7
[5]  
Brown TB, 2020, ADV NEUR IN, V33
[6]   Multi-column deep neural network for traffic sign classification [J].
Ciresan, Dan ;
Meier, Ueli ;
Masci, Jonathan ;
Schmidhuber, Juergen .
NEURAL NETWORKS, 2012, 32 :333-338
[7]   Model Compression and Hardware Acceleration for Neural Networks: A Comprehensive Survey [J].
Deng, Lei ;
Li, Guoqi ;
Han, Song ;
Shi, Luping ;
Xie, Yuan .
PROCEEDINGS OF THE IEEE, 2020, 108 (04) :485-532
[8]  
Dua D, 2019, UCI MACHINE LEARNING
[9]  
Granmo O.-C., 2018, ARXIV180401508
[10]  
Granmo O.-C., 2019, The convolutional Tsetlin machine