• Aucun résultat trouvé

Exploring folksonomies for adaptive query expansion

N/A
N/A
Protected

Academic year: 2022

Partager "Exploring folksonomies for adaptive query expansion"

Copied!
2
0
0

Texte intégral

(1)

Exploring folksonomies for adaptive query expansion

Fabio Gasparetti

Department of Computer Science and Automation Artificial Intelligence Laboratory

Roma Tre University

Via della Vasca Navale, 79 - 00146 Rome, Italy [email protected]

Abstract. Web is growing at an astonishing rate, making it necessary to devise effective methods for helping users find what they are looking for. Adaptive query expansion (QE) allows users to better define their search domain by supplementing the original query with additional terms related to their preferences and information needs [3].

While Automatic QE has a long history in the information retrieval com- munity, there are a very few attempts to make this technique adaptive to user current needs (e.g., [6, 1, 7]). Most of the Automatic QE approaches are based on the following assumption: documents classified higher by an initial search contain many useful terms that can help discriminate relevant documents from irrelevant ones. Despite the large number of studies, a crucial issue is that the expansion terms identified through traditional methodologies from the pseudo-relevant documents may not be all useful [2]. One of the failure reasons of the query expansion has been identified in the lack of relevant documents in the local collection.

Consequently, some works advance the use of an external resource for query expansion in order to improve the effectiveness of query expan- sion, such as thesaurus (e.g., WordNet) [4], Wikipedia [8], and search engine query logs [5]. Recently, several authors have focused on social annotations in various tasks, largely motivated by their increasing avail- ability through many Web-based applications.

The proposed approach1is an extension of the traditional QE techniques, which rely on the computation of two-dimensional co-occurrence matri- ces. Our system makes use of three-dimensional co-occurrence matrices, where the added dimension is represented by semantic classes (i.e., cat- egories comprising all the terms that share a semantic property) related to the folksonomy extracted from social bookmarking services such as delicious, Digg, and StumbleUpon.

The whole procedure of adaptation is completely transparent to the user, as it takes place in an implicit way based on his profile. The user profile is created and dynamically updated using the information related to visited pages and corresponding search queries. The system analyzes the input queries and, if they actually reflect the interests already shown by

1 This is a joint work with my colleagues Claudio Biancalana, Alessandro Micarelli and Giuseppe Sansonetti.

(2)

2 F. Gasparetti

the user in previous searches, it returns different QEs involving different semantic fields. The output of the system is structured in different blocks categorized through keywords, thus helping the user decide which result is most relevant to him. A deep evaluation on different datasets and real users shows that our system outperforms some well-known approaches in the literature.

Keywords: adaptive query expansion, folksonomy, search engine, infor- mation retrieval

References

1. Bouadjenek, M.R., Hacid, H., Bouzeghoub, M., Daigremont, J.: Personalized social query expansion using social bookmarking systems. In: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information.

pp. 1113–1114. SIGIR ’11, ACM, New York, NY, USA (2011), http://doi.acm.

org/10.1145/2009916.2010075

2. Cao, G., Nie, J.Y., Gao, J., Robertson, S.: Selecting good expansion terms for pseudo-relevance feedback. In: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval. pp. 243–

250. SIGIR ’08, ACM, New York, NY, USA (2008),http://doi.acm.org/10.1145/

1390334.1390377

3. Carpineto, C., Romano, G.: A survey of automatic query expansion in information retrieval. ACM Comput. Surv. 44(1), 1 (2012)

4. Collins-Thompson, K., Callan, J.: Query expansion using random walk models. In:

Proceedings of the 14th ACM international conference on Information and knowl- edge management. pp. 704–711. CIKM ’05, ACM, New York, NY, USA (2005), http://doi.acm.org/10.1145/1099554.1099727

5. Cui, H., Wen, J.R., Nie, J.Y., Ma, W.Y.: Query expansion by mining user logs.

IEEE Trans. on Knowl. and Data Eng. 15, 829–839 (July 2003), http://dl.acm.

org/citation.cfm?id=1435677.858986

6. De Meo, P., Quattrone, G., Ursino, D.: A query expansion and user profile enrich- ment approach to improve the performance of recommender systems operating on a folksonomy. User Model. User-Adapt. Interact. 20(1), 41–86 (2010)

7. Lin, Y., Lin, H., Jin, S., Ye, Z.: Social annotation in query expansion: a machine learning approach. In: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information. pp. 405–414. SIGIR ’11, ACM, New York, NY, USA (2011),http://doi.acm.org/10.1145/2009916.2009972

8. Xu, Y., Jones, G.J., Wang, B.: Query dependent pseudo-relevance feedback based on wikipedia. In: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval. pp. 59–66. SIGIR ’09, ACM, New York, NY, USA (2009),http://doi.acm.org/10.1145/1571941.1571954

Références

Documents relatifs

The results presented in Table 1 show globally that query expansion using only terms’ synonyms from MeSH improves the IR performance in our experiments (Run 6).. Although

We presented our approach for query expansion, which includes concept can- didates generation from Wikipedia and DBpedia, and the selection of K-best concepts according to the

Query expansion in the bilingual tasks (denoted by “X” at the end of the names in Table 3) added the source topics from the translation and an additional translation of the topics

In this year, since we want to analysis if query expansion using web resource can bring different information with relevant feedback, we redo the media mapping method and use it to

However, unlike the positional relevance model [12] which is a formal approach for QE ex- tending the relevance Language Model (LM) [10], we believe that the suitability of

Given an original query q = {w q1 , ..., w qn }, the process of expanding q is three- fold: (1) retrieving relevant tweets answering q using a retrieval model, (2) se- lecting a set

In the paper we use two query expansion models, Kullback-Liebler Divergence(KLD) model and parameter-free Bose-Einstein statistics-based (Bo1) model, to improve

Many experiments were conducted to find the best configuration for query expan- sion. Table 2 lists two of the best runs with the proposed approach for the same que- ries. Run 4