Design of Binary Neurons with Supervised Learning for Linearly Separable Boolean Operations

Raj, Kiran S.; Nishanth, M.; Jeyakumar, G.

doi:10.1007/978-3-030-37218-7_54

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Machine Learning (ML) paradigm of computer science provides us with a large list of algorithms for solving the challenging prediction problems around us [1][2][3]. These algorithms imitate how human learns and increases the accuracy of prediction over the experience [4,5]. The research attempts on integrating ML and EA paradigms are showing an increasing trend in the literature.…”

Section: Introductionmentioning

confidence: 99%

A Comparative Study on Genetic algorithm and Reinforcement Learning to Solve the Traveling Salesman Problem

Uthayasuriyan

et al. 2023

Research Reports on Computer Science

View full text Add to dashboard Cite

Machine Learning (ML) and Evolutionary Computing (EC) are the two most popular computational methodologies in computer science to solve learning and optimization problems around us, respectively. It is of research interest in the literature, for exploring these two methodologies and to formulate algorithmic frameworks with 'EA for ML' and 'ML for EA' where EA stands for Evolutionary Algorithm. The objective of this paper is on exploring this dimension of research. The Traveling Salesman Problem (TSP) is one of the NP-hard (nondeterministic polynomial time hard) problems in combinatorial optimization problems. The solution for a TSP is the shortest path covering all the nodes in a given city. This paper compares two algorithms, "Genetic Algorithm (GA)" of the EC domain and "Epsilon-Greedy Q-Learning Algorithm (EQLA)" of the ML domain on solving TSP. The detailed design methodology involved in both these algorithms is discussed in this paper. The experiments are carried out on two different data sets (random and ATT48) to compare the speed and accuracy of the algorithms. The comparative results reveal that the GA could solve the TSP more effectively than EQLA. The obtained inferences along with the limitations are presented in this paper.

show abstract

Section: Introductionmentioning

confidence: 99%

A Comparative Study on Genetic algorithm and Reinforcement Learning to Solve the Traveling Salesman Problem

Uthayasuriyan

et al. 2023

Research Reports on Computer Science

View full text Add to dashboard Cite

show abstract

An Investigational Study on Implementing Integrated Frameworks of Machine Learning and Evolutionary Algorithms for Solving Real-World Applications

Allaparthi,

2023

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

Design of Binary Neurons with Supervised Learning for Linearly Separable Boolean Operations

Cited by 2 publications

References 7 publications

A Comparative Study on Genetic algorithm and Reinforcement Learning to Solve the Traveling Salesman Problem

A Comparative Study on Genetic algorithm and Reinforcement Learning to Solve the Traveling Salesman Problem

An Investigational Study on Implementing Integrated Frameworks of Machine Learning and Evolutionary Algorithms for Solving Real-World Applications

Contact Info

Product

Resources

About