Result: Page sets as web search answers

Title:
Page sets as web search answers
Authors:
YUMOTO, Takayuki, TANAKA, Katsumi
Source:
Digital libraries (achievements, challenges and opportunities)0ICADL 2006. :244-253
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 7 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Documentation, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Traitement des données. Listes et chaînes de caractères, Data processing. List processing. Character string processing, Systèmes d'information. Bases de données, Information systems. Data bases, Analyse comportementale, Behavioral analysis, Análisis conductual, Bibliothèque électronique, Electronic library, Biblioteca electronica, Circonscription, Circumscription, Circonscripción, Classification hiérarchique, Hierarchical classification, Clasificación jerarquizada, Internet, Interrogation base donnée, Database query, Interrogación base datos, Mot clé, Keyword, Palabra clave, Moteur recherche, Search engine, Buscador, Pertinence, Relevance, Pertinencia, Programmation logique, Logical programming, Programación lógica, Recherche information, Information retrieval, Búsqueda información, Représentation connaissance, Knowledge representation, Representación conocimientos, Réseau web, World wide web, Red WWW, Similitude, Similarity, Similitud, Utilisation information, Information use, Uso información, Programmation par ensemble reponse, Answer set programming, Programación conjunto respuesta
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Social Informatics, Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku Kyoto 606-8501, Japan
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19151194
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19151194
Database:
PASCAL Archive

Further Information

Conventional Web search engines rank their searched results page by page. That is, conventionally, the information unit for both searching and ranking is a single Web page. There are, however, cases where a set of searched pages shows a better similarity (relevance) to a given (keyword) query than each individually searched page. This is because the information a user wishes to have is sometimes distributed on multiple Web pages. In such cases, the information unit used for ranking should be a set of pages rather than a single page. In this paper, we propose the notion of a page set ranking, which is to rank each pertinent set of searched Web pages. We describe our new algorithm of the page set ranking to efficiently construct and rank page sets. We present some experimental results and the effectiveness of our approach.