Acquisition of Characteristic TTSP Graph Patterns by Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

  author =       "Satoshi Nagai and Tetsuhiro Miyahara and 
                 Yusuke Suzuki and Tomoyuki Uchida",
  booktitle =    "Advanced Applied Informatics (IIAIAAI), 2012 IIAI
                 International Conference on",
  title =        "Acquisition of Characteristic TTSP Graph Patterns by
                 Genetic Programming",
  year =         "2012",
  pages =        "340--344",
  keywords =     "genetic algorithms, genetic programming, data mining,
                 directed graphs, learning (artificial intelligence),
                 characteristic TTSP graph patterns, data mining,
                 directed acyclic graph, electric networks, electric
                 scheduling, evolutionary method, graph structured data,
                 machine learning, negative data, positive data,
                 two-terminal series parallel graphs, Data mining,
                 Educational institutions, Evolutionary computation,
                 Sociology, Statistics, graph mining, machine learning",
  DOI =          "doi:10.1109/IIAI-AAI.2012.73",
  size =         "5 pages",
  abstract =     "Machine learning and data mining from graph structured
                 data are studied intensively. TTSP (Two-Terminal Series
                 Parallel) graphs are used as data models for electric
                 networks and scheduling. A TTSP graph is a directed a
                 cyclic graph obtained by recursively applying 'series'
                 and 'parallel' operations. We propose an evolutionary
                 method for acquiring characteristic TTSP graph patterns
                 from positive and negative data by using Genetic
  notes =        "Also known as \cite{6337219}",

Genetic Programming entries for Satoshi Nagai Tetsuhiro Miyahara Yusuke Suzuki Tomoyuki Uchida