An effective method for finding best entry points in semi-structured documents
Autor: | Eugen Popovici, Gildas Ménier, Pierre-François Marteau |
---|---|
Přispěvatelé: | Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient (VALORIA), Université de Bretagne Sud (UBS), ACM |
Jazyk: | angličtina |
Rok vydání: | 2007 |
Předmět: |
Document Structure Description
computer.internet_protocol Computer science Efficient XML Interchange Well-formed document 02 engineering and technology computer.software_genre XML retrieval Simple API for XML XML Schema Editor 0202 electrical engineering electronic engineering information engineering Information retrieval 05 social sciences XML validation computer.file_format Information Storage and Retrieval : Information Search and Retrieval – retrieval models search process XML framework Best entry points XML database XML Schema (W3C) [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR] ComputingMethodologies_DOCUMENTANDTEXTPROCESSING 020201 artificial intelligence & image processing Ranking 0509 other social sciences 050904 information & library sciences computer XML XML Catalog |
Zdroj: | Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval Annual ACM Conference on Research and Development in Information Retrieval Annual ACM Conference on Research and Development in Information Retrieval, Jul 2007, Amsterdam, Netherlands. pp.851-852, ⟨10.1145/1277741.1277941⟩ SIGIR |
Popis: | Poster; International audience; Focused structured document retrieval employs the concept of best entry point (BEP), which is intended to provide optimal starting-point from which users can browse to relevant document components [4]. In this paper we describe and evaluate a method for finding BEPs in XML documents. Experiments conducted within the framework of INEX 2006 evaluation campaign on the Wikipedia XML collection [2] shown the effectiveness of the proposed approach. |
Databáze: | OpenAIRE |
Externí odkaz: |