Memetic programming with adaptive local search using tree data structures

Mabrouk, Emad; Hedar, Abdel-Rahman; Fukushima, Masao

doi:10.1145/1456223.1456278

Cited by 8 publications

(14 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Meta-Heuristics Programming (MHP) framework [3], [4], [10], is invoked as inspiration for designing Scatter Programming (SP) method as an extension to the Scatter Search (SS). SP has shown a promising performance and results in solving machine learning problems.…”

Section: Discussionmentioning

confidence: 99%

“…In this section, some local search procedures over a tree space are presented [3], [4], [10]. These procedures aim to generate trial moves from a current tree in its neighborhood.…”

Section: Tree Local Searchmentioning

confidence: 99%

“…SS is a Meta heuristics tool that shown promising results in solving combinatorial optimization problems. This paper extends SS and introduces Scatter Programming (SP) by following the structure of the Meta-Heuristics Programming (MHP) framework [3], [4], [10).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scatter programming

Hedar

Osman

2010

2010 2nd International Conference on Computer Technology and Development

Self Cite

View full text Add to dashboard Cite

The core of artificial intelligence and machine learning is to get computers to solve problems automatically.One of the great tools that attempt to achieve that goal is Genetic Programming (GP). As alternatives to GP, Scatter Programming (SP) is proposed in this paper. One of the main features of SP is to exploit local search in order to overcome some recently addressed drawbacks of GP, especially its highly disruption of its main operations; crossover and mutation. This work shows that SP has promising performance and results in solving machine learning problems.

show abstract

Section: Discussionmentioning

confidence: 99%

“…In this section, some local search procedures over a tree space are presented [3], [4], [10]. These procedures aim to generate trial moves from a current tree in its neighborhood.…”

Section: Tree Local Searchmentioning

confidence: 99%

See 1 more Smart Citation

Scatter programming

Hedar

Osman

2010

2010 2nd International Conference on Computer Technology and Development

Self Cite

View full text Add to dashboard Cite

show abstract

“…The local search procedures aim to generate new trees in a neighborhood of a given tree X. In this subsection, we discuss two types of local searches; static structure search and dynamic structure search, Mabrouk et al [2,3]. Static structure search explores the neighborhood of a tree by altering its nodes without changing its structure.…”

Section: Local Searches Over Tree Spacementioning

confidence: 99%

“…3 shows examples of generating a new tree X̃ from a tree X by applying shaking, grafting and pruning procedures. For more details see Mabrouk et al [2,3].…”

Section: Local Searches Over Tree Spacementioning

confidence: 99%

Prime number generation using memetic programming

Mabrouk

Hernández-Castro

Fukushima

2011

Artif Life Robotics

Self Cite

View full text Add to dashboard Cite

For centuries, the study of prime numbers has been regarded as a subject of pure mathematics in number theory. Recently, this vision has changed and the importance of prime numbers increased rapidly especially in information technology, e.g., public key cryptography algorithms, hash tables, and pseudorandom number generators. One of the most popular topics that attract attention is to find a formula that maps the set of natural numbers into the set of prime numbers. However, up to now there is no known formula that produces all primes. In this paper, we use a hybrid evolutionary algorithm, called the Memetic Programming (MP) algorithm, to generate mathematical formulas that produce distinct primes. Using the MP algorithm, we succeeded to discover an interesting set of formulas that produce sets of distinct primes.

show abstract

Marketing Meets Data Science: Bridging the Gap

Moscato

Vries

2019

Business and Consumer Analytics: New Ideas

View full text Add to dashboard Cite

Memetic programming with adaptive local search using tree data structures

Cited by 8 publications

References 8 publications

Scatter programming

Scatter programming

Prime number generation using memetic programming

Marketing Meets Data Science: Bridging the Gap

Contact Info

Product

Resources

About