Acquiring Textual Relations Automatically on the Web using Genetic Programming

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

@InProceedings{bergstrom:2000:atrawGP,
  author =       "Agneta Bergstrom and Patricija Jaksetic and 
                 Peter Nordin",
  title =        "Acquiring Textual Relations Automatically on the Web
                 using Genetic Programming",
  booktitle =    "Genetic Programming, Proceedings of EuroGP'2000",
  year =         "2000",
  editor =       "Riccardo Poli and Wolfgang Banzhaf and 
                 William B. Langdon and Julian F. Miller and Peter Nordin and 
                 Terence C. Fogarty",
  volume =       "1802",
  series =       "LNCS",
  pages =        "237--246",
  address =      "Edinburgh",
  publisher_address = "Berlin",
  month =        "15-16 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming: Poster",
  ISBN =         "3-540-67339-3",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1802&spage=237",
  DOI =          "doi:10.1007/978-3-540-46239-2_17",
  abstract =     "The flood of electronic information is pouring over
                 us, while the technology maintaining the information
                 and making it available to us has not yet been able to
                 catch up. One of the paradigms within information
                 retrieval focuses on the use of thesauruses to analyse
                 contextual/structural information. We have explored a
                 method that automatically finds textual relations in
                 electronic documents using genetic programming and
                 semantic networks. Such textual relations can be used
                 to extend and update thesauruses as well as semantic
                 networks. The program is written in PROLOG and
                 communicates with software for natural language
                 parsing. The system is also an example of
                 computationally expensive fitness function using a
                 large database. The results from the experiment show
                 feasibility for this type of automatic relation
                 extraction.",
  notes =        "EuroGP'2000, part of \cite{poli:2000:GP}",
}

Genetic Programming entries for Agneta Bergstrom Patricija Jaksetic Peter Nordin

Citations