Next Article in Journal / Special Issue
Exploration of Quantum Interference in Document Relevance Judgement Discrepancy
Previous Article in Journal
Training Concept, Evolution Time, and the Maximum Entropy Production Principle
Previous Article in Special Issue
On the Stability of Classical Orbits of the Hydrogen Ground State in Stochastic Electrodynamics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Quantum Query Expansion Approach for Session Search †

1
Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin 300354, China
2
Computing and Communications Department, The Open University, Milton Keynes MK7 6AA, UK
3
Department of Information Engineering, University of Padua, Padova PD 35122, Italy
*
Author to whom correspondence should be addressed.
This paper is an extended version of our published conference paper: Zhang, P.; Song, D.; Zhao, X.; Hou, Y. Investigating Query-Drift Problem from a Novel Perspective of Photon Polarization. In Proceedings of the ICTIR 2011, Bertinoro, Italy, 12–14 September 2011; pp. 332–336.
Entropy 2016, 18(4), 146; https://doi.org/10.3390/e18040146
Submission received: 30 January 2016 / Revised: 9 April 2016 / Accepted: 11 April 2016 / Published: 18 April 2016

Abstract

:
Recently, Quantum Theory (QT) has been employed to advance the theory of Information Retrieval (IR). Various analogies between QT and IR have been established. Among them, a typical one is applying the idea of photon polarization in IR tasks, e.g., for document ranking and query expansion. In this paper, we aim to further extend this work by constructing a new superposed state of each document in the information need space, based on which we can incorporate the quantum interference idea in query expansion. We then apply the new quantum query expansion model to session search, which is a typical Web search task. Empirical evaluation on the large-scale Clueweb12 dataset has shown that the proposed model is effective in the session search tasks, demonstrating the potential of developing novel and effective IR models based on intuitions and formalisms of QT.

1. Introduction

Exploring the use of intuitions, analogies and formalisms of Quantum Theory (QT) in the field of Information Retrieval (IR) has recently become an emerging interdisciplinary research area. van Rijsbergen (2004) proposed employing quantum theory (QT) as a theoretical formalism for modeling IR tasks, and showed that major IR models (logical, probabilistic and vector) can be subsumed by the single mathematical formalism in Hilbert vector spaces (which can be a complex space) [1]. Following van Rijsbergen’s pioneering work, many subsequent IR methods [2,3,4] have been proposed. The main inspiration is rooted in considering QT as a sound unified framework for manipulating vector spaces and probability. The QT formalism was applied in contextual IR in [5] to model context-sensitive probability distributions and observables. Piwowarski et al. [2] proposed that queries and documents can be modeled as density operators and subspaces, respectively. Zuccon and Azzopardi proposed a Quantum Probability Ranking Principle (QPRP) [6] to capture the inter-document dependencies as a form of “quantum interference”. Inspired by the Photon Polarization (PP) experiment in quantum physics, Zhao et al. [3] proposed a novel document re-ranking approach, and Zhang et al. [7] further proposed a query expansion model.
In this paper, we will continue with this line of research [3,7] based on the analogy of photon polarization and IR. The photon polarization [8,9] is one of the key experiments that support the explanation of quantum measurement. Briefly speaking, after a couple of polarization filters (of different polarization directions) are inserted between a light source (which generates the photons) and a screen, the amount and probability of photons that finally reach the screen can be well explained by quantum measurement instead of classical measurement [8].
This inspires us to design an analogy of photon polarization in IR. As shown in Figure 1, one can view documents as photons, and the retrieval process as measuring the probability of each document that can pass through a query filter (as polarization filter). Then, the measured probability can be regarded as the estimated probability of relevance for the document with respect to the query [3]. The photon polarization experiment usually inserts an additional filter between the original filter and the photon receiver (i.e., a screen). This is similar to query expansion, where after the first-round retrieval by the original query, an expanded or modified query that aims at a better reflection of the user’s information needs and is usually derived from the top ranked documents, can be constructed and used for the second-round retrieval [7]. Query expansion has been a widely used technique to improve document retrieval performance.
We further develop a novel Quantum interference based Query Expansion (QQE) model. In the proposed model, we assume that a document is expressed in a two-dimensional information need space, whose dimensions represent the explicit user query and the concepts that the user omits from its formulation, i.e., implicit or hidden, which we consider orthogonal. Quantum mechanics allows a physical system to be in multiple exclusive possible states simultaneously, which means it is in a superposed state [10]. In Information Retrieval, we can model the document as a superposed state of explicit and implicit information need aspects. Upon assessing its relevance, the document superposed state originates quantum interference effects, effectively capturing the interactions between the two dimensions. The incorporation of the quantum interference effect is a fundamental difference, compared with the previous quantum fusion approach to query expansion [7] and the PP-inspired document ranking model [3]. We also implement this new quantum query expansion model in the session search task, where the explicit information need is expressed by the user’s currently input query, and the implicit/hidden information need can be estimated or simulated by the historical interactions in search sessions.
Extensive experiments have been conducted on TREC [11] Session Tracks 2013 and 2014 with the Clueweb12 (Category B) collection [12]. The evaluation results show that the proposed QQE model significantly outperforms various state-of-the-art query expansion models. Moreover, our empirical study also reveals that introducing the quantum interference term in the quantum query expansion approach can consistently improve the retrieval performance.

2. Related Work

van Rijsbergen (2004) proposed employing quantum theory (QT) formalism for modeling IR tasks [1] by showing that major IR models (logical, probabilistic and vector) can be subsumed by the single mathematical formalism in Hilbert vector spaces. Specifically, QT provides a geometrical vector representation for information objects (e.g., documents, queries, multimedia objects) in a complex Hilbert space, allowing measurement of observables as relevance status of information objects, probability calculation via the trace formula in Gleason’s Theory [13], logical reasoning through lattice structures, and modeling the change of states via evolution operators [1].
Following van Rijsbergen’s pioneering work [1], a series of QT-based IR approaches have been proposed, which can be classified into three main themes [14]: Spaces: geometrical representation and characterization of context through semantic spaces; (2) Interferences: the interferences among documents and user’s cognitive status in contextual relevance measurement process; (3) Frameworks: general frameworks and operational methods for contextual and multimodal IR.
Piwowarski et al. [2] proposed that queries and documents can be modeled as density operators and subspaces respectively, but the tensor space based representation method has not led to a good retrieval performance. The Quantum Language Model (QLM) [4], a more recent QT-based IR model, successfully solved this issue. In QLM, both single terms and compound term dependencies are represented as projectors in a vector space, while queries and documents are represented as density matrices defining a quantum probability distribution in the space. Recently, the intersection between IR and QT has been illustrated in [15]. A document retrieval model based on the notion of signal filtering was proposed in [16].
Quantum theory (e.g., quantum interference) has been regarded as an important feature of the quantum theory and has been applied in quantum cognition and decision making [17,18,19,20,21,22,23,24,25,26]. Khrennikov pointed out that the classical and quantum mechanical models on p-adic information spaces might be able to investigate the flows of information in cognitive and social systems since a p-adic metric gives quite a natural description of the ability to form associations [20]. Khrennikov further studied the information dynamics in cognitive, psychological, social and anomalous phenomena with the quantum or quantum-like probabilistic structure [21,22]. Many quantum based IR research works [6,27], including our approach that incorporates quantum interference in query expansion, are inspired by these fundamental research on quantum cognition [17,18,19,20,21,22,23,24,25,26].
In IR, Zuccon and Azzopardi [6] proposed a Quantum Probability Ranking Principle (QPRP), which advances the traditional Probability ranking principle by considering the inter-document dependency as a kind of quantum interference in the retrieval model. Zhang et al. [27] utilized probabilistic automata and quantum automata to model the cognitive interference in users’ relevance judgements. To our knowledge, little work has been carried out to integrate the quantum interference in query expansion modeling. In this paper, we aim to incorporate the concepts of photon polarization and quantum interference in the development of a novel query expansion model, and apply the model in the session search task.
Recent session search approaches utilize MDP (Markov Decision Process) [28,29] and POMDP (Partially Observable MDP) [30,31] to simulate the session search process and have achieved good search results. However, this existing work is different from ours, in that they made use of pre-defined rules to adjust weights of query terms, while we do not reply on rules and focus on modeling quantum interference in the query expansion model.

3. Background on Photon Polarization with Its Analogy in IR

3.1. Analogy of Photon Polarization in Document Ranking

We first introduce the basic quantum measurement used in the photon polarization experiment. Please refer to [8,9] for the complete description for this experiment. A photon’s polarization state can be modeled by a unit vector pointing to an appropriate direction. Specifically, the quantum state of any arbitrary polarization can be represented by a linear combination a | + b | of two basis vectors | (vertical polarization) and | (horizontal polarization), where the amplitudes a and b are complex numbers such that a 2 + b 2 = 1 . The quantum measurement on a state transforms the state into one of the measuring device’s associated orthonormal basis. The probability that the state is measured by a basis vector is the squared magnitude of the amplitude in the direction of the corresponding basis vector. For example, a state φ = a | + b | is measured by | with probability a 2 , and by | with probability b 2 . After the measurement of | , the state φ will collapse to a | . Similarly, after the measurement of | , φ will collapse to b | .
As introduced previously, the photon polarization experiment measures the probability of photons that can pass through a polarization filter. We can draw an analogy of photon polarization in IR. Specifically, as shown in Figure 1 and Figure 2, document collections can be considered as photon sources, and the relevance measurement of documents by a given query can be regarded as the photon polarization filtering. Therefore, we can regard the retrieval process as measuring the probability of each document that can pass through the query’s retrieval filter (as polarization filter). The measured probability can be regarded as the estimated probability of relevance of each document.
Under the Quantum formulation, a document d’s state can be formulated as:
| φ d = a d | q + b d | ¬ q ,
where q is the original query, | q denotes the basis vector for relevance, | ¬ q denotes the basis for non-relevance which is orthogonal to | q , and | a d | 2 + | b d | 2 = 1 . | a d | 2 can be estimated by the relevance probability of the document d with respect to q [3].

3.2. Analogy of Photon Polarization in Query Expansion

The photon polarization experiment usually inserts an additional filter between the original filter and the photon receiver (e.g., a screen) (see Figure 3). In information retrieval, after the first-round retrieval by the original query q, one can conduct a second-round retrieval by an expanded query q e [7]. The document d’s state with respect to the expanded query q e can be represented as
| φ d e = a d e | q e + b d e | ¬ q e ,
where | a d e | 2 + | b d e | 2 = 1 , and | a d e | 2 can be estimated by the relevance probability of document d with respect to q e [7].
Query expansion has achieved good retrieval performance in ad hoc search scenario [32]. However, the expanded query may shift from the underlying intent of the original query, leading to the query-drift problem [33]. As a result, for some individual queries, the performance of the expanded query can be inferior to that of the original one. To prevent query-drift, the existing fusion models in [33] linearly combine two probabilities | a d | 2 and | a d e | 2 . Such a direct combination ignores the fact that two probabilities are under different basis, i.e., | q and | q e , respectively. For each document d, the relevance probability | a d | 2 is calculated by the original query basis | q , while the relevance probability | a d e | 2 is calculated by the expanded query basis | q e . Theoretically, it could be more reasonable if we can combine the two relevance probabilities in one basis.
Photon polarization provides a new perspective and a novel mathematical framework to look at the query expansion problem (see Figure 3) [7]. According to the quantum measurement introduced in Section 3.1, we can observe in Figure 3 that, after the measurement by the original query q, the document state will collapse to its basis | q . Therefore, after the second measurement, one can compute the probability of the state | q measured by the expanded query filter basis | q e . The probability amplitude a d f can be represented by the equation:
| q = a d f | q e + b d f | ¬ q e .
Appendix A.1 shows that in the quantum fusion model (QFM), two complete-form solutions of a d f are:
a d f = a d a d e + b d b d e o r a d f = a d a d e - b d b d e .
Different solutions of a d f correspond to different representations of the non-relevance basis (for the expanded query), i.e., | ¬ q e (see Appendix A.1). In [7], the term b d b d e has been omitted in the complete-form solution of a d f . Then, we can have a simplified solution of a d f :
a d f = a d a d e .
The squared norm | a d f | 2 is considered as the fused relevance probability in the quantum fusion approach [7]. It is expected that this approach can fuse | a d | 2 and | a d e | 2 on the same basis | q e . In the next section, we will show several limitations of this approach and illustrate the importance of the involvement of the quantum interference in the query expansion approach.

4. An Advanced Quantum-Inspired Query Expansion Approach

In this section, we first show several problems of the above quantum fusion approach. Then, we propose a quantum-inspired query expansion approach to these problems.

4.1. Limitations of Quantum Fusion Model

The complete-form solution of the quantum fusion model was formulated in Equation (4). We will show that this solution of a d f in Equation (4) only reflects the measurement of | q given the basis | q e but is actually independent of each document d to some extent. Specifically, based on Equation (3), we can represent a d f by an inner-product form q e | q as follows:
q e | q = a d f q e | q e + b d f q e | ¬ q e = a d f .
In addition to a d f , other amplitudes a d and a d e in the quantum fusion solution (see Equation (4)) can also be represented by the inner-product forms q | φ d and q e | φ d , respectively. In Appendix A.2, we derive the quantum fusion solution using inner-product forms of the amplitudes. Appendix A.2 shows that, although the derivation of q e | q has the components q | φ d and q e | φ d for each document d (see Equation (A34)), q e | q actually just reflects the relations (e.g., Cosine similarity in Equation (A35)) between the original query q and the expanded query q e . In other words, the complete-form solution a d f (i.e., q e | q ) of the quantum fusion approach can be considered as a constant value for each document. Therefore, the solution in Equation (4) can not be utilized in a document ranking function.
In the quantum fusion approach, the simplified solution a d f = a d a d e which omits the b d b d e in Equation (4), was used to combine two relevance probabilities and then construct the ranking purpose in [7]. However, the problem is that this simplified approach by multiplying two relevance probabilities together lacks a valid interpretation in a quantum point of view. In other words, if the ranking function is simply | a d f | 2 = | a d | 2 | a d e | 2 , this combination in a multiplication manner still can not meet a quantum or quantum-like interpretation.
Moreover, after each measurement in Figure 3, the document state will collapse to a certain state (i.e., | q after the first measurement, and | q e after the second measurement). This kind of process does not make use of the quantum uncertainties of the superposition and hardly results in a quantum interference, which will be detailed in Section 4.3.

4.2. A Superposition State of the Document in Information Need Space

Now, we propose a new superposition state of document in the information need space. Instead of the superposition of relevance and non-relevance bases regarding the query q in Equation 1, we will model each document in a superposition of the user’s explicit and implicit information needs. The explicit information need can be represented by the user’s currently input query q c , while the implicit information need can be represented by the hidden query q h . Based on the above ideas, we model each document using the following superposition state:
| φ d = a d | q c + b d | q h ,
where | q c is the basis vector of the current query that the user explicitly input, and | q h is the basis vector of the hidden/latent query that the user may be interested in but does not input explicitly. Both the current and hidden queries represent some aspects of the user’s information need. We assume that | q c and | q h are mutually orthogonal, that is, they represent mutually exclusive events but they are two complementary parts of information need.
The amplitude a d ’s squared norm | a d | 2 can be estimated by the probability of a document that is relevant to the current query q c , while | b d | 2 can be estimated by the probability of a document that is relevant to the hidden query q h . | a d | 2 and | b d | 2 can be estimated by calculating the relevance score of a document d with respect to the current query terms and the hidden query terms (e.g., historical query terms), respectively. Given a retrieval model, the relevance scores (i.e., | a d | 2 and | b d | 2 ) for two basis vectors can be normalized, thus ensuring that | a d | 2 + | b d | 2 = 1 .
The new document representation in Equation (7) can be more reasonable, compared with the previous representation in Equation (1). In Equation (1), | ¬ q is defined as an abstract non-relevance basis, which is hardly characterized in the real search task. Therefore, the estimation of its amplitude b d is fully dependent on the estimation for a d (i.e., | b d | 2 = 1 - | a d | 2 ), where a d is the amplitude for the input query basis | q . It turns out that only the explicit information need (expressed by the input query q) can influence the relevance measurement and the document ranking. However, in the real search scenario, the implicit/hidden information need in users’ minds also influences the relevance judgement. The advantage of the new representation in Equation (7) is that it actually models both the explicit and implicit information need, in a superposed state.
Before being measured by an expanded query filter, the document state is a superposed state of the explicit and the implicit information need (IN) states modeled in Equation (7), rather than a certain state collapsed to | q (as discussed in Section 4.1). In other words, one does not know which state (explicit or implicit IN) a document is before it is measured by an expanded query filter. Such an uncertainty encoded in the superposition is the necessary condition of the quantum interference phenomenon [18,19,20,21,22,23,24], which will be detailed next.

4.3. A Quantum Interference Inspired Query Expansion Approach

Recent research in cognitive science [18,19,20,21] addresses that there are some quantum interference phenomena that violate the law of the total probability in decision making. In this paper, we adopt the projection measurement and the path diagram idea in [18], in order to illustrate when the quantum interference can occur in the query expansion scenario. Basically, as aforementioned, before the measurement by the expanded query filter, a superposed state of the document is necessary for the quantum interference. In other words, only if one does not know which path (explicit information need or the implicit information need) that goes to the expanded query filter can the quantum interference occur. Otherwise, the quantum interference can not occur. Next, we explain the cases when the quantum interference can not occur. Note that these cases are corresponding to the quantum fusion model’s idea.
In the condition when the documents sources are measured by the explicit query filter and then the expanded query filter (see Figure 4a), this process follows a certain path φ d q c q e . The probability of the first step φ d q c is measured as:
p ( φ d q c ) = | q c | φ d | 2 .
The probability of the second step q c q e is measured as
p ( q c q e ) = | q e | q c | 2 .
Now, we can get the probability of the whole path φ d q c q e as
p ( φ d q c q e ) = p ( φ d q c ) · p ( q c q e ) , = | q c | φ d | 2 · | q e | q c | 2 , = | q c | φ d q e | q c | 2 .
Similarly, in the condition when the documents sources are measured by the implicit query filter and then the expanded query filter (see Figure 4b), the relevance probability of the document φ d can be measured as
p ( φ d q h q e ) = | q h | φ d q e | q h | 2 .
It turns out that in this known condition for the document state before being measured by the expanded query filter, the quantum interference can not occur.
On the other hand, before being measured by the expanded query filter, if the document is in a superposed state of the explicit information need basis | q c and the implicit information need basis | q h , the quantum interference can possibly occur since the path from either φ d q c q e or φ d q h q e is unknown (see Figure 5). In such an unknown condition, the relevance probability of the document φ d can be measured as:
p ( φ d q e ) = | q e | φ d | 2 = | q c | φ d q e | q c + q h | φ d q e | q h | 2 = ( q c | φ d q e | q c + q h | φ d q e | q h ) · ( q c | φ d q e | q c + q h | φ d q e | q h ) = | q c | φ d q e | q c | 2 + | q h | φ d q e | q h | 2 + 2 | q c | φ d q e | q c q h | φ d q e | q h | cos θ ,
where the two terms | q c | φ d q e | q c | 2 and | q h | φ d q e | q h | 2 correspond to the measured probabilities in Equations (10) and (11), respectively, while the last term (i.e., 2 | q c | φ d q e | q c q h | φ d q e | q h | cos θ ) is called interference term.
Based on Equation (12), we incorporate the quantum interference idea and propose a new query expansion model in session search task which utilizes more search information (e.g., some historical queries and click-through data) than the ad hoc search task described in [7]. Intuitively, a user measures the relevance of a document by both the input query (as the explicit information need) and the hidden query (as the implicit information need in her/his mind). The current query terms reflect the user’s explicit information need and can form the basis vector for | q c . The historical queries (or clicked documents) can somehow reflect the user’s implicit information need, and the corresponding query terms can form the basis vector for | q h . Such implicit information in query log is useful to estimate the user’s hidden information need which is not issued in the current query.
In information retrieval, | q e | φ d | 2 denotes the probability/likelihood of the expanded query q e given the state φ d of the document d, which can be regarded as the relevance score of the document d with respect to the expanded query q e . | q c | φ d | 2 and | q h | φ d | 2 are estimated by the negative KL-divergence (Kullback–Leibler divergence, as a kind of relevance score equivalent to query likelihood [34]) of q c and q h , respectively, given the document d). | q e | q c | 2 and | q e | q h | 2 can be estimated by the Cosine similarity (as a kind of probability measurement [35]) of the two corresponding basis vectors). The last term (i.e., 2 | q c | φ d q e | q c q h | φ d q e | q h | cos θ ) is the quantum interference term, where θ is an interference parameter.

5. Empirical Evaluation

5.1. Data Set

Our experiments are conducted on the TREC (Text REtrieval Conference) [11] Session tracks 2013 and 2014. There are 87 sessions in Session track 2013 and 1024 sessions in Session track 2014. Since the official assessors only assessed 100 sessions for Session track 2014, we only test the proposed query expansion model on this subset. For each session, there is a current query which is used for the retrieval task. Before the current query, there are a series of interactions, e.g., historical queries and clicks. Session tracks ask us to search documents from a document collection for the current query with the consideration of a series of historical interactions. The document collection is the Clueweb12 (Category B) [12] which contains 52,343,021 webpages crawled from the Internet. The document collections is indexed by the Indri toolkit [36]. In the indexing process, all words are stemmed with Porter’s stemmer and stopwords are removed with the normal English stopword list.

5.2. Experimental Set-Up

5.2.1. Descriptions for Tested Models

As summarized in Table 1, there are eight kinds of methods involved in our experiments. The Language Model (LM) [37] and Relevance-based language Model (RM) [32] are baseline models. In Table 1, θ q c , θ q e and θ d are language models for the current query q c , the expanded query q e and document d, respectively. K L ( · , · ) is the KL-divergence for two language models. LM is a method for the first-round retrieval using the current query, and RM is a query expansion approach for the second-round retrieval using the expanded query. In order to obtain a baseline that utilizes the session information, we implement a method called RM-HS (i.e., RM with Historical queries and clicked Snippets), in which pseudo feedback documents are replaced by the implicit feedback documents. Each implicit document is a concatenation of historical query terms and clicked snippets for a specific historical interaction.
The experiments also involve four relevance score combination methods for a comparison. They are combMNZ, interpolation, QFM1 and QFM2, described in [7]. The first two methods (i.e., combMNZ and interpolation) linearly combine the two relevance scores | a d | 2 and | a d e | 2 in an additive manner, where | a d | 2 is the normalized relevance score of LM, and | a d e | 2 is the normalized score of RM. δ q ( d ) and δ q e ( d ) are two functions, the value of which is 1 if d is in the result list of the corresponding query, and 0 otherwise. The last two methods (QFM1 and QFM2) are the Quantum Fusion Models (QFM), which combine | a d | 2 and | a d e | 2 in a multiplicative manner proposed in our previous work [7]. It should be noted that the four score combination methods above have not taken into account the session information, e.g., the historical queries or the click-through data, etc.
The Quantum Query Expansion (QQE) model in Equation (12) is the proposed method in this paper. For QQE, we have implemented four versions according to different estimation methods for s 1 and s 2 ( s 1 = | q e | q c | 2 and s 2 = | q e | q h | 2 , respectively, in Equation (12)) and different acquisition methods for hidden queries q h . For the estimation methods for s 1 and s 2 , one is to use the Cosine similarity between the current query q c (or the hidden query q h ) and expansion query q e ; the other one is to tune free parameters s 1 [ 0 , 1 ] and s 2 = 1 - s 1 . For the acquisition of hidden queries, we have two methods: (1) the concatenation of historical queries within the current session as hidden queries; (2) the concatenation of all historical queries and clicked snippets as hidden queries. In summary, the proposed model can form four variations denoted by suffix:
  • -CH, using Cosine similarity to estimate s 1 and s 2 , and Historical queries as hidden queries.
  • -CS, using Cosine similarity to estimate s 1 and s 2 , and historical queries and clicked Snippets as hidden queries.
  • -PH, tuning Parameters s 1 ( s 2 ), and using Historical queries as hidden queries.
  • -PS, tuning Parameters s 1 ( s 2 ), and using historical queries and clicked Snippets as hidden queries.

5.2.2. Evaluation Metrics

We adopt NDCG [38] and ERR [39] as the evaluation metrics. NDCG is defined as n D C G @ n = D C G @ n / i d e a l D C G @ n , where DCG (Discount Cumulative Gain) is defined as D C G @ n = i = 1 n ( 2 r i - 1 ) ( log ( 1 + i ) ) , n is the number of documents in the ranked list, r i { 0 , 1 , 2 , 3 , 4 } is the relevance degree of document given current query, and i d e a l D C G @ n is the maximized D C G @ n value.
ERR is short for Expected Reciprocal Rank which is a graded evaluation metric. ERR is defined as E R R @ n = r = 1 n 1 r i = 1 r - 1 ( 1 - R i ) R r , where R i = ( 2 g i - 1 ) 2 g m a x , g i is the relevance degree for i t h document, and g m a x is the max relevance degree.

5.2.3. Parameter Settings

In some of the aforementioned models (e.g., RM, Interpolation, QFM2, and QQE), there are some free parameters, for which the selected values are listed in Table 2. For RM (a well known pseudo-relevance feedback model), we search f b D o c { 5 , 10 , 20 , 30 } (the number of feedback documents) and f b T e r m { 10 , 20 , 30 , 50 , 80 , 100 } (the number of expansion query terms). According to the retrieval performance with respect to N D C G @ 10 , we select the optimal parameters f b D o c as f b D o c = 10 and f b T e r m = 50 . For RM-HS, we tune the combination parameter for original query λ ( 0 , 1 ) with the increment 0 . 1 . Similarly, for the fusion model "interpolation", we also tune the combination parameter λ ( 0 , 1 ) with the increment 0 . 1 , and we finally set λ = 0 . 9 . We set η = 8 . 1 ( η [ 1 , 10 ] ). For the proposed models, we regard the interference degree cos θ [ - 0 . 1 , 0 . 3 ] as a parameter. The combination parameter s 1 ( 0 , 0 . 3 ] . For more details of the parameter setting, we can refer to Table 2.

5.3. Evaluation Results

In this section, we report and analyze the performance for all tested models on Session Track 2013 and 2014. The evaluation results for all models evaluated with NDCG@10, NDCG@100, ERR@10 and ERR@100 are reported in Table 3 and Table 4. LM is the baseline model, which ranks documents with KL based retrieval functions. RM expands the current query by selecting terms from the pseudo-relevance feedback documents (top ranked documents). From the tables, we find that RM fails to outperform the LM consistently across two data sets with respect to all evaluation metrics, which shows that RM is not stable for different search environments. By observing the four fusion based expansion models (e.g., combMNZ, Interpolation, QFM1 and QFM2), we find that the retrieval performances are inferior to the baseline model. The weak performances of the RM and RM-based fusion models demonstrate that the traditional retrieval model may be insufficient for session search task and the hidden information need should be taken into account in the retrieval model. Looking at the RM-HS (i.e., the historical interaction based RM model), we find that it can improve the baseline significantly on Session Track 2013 with respect to NDCG@10, but fails to improve the baseline on Session Track 2014. This shows that the traditional relevance feedback model which has been proven effective in ad hoc retrieval tasks cannot handle complex web search scenarios, e.g., session search.
We then use our proposed interference-based expansion model to integrate historical query terms. The evaluation results in Table 3 and Table 4 show that our expansion models (i.e., “-CH" and “-PH" related QQE models) consistently improve the language model and outperform the other non-QQE query expansion models. After adding the clicked snippets in our models (i.e., “-CS" and “-PS" related QQE models), the performance on TREC 2013 becomes better, which shows that introducing more hidden information can improve the session search performance to some extent.

5.4. Study on the Quantum Interference Term

In this section, we focus on studying the influence of quantum interference on retrieval performance. To this end, we control all free parameters other than cos θ to report the performance of QQE models. We only report the analysis results with respect to NDCG@10 in Figure 6, since two evaluation metrics (NDCG and ERR) have a similar sensitivity trend in our experiments. In the figure, cos θ = 0 means no interference, while cos θ > 0 (or cos θ < 0 ) means positive (or negative) interference. The figure shows that the retrieval performance will increase along with the increase of cos θ , which implies that considering positive interference in ranking function can improve the retrieval performance.

6. Conclusions

In this paper, we explore and extend the analogy between Photon Polarization (PP, a typical quantum experiment) and information retrieval (query expansion in particular). The PP inspired Quantum Fusion Model (QFM) only takes into account the input query that can represent the explicit information need. We addressed that, in addition to the explicit information need, the hidden/implicit information need in user’s minds can also influence the relevant judgement. Then, we developed a superposition representation for a document in a two-dimensional (i.e., explicit and implicit) information need space. We analyzed when and why the quantum interference can occur, and postulated the quantum interference if a document is in such a superposed state before the the measurement of the expanded query filter. Based on this postulation, we built a novel Quantum interference based Query Expansion (QQE) model, and implemented this quantum query expansion model in the session search task. Extensive empirical evaluations on Session Tracks 2013 and 2014 showed the effectiveness of the proposed QQE model. Further study on the quantum interference term also demonstrates that introducing quantum interference into the query expansion approach can consistently benefit the retrieval performance in web search scenarios.
In the future, we will further improve the proposed models in the following directions: First, we will investigate different implicit relevance feedback methods for the acquisition of hidden information, e.g., through eye tracking captured words. Second, it is important to model quantum interference to simulate users’ real search process in a principled way. Third, machine learning methods can be introduced into our model to train quantum interference parameters automatically.

Acknowledgments

This work is supported in part by the Chinese National Program on the Key Basic Research Project (973 Program, grant No.2013CB329304, 2014CB744604), the Chinese 863 Program (grant No. 2015AA015403), the Natural Science Foundation of China (grant No. 61272265, 61402324), and the Tianjin Research Program of Application Foundation and Advanced Technology (grant No. 15JCQNJC41700).

Author Contributions

Theoretical study and proof: Peng Zhang, Jingfei Li, Benyou Wang, Xiaozhao Zhao, Dawei Song and Massimo Melucci. Conceived and designed the experiments: Peng Zhang, Benyou Wang and Jingfei Li. Performed the experiments: Peng Zhang and Jingfei Li. Analyzed the data: Peng Zhang, Jingfei Li and Benyou Wang. Wrote the manuscript: Peng Zhang, Jingfei Li, Benyou Wang, Dawei Song, Yuexian Hou and Massimo Melucci. All authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Appendix A.1. Derivation of Quantum Fusion Approach

We now describe how to derive a solution for a d f . Let | φ d = | φ d e , we then have
a d | q + b d | ¬ q = a d e | q e + b d e | ¬ q e .
Suppose
| q e = a q e | q + b q e | ¬ q ,
and
| ¬ q e = - b q e | q + a q e | ¬ q .
Then, Equation (A1) can be rewritten as:
a d | q + b d | ¬ q = a d e ( a q e | q + b q e | ¬ q ) + b d e ( - b q e | q + a q e | ¬ q ) .
It shows that
a d = a d e a q e - b d e b q e ,
b d = a d e b q e + b d e a q e ,
and
a q e = a d a d e + b d b d e ,
b q e = b d a d e - a d b d e .
If we consider the collapse of | φ d to | q after the first-round retrieval, the following equation needs to be solved.
| q = a d f | q e + b d f | ¬ q e .
Based on Equations (A2), (A3) and (A9), we have
| q = a d f ( a q e | q + b q e | ¬ q ) + b d f ( b q e | q - a q e | ¬ q ) ,
| q = ( a d f a q e + b d f b q e ) | q + ( a d f b q e - b d f a q e ) | ¬ q .
Apparently,
a d f a q e + b d f b q e = 1 , a d f b q e - b d f a q e = 0 .
By solving these equations, we get that:
a d f = a q e , b d f = b q e .
Based on the solutions for a q e and a q e in Equations (A7) and (A8), we can get
a d f = a d a d e + b d b d e ,
b d f = b d a d e - a d b d e .
Next, we show an alternative solution for a d f . If we define | ¬ q e in an alternative manner as below, which is also orthonormal to | q e :
| ¬ q e = b q e | q - a q e | ¬ q .
Based on Equations (A1), (A2) and (A15) can be rewritten as:
a d | q + b d | ¬ q = a d e ( a q e | q + b q e | ¬ q ) + b d e ( b q e | q - a q e | ¬ q ) .
It turns out that:
a d = a d e a q e + b d e b q e ,
b d = a d e b q e - b d e a q e ,
and
a q e = a d a d e - b d b d e ,
b q e = b d a d e + a d b d e .
We then obtain the alternative solutions
a d f = a d a d e - b d b d e ,
b d f = b d a d e + a d b d e .

Appendix A.2. Re-Formulation of Quantum Fusion Model’s Solution a d f in Inner-Product Forms

Now, we provide an additional derivation of a d f represented in its inner-product form q e | q . Since { q , ¬ q } is an orthogonal basis, | φ d can be denoted as
| φ d = q | φ d | q + ¬ q | φ d | ¬ q ,
where q | φ d is a d in Equation (1). Using { q e , ¬ q e } as an orthogonal basis, | φ d can be also denoted as
| φ d = q e | φ d | q e + ¬ q e | φ d | ¬ q e ,
where q e | φ d is a d e in Equation (2). Based on Equations (A23) and (A24), we can get
q | φ d | q + ¬ q | φ d | ¬ q = q e | φ d | q e + ¬ q e | φ d | ¬ q e .
We multiply the term q | for the both sides of Equation (A25)
q | φ d = q e | φ d q | q e + ¬ q e | φ d q | ¬ q e .
We can get
q | ¬ q e = q | φ d - q e | φ d q | q e ¬ q e | φ d .
Since { q e , ¬ q e } is an orthogonal basis, we can get
| q | q e | 2 + | q | ¬ q e | 2 = 1 .
Based on Equations (A27) and (A28)
| q | q e | 2 + | q | φ d - q e | φ d q | q e ¬ q e | φ d | 2 = 1 .
Then, we get
| q e | q | 2 - 2 q | φ d q e | φ d q e | q + | q | φ d | 2 - | ¬ q e | φ d | 2 = 0 .
The last two terms can be rewritten as
| q | φ d | 2 - | ¬ q e | φ d | 2 = | q | φ d | 2 - | q | φ d ¬ q e | φ d | 2 + | q | φ d ¬ q e | φ d | 2 - | ¬ q e | φ d | 2 , = | q | φ d | 2 ( 1 - | ¬ q e | φ d | 2 ) - ( 1 - | q | φ d | 2 ) ¬ q e | φ d | 2 , = | q | φ d q e | φ d | 2 - | ¬ q | φ d ¬ q e | φ d | 2 .
Based on Equations (A30) and (A31), we have
| q e | q | 2 - 2 q | φ d q e | φ d q e | q + | q | φ d q e | φ d | 2 - | ¬ q | φ d ¬ q e | φ d | 2 = 0 .
It then yields
( q e | q - q | φ d q e | φ d + ¬ q | φ d ¬ q e | φ d ) ( q e | q - q | φ d q e | φ d - ¬ q | φ d ¬ q e | φ d ) = 0 .
After solving the above equation, we have the solutions of q e | q
q e | q 1 = q | φ d q e | φ d + ¬ q | φ d ¬ q e | φ d , o r q e | q 2 = q | φ d q e | φ d - ¬ q | φ d ¬ q e | φ d .
We can define the angle between | φ d and | q as α , and the angle between | φ d and | q e as β. Thus, the inner product between | φ d and | q is cos α , which means q | φ d = cos α . We can also get ¬ q | φ d = cos ( Π 2 - α ) = sin α . Similarly, q e | φ d = cos β , ¬ q e | φ d = sin β . The two solutions in the above equation be rewritten as
q e | q 1 = cos α cos β + sin α sin β = cos ( α - β ) , o r q e | q 2 = cos α cos β - sin α sin β = cos ( α + β ) .
In the above equations, α - β and α + β are the angles between | q and | q e in two cases, respectively, leading to a fact that q e | q (i.e., the quantum fusion model’s solution a d f ) can be considered as a constant for | φ d of each document d.

References

  1. Van Rijsbergen, C.J. The Geometry of Information Retrieval; Cambridge University Press: New York, NY, USA, 2004. [Google Scholar]
  2. Piwowarski, B.; Frommholz, I.; Lalmas, M.; van Rijsbergen, C.J. What can Quantum Theory Bring to Information Retrieval. In Proceedings of the CIKM 2010, Toronto, ON, Canada, 26–30 October 2010; pp. 59–68.
  3. Zhao, X.; Zhang, P.; Song, D.; Hou, Y. A Novel Re-ranking Approach Inspired by Quantum Measurement. In Proceedings of the ECIR 2011, Dublin, Ireland, 18–21 April 2011; pp. 721–724.
  4. Sordoni, A.; Nie, J.Y.; Bengio, Y. Modeling term dependencies with quantum language models for IR. In Proceedings of the SIGIR 2013, Dublin, Ireland, 28 July–1August 2013; pp. 653–662.
  5. Melucci, M. A basis for information retrieval in context. ACM Trans. Inf. Syst. 2008, 26. [Google Scholar] [CrossRef]
  6. Zuccon, G.; Azzopardi, L. Using the Quantum Probability Ranking Principle to Rank Interdependent Documents. In Proceedings of the ECIR 2010, Milton Keynes, UK, 28–31 March 2010; pp. 357–369.
  7. Zhang, P.; Song, D.; Zhao, X.; Hou, Y. Investigating Query-Drift Problem from a Novel Perspective of Photon Polarization. In Proceedings of the ICTIR 2011, Bertinoro, Italy, 12–14 September 2011; pp. 332–336.
  8. Rieffel, E.G.; Polak, W. An introduction to quantum computing for non-physicists. ACM Comput. Surveys 2000, 32, 300–335. [Google Scholar] [CrossRef]
  9. Feynman, R.; Leighton, R.; Sands, M. The Feynman Lectures on Physics: Quantum Mechanics; Addison-Wesley: Boston, MA, USA, 1965. [Google Scholar]
  10. Monroe, C.; Meekhof, D.M.; King, B.E.; Wineland, D.J. A “Schrödinger Cat” Superposition State of an Atom. Science 1996, 272, 1131–1136. [Google Scholar] [CrossRef] [PubMed]
  11. Text REtrieval Conference. Available online: http://trec.nist.gov/ (accessed on 12 April 2016).
  12. Clueweb12. Available online: http://lemurproject.org/clueweb12/ (accessed on 12 April 2016).
  13. Gleason, A.M. Measures on the closed subspaces of a Hilbert space. J. Math. Mech. 1957, 6, 885–893. [Google Scholar] [CrossRef]
  14. Song, D.; Lalmas, M.; van Rijsbergen, C.J.; Frommholz, I.; Piwowarski, B.; Wang, J.; Zhang, P.; Zuccon, G.; Bruza, P.D.; Arafat, S.; et al. How Quantum Theory is Developing the Field of Information Retrieval. In Proceedings of AAAI Fall Symposium 2010, Arlington, VA, USA, 11–13 November 2010; pp. 105–108.
  15. Melucci, M. Introduction to Information Retrieval and Quantum Mechanics; Springer: Berlin, Germany, 2015; Volume 35. [Google Scholar]
  16. Costa, A.; Buccio, E.D.; Melucci, M. A Document Retrieval Model Based on Digital Signal Filtering. ACM Trans. Inf. Syst. 2015, 34. [Google Scholar] [CrossRef]
  17. Busemeyer, J.R.; Wang, Z.; Lambert-Mogiliansky, A. Empirical comparison of Markov and quantum models of decision making. J. Math. Psychol. 2009, 53, 423–433. [Google Scholar] [CrossRef]
  18. Busemeyer, J.; Bruza, P.D. Quantum Models of Cognition and Decision; Cambridge University Press: Cambridge, UK, 2012. [Google Scholar]
  19. Bruza, P.D.; Wang, Z.; Busemeyer, J.R. Quantum cognition: A new theoretical approach to psychology. Trends Cognit. Sci. 2015, 19, 383–393. [Google Scholar] [CrossRef] [PubMed]
  20. Khrennivov, A. Classical and quantum mechanics on information spaces with applications to cognitive, psychological, social, and anomalous phenomena. Found. Phys. 1999, 29, 1065–1098. [Google Scholar] [CrossRef]
  21. Khrennikov, A. On quantum-like probabilistic structure of mental information. Open Syst. Inf. Dyn. 2004, 11, 267–275. [Google Scholar] [CrossRef]
  22. Khrennikov, A.Y. Information Dynamics in Cognitive, Psychological, Social, and Anomalous Phenomena; Springer: Dordrecht, The Netherlands, 2013; Volume 138. [Google Scholar]
  23. Khrennikov, A.Y. Ubiquitous Quantum Structure; Springer: Berlin, Germany, 2014. [Google Scholar]
  24. Haven, E.; Khrennikov, A. Quantum Social Science; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
  25. Conte, E.; Khrennikov, A.; Todarello, O.; Federici, A.; Zbilut, J.P. On the Existence of Quantum Wave Function and Quantum Interference Effects in Mental States: An Experimental Confirmation during Perception and Cognition in Humans. 2008; arXiv:0807.4547. [Google Scholar]
  26. Conte, E. On the Possibility that we think in a Quantum Probabilistic Manner. NeuroQuantology 2010, 8, S3–S47. [Google Scholar] [CrossRef]
  27. Zhang, P.; Song, D.; Hou, Y.; Wang, J.; Bruza, P. Automata Modeling for Cognitive Interference in Users’ Relevance Judgment. In Proceedings of the AAAI-QI 2010, Washington, DC, USA, 11–13 November 2010; pp. 125–133.
  28. Guan, D.; Zhang, S.; Yang, H. Utilizing query change for session search. In Proceedings of the SIGIR 2013, Dublin, Ireland, 28 July–1 August 2013; pp. 453–462.
  29. Zhang, S.; Guan, D.; Yang, H. Query change as relevance feedback in session search. In Proceedings of the SIGIR 2013, Dublin, Ireland, 28 July–1 August 2013; pp. 821–824.
  30. Luo, J.; Zhang, S.; Yang, H. Win-win search: Dual-agent stochastic game in session search. In Proceedings of the SIGIR 2014, Gold Coast, Australia, 6–11 July 2014; pp. 587–596.
  31. Zhang, S.; Luo, J.; Yang, H. A POMDP model for content-free document re-ranking. In Proceedings of the SIGIR 2014, Gold Coast, Australia, 6–11 July 2014; pp. 1139–1142.
  32. Lavrenko, V.; Croft, W.B. Relevance-Based Language Models. In Proceedings of the SIGIR 2001, New Orleans, LA, USA, 9–12 September 2001; pp. 120–127.
  33. Zighelnic, L.; Kurland, O. Query-drift prevention for robust query expansion. In Proceedings of the SIGIR 2008, Singapore, Singapore, 20–24 July 2008; pp. 825–826.
  34. Zhang, P.; Song, D.; Wang, J.; Zhao, X.; Hou, Y. On modeling rank-independent risk in estimating probability of relevance. In Proceedings of the AIRS 2011, Dubai, United Arab Emirates, 18–20 December 2011; pp. 13–24.
  35. Sordoni, A.; Nie, J.Y. Looking at Vector Space and Language Models for IR Using Density Matrices. In Proceedings of the Quantum Interaction 2014, Leicester, UK, 25–27 July 2013; pp. 147–159.
  36. Indri toolkit. Available online: http://sourceforge.net/p/lemur/wiki/Indri/ (accessed on 12 April 2016).
  37. Zhai, C.; Lafferty, J.D. Model-based Feedback in the Language Modeling Approach to Information Retrieval. In Proceedings of the CIKM 2001, McLean, VA, USA, 6–11 November 2000; pp. 403–410.
  38. Burges, C.; Shaked, T.; Renshaw, E.; Lazier, A.; Deeds, M.; Hamilton, N.; Hullender, G. Learning to Rank Using Gradient Descent. In Proceedings of ICML 2005, New York, NY, USA; 2005; pp. 89–96. [Google Scholar]
  39. Chapelle, O.; Metlzer, D.; Zhang, Y.; Grinspan, P. Expected reciprocal rank for graded relevance. In Proceedings of the CIKM 2009, Hong Kong, China, 2–6 November 2009; pp. 621–630.
Figure 1. Correspondence between Information Retrieval and Photon Polarization.
Figure 1. Correspondence between Information Retrieval and Photon Polarization.
Entropy 18 00146 g001
Figure 2. Analogy of photon polarization in the document ranking scenario where document collections can be considered as photon sources, and the relevance measurement of documents by a given query can be regarded as the photon polarization filtering.
Figure 2. Analogy of photon polarization in the document ranking scenario where document collections can be considered as photon sources, and the relevance measurement of documents by a given query can be regarded as the photon polarization filtering.
Entropy 18 00146 g002
Figure 3. Analogy of photon polarization in query expansion. An additional polarization filter corresponding to the expanded query is inserted between the screen and original filter for the original query.
Figure 3. Analogy of photon polarization in query expansion. An additional polarization filter corresponding to the expanded query is inserted between the screen and original filter for the original query.
Entropy 18 00146 g003
Figure 4. (a) First measurement by current query | q c , (b) First measurement by hidden query | q h . Known Paths φ d q c q e (in subfigure (a)) and φ d q h q e (in subfigure (b)) for documents as photons that pass the measurement filters. In each certain condition, the quantum interference can not occur.
Figure 4. (a) First measurement by current query | q c , (b) First measurement by hidden query | q h . Known Paths φ d q c q e (in subfigure (a)) and φ d q h q e (in subfigure (b)) for documents as photons that pass the measurement filters. In each certain condition, the quantum interference can not occur.
Entropy 18 00146 g004
Figure 5. Unknown path (be φ d q c q e and φ d q h q e simultaneously) for documents as photons that pass the measurement filter. In such uncertain cases entailed by the superposition state, the quantum interference can possibly occur.
Figure 5. Unknown path (be φ d q c q e and φ d q h q e simultaneously) for documents as photons that pass the measurement filter. In such uncertain cases entailed by the superposition state, the quantum interference can possibly occur.
Entropy 18 00146 g005
Figure 6. The effect of quantum interference term by observing the sensitivity of cos θ on (a) TREC 2013 and (b) TREC 2014.
Figure 6. The effect of quantum interference term by observing the sensitivity of cos θ on (a) TREC 2013 and (b) TREC 2014.
Entropy 18 00146 g006
Table 1. Summary of all tested models.
Table 1. Summary of all tested models.
ModelRank Score for Each Document d
LM e x p { - K L ( θ q c , θ d ) }
RM e x p { - K L ( θ q e , θ d ) }
RM-HS e x p { - K L ( θ h s , θ d ) }
combMNZ ( δ q ( d ) + δ q e ( d ) ) · ( δ q ( d ) | a d | 2 + δ q e ( d ) | a d e | 2 )
interpolation λ δ q ( q ) | a d | 2 + ( 1 - λ ) δ q e ( d ) | a d e | 2
QFM1 ( δ q ( d ) | a d | 2 ) · ( δ q e ( d ) | a d e | 2 )
QFM2 ( δ q ( d ) | a d | 2 ) · ( δ q e ( d ) | a d e | 2 ) 1 / η
QQE | a d | 2 · s 1 + | b d | 2 · s 2 + 2 | a d | · | b d | s 1 · s 2 cos θ
Table 2. Parameter settings.
Table 2. Parameter settings.
ModelParameters for TREC 2013Parameters for TREC 2014
LM--
RM f b D o c = 10 , f b T e r m = 50 f b D o c = 10 , f b T e r m = 50
RM-HS f b T e r m = 50 , λ = 0 . 7 f b T e r m = 50 , λ = 0 . 7
combMNZ--
interpolation λ = 0 . 7 λ = 0 . 9
QFM1--
QFM2 η = 8 . 1 η = 8 . 1
QQE-CH cos θ = 0 . 25 cos θ = 0 . 25
QQE-CS cos θ = 0 . 25 cos θ = 0 . 25
QQE-PH s 1 = 0 . 13 , cos θ = 0 . 25 s 1 = 0 . 13 , cos θ = 0 . 25
QQE-PS s 1 = 0 . 19 , cos θ = 0 . 25 s 1 = 0 . 19 , cos θ = 0 . 25
Table 3. Evaluation results on Session Track 2013. Significance test has been conducted for all expansion models compared with LM with paired t-test. Symbol ‡ means p < 0 . 01 , † means p < 0 . 05 , and boldface means the best performance.
Table 3. Evaluation results on Session Track 2013. Significance test has been conducted for all expansion models compared with LM with paired t-test. Symbol ‡ means p < 0 . 01 , † means p < 0 . 05 , and boldface means the best performance.
ModelsNDCG@10NDCG@100ERR@10ERR@100
LM0.0552(0.00%)0.0579(0.00%)0.0285(0.00%)0.0356(0.00%)
RM0.0366(-34.00%)0.0581(0.35%)0.0125(-56.00%)0.0190(-46.63%)
RM-HS0.0600(9.00%†)0.0592(2.25%)0.0280(-2.00%)0.0349(-1.97%)
combMNZ0.0514(-7.00%)0.0546(-5.70%)0.0263(-8.00%)0.0334(-6.18%)
Interpolation0.0497(-10.00%)0.0566(-2.25%)0.0250(-12.00%)0.0352(-1.12%)
QFM10.0506(-8.00%)0.0534(-7.77%)0.0254(-11.00%)0.0325(-8.71%)
QFM20.0523(-5.00%)0.0571(-1.38%)0.0275(-4.00%)0.0349(-1.97%)
QQE-CH0.0741(34.00% ‡)0.0695(20.03% ‡)0.0374(31.00% ‡)0.0453(27.25% ‡)
QQE-CS0.0921(67.00% ‡)0.0741(27.98% ‡)0.0564(98.00% ‡)0.0636(78.65% ‡)
QQE-PH0.0859(56.00% ‡)0.0875(51.12% ‡)0.0439(54.00% ‡)0.0515(44.66% ‡)
QQE-PS0.1120(103.00% ‡)0.0991(71.16% ‡)0.0689(142.00% ‡)0.0808(126.97% ‡)
Table 4. Evaluation results on Session Track 2014. Significance test has been conducted for all expansion models compared with LM with paired t-test. Symbol ‡ means p < 0 . 01 , † means p < 0 . 05 , and boldface means the best performance.
Table 4. Evaluation results on Session Track 2014. Significance test has been conducted for all expansion models compared with LM with paired t-test. Symbol ‡ means p < 0 . 01 , † means p < 0 . 05 , and boldface means the best performance.
ModelsNDCG@10NDCG@100ERR@10ERR@100
LM0.1445 (0.00%)0.1185(0.00%)0.0846 (0.00%)0.0951(0.00%)
RM0.1073 (-26.00%)0.1699(43.38%)0.0501 (-41.00%)0.0717(-24.61%)
RM-HS0.1393 (-4.00%)0.1105(-6.75%)0.0844 (0.00%)0.0946(-0.53%)
combMNZ0.1421 (-2.00%)0.1163(-1.86%)0.0821 (-3.00%)0.0928(-2.42%)
Interpolation0.1427 (-1.00%)0.1173(-1.01%)0.0826 (-2.00%)0.0934(-1.79%)
QFM10.1415 (-2.00%)0.1151(-2.87%)0.0804 (-5.00%)0.0914(-3.89%)
QFM20.1427 (-1.00%)0.1175(-0.84%)0.0830 (-2.00%)0.0937(-1.47%)
QQE-CH0.1625 (12.00%†)0.1292(9.03%†)0.0939 (11.00%†)0.1043(9.67%†)
QQE-CS0.1630 (13.00%†)0.1234(4.14%)0.0940 (11.00%†)0.1043(9.67%†)
QQE-PH0.1824 (26.00% ‡)0.1824(53.92% ‡)0.0972 (15.00%†)0.1105(16.19%†)
QQE-PS0.1527 (6.00%†)0.1516(27.93% ‡)0.0739 (-13.00%)0.0866(-8.94%)

Share and Cite

MDPI and ACS Style

Zhang, P.; Li, J.; Wang, B.; Zhao, X.; Song, D.; Hou, Y.; Melucci, M. A Quantum Query Expansion Approach for Session Search. Entropy 2016, 18, 146. https://doi.org/10.3390/e18040146

AMA Style

Zhang P, Li J, Wang B, Zhao X, Song D, Hou Y, Melucci M. A Quantum Query Expansion Approach for Session Search. Entropy. 2016; 18(4):146. https://doi.org/10.3390/e18040146

Chicago/Turabian Style

Zhang, Peng, Jingfei Li, Benyou Wang, Xiaozhao Zhao, Dawei Song, Yuexian Hou, and Massimo Melucci. 2016. "A Quantum Query Expansion Approach for Session Search" Entropy 18, no. 4: 146. https://doi.org/10.3390/e18040146

APA Style

Zhang, P., Li, J., Wang, B., Zhao, X., Song, D., Hou, Y., & Melucci, M. (2016). A Quantum Query Expansion Approach for Session Search. Entropy, 18(4), 146. https://doi.org/10.3390/e18040146

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop