Using Hierarchical Task Network Planning Techniques to Create Custom Web Search Services over Multiple Biomedical Databases

García Remesal, Miguel (2008). Using Hierarchical Task Network Planning Techniques to Create Custom Web Search Services over Multiple Biomedical Databases. En: "12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II", 03/09/2008-05/09/2008, Zagreb, Croatia.

Descripción

Título: Using Hierarchical Task Network Planning Techniques to Create Custom Web Search Services over Multiple Biomedical Databases
Autor/es:
  • García Remesal, Miguel
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Fechas del Evento: 03/09/2008-05/09/2008
Lugar del Evento: Zagreb, Croatia
Título del Libro: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems
Fecha: 2008
Materias:
Palabras Clave Informales: Database integration, automated planning, hierarchical task network planning.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (275kB) | Vista Previa

Resumen

We present a novel method to create complex search services over public online biomedical databases using hierarchical task network planning techniques. In the proposed approach, user queries are regarded as planning tasks (goals), while basic query services provided by the databases correspond to planning operators (POs). Each individual source is then mapped to a set of POs that can be used to process primitive (simple) queries. Advanced search services can be created by defining decomposition methods (DMs). The latter can be regarded as “recipes” that describe how to decompose non-primitive (complex) queries into sets of simpler sub queries following a divide-and conquer strategy. Query processing proceeds by recursively decomposing non primitive queries into smaller queries; until primitive queries are reached that can be processed using planning operators. Custom web search services can be created from the generated planners to provide biomedical researchers with valuable tools to process frequent complex queries.

Más información

ID de Registro: 4273
Identificador DC: http://oa.upm.es/4273/
Identificador OAI: oai:oa.upm.es:4273
URL Oficial: http://www.uni-trier.de
Depositado por: Memoria Investigacion
Depositado el: 24 Sep 2010 11:35
Ultima Modificación: 20 Abr 2016 13:34
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM