About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Artificial Intelligence for Communications and Networks. 4th EAI International Conference, AICON 2022, Hiroshima, Japan, November 30 - December 1, 2022, Proceedings

Research Article

Efficient Inductive Logic Programming Based on Particle Swarm Optimization

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-031-29126-5_13,
        author={Kyosuke Obara and Munehiro Takimoto and Tsutomu Kumazawa and Yasushi Kambayashi},
        title={Efficient Inductive Logic Programming Based on Particle Swarm Optimization},
        proceedings={Artificial Intelligence for Communications and Networks. 4th EAI International Conference, AICON 2022, Hiroshima, Japan, November 30 - December 1, 2022, Proceedings},
        proceedings_a={AICON},
        year={2023},
        month={3},
        keywords={Inductive logic programming Particle swarm optimization Progol},
        doi={10.1007/978-3-031-29126-5_13}
    }
    
  • Kyosuke Obara
    Munehiro Takimoto
    Tsutomu Kumazawa
    Yasushi Kambayashi
    Year: 2023
    Efficient Inductive Logic Programming Based on Particle Swarm Optimization
    AICON
    Springer
    DOI: 10.1007/978-3-031-29126-5_13
Kyosuke Obara1,*, Munehiro Takimoto1, Tsutomu Kumazawa2, Yasushi Kambayashi3
  • 1: Department of Information Sciences
  • 2: Software Research Associates
  • 3: Department of Computer and Information Engineering
*Contact email: 6322510@ed.tus.ac.jp

Abstract

Inductive Logic Programming (ILP) is an inductive reasoning method based on the first-order predicative logic. This technology is widely used for data mining using symbolic artificial intelligence. ILP searches for a suitable hypothesis that covers positive examples and uncovers negative examples. The searching process requires a lot of execution cost to interpret many given examples for practical problems. In this paper, we propose a new hypothesis search method using particle swarm optimization (PSO). PSO is a meta-heuristic algorithm based on behaviors of particles. In our approach, each particle repeatedly moves from a hypothesis to another hypothesis within a hypothesis space. At that time, some hypotheses are refined based on the value returned by a predefined evaluation function. Since PSO just searches a part of the hypothesis space, it contributes to the speed up of the execution of ILP. In order to demonstrate the effectiveness of our method, we have implemented it on Progol that is one of the ILP systems [6], and then we conducted numerical experiments. The results showed that our method reduced the hypothesis search time compared to another conventional Progol.

Keywords
Inductive logic programming Particle swarm optimization Progol
Published
2023-03-26
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-031-29126-5_13
Copyright © 2022–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL