<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>FDIA</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Probabilistic Modeling of Vague Conditions in Interactive Product Search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alfred Sliwa</string-name>
          <email>sliwa@is.inf.uni-due.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Duisburg-Essen</institution>
          ,
          <addr-line>Duisburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <volume>17</volume>
      <fpage>17</fpage>
      <lpage>18</lpage>
      <abstract>
        <p>Today's e-commerce platforms provide a huge amount of products attached with a rich set of properties. Modern online shops support users in the product search process by o ering facet retrieval, i.e., limiting search results by using several lters. However, many systems support retrieval of items ful lling Boolean conditions so that only exact matching leads to the inclusion in the result list. On the other side, users often have vague conditions in mind, e.g, "high resolution laptop\, and cannot describe their information need precisely. Users are forced to specify crisp conditions to get any results but this leads to the problem that only a few items are returned by the system. Often, there exist other products that closely satisfy the user's information need. In this work, we present the obvious search problems with vague conditions and potential research questions w.r.t product search. We argue that leveraging probabilistic modeling techniques and especially user-driven UI development can optimize the overall retrieval quality.</p>
      </abstract>
      <kwd-group>
        <kwd>Product Search</kwd>
        <kwd>Interactive IR</kwd>
        <kwd>Probabilistic IR</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>One important application in Information Retrieval (IR) is product search on
ecommerce platforms. In recent years online shopping gained more popularity and
the online retail worldwide increased rapidly1. This shows that online shopping
plays a signi cant role in today's goods acquisition and overtakes traditional
shopping services.</p>
      <p>Users frequently use online-shops either for known item search or for search
based on product properties description. While the former one delivers
satisfactory results, the latter often yields insu cient answer sets. This problem occurs
especially in case of vague search conditions which cannot be handled by
existing systems. For example, someone is searching for a "powerful and lightweight
laptop with a long battery runtime for less than $800\. For such query examples,
many IR systems o er full-text search, which is based on lexical comparisons and
ignore the query semantics. Phrases like \long battery runtime" would hardly
lead to appropriate result items and the asking price would be interpreted as a
search for the number 800 in the product description. Faceted lters are provided
to assist the user in the search process by restricting search results according to
speci c conditions, e.g., price or display size, price value range. But in this way
the user is forced to concrete her information need and to enter crisp conditions
for facet lters. In some cases this is di cult; for example when a user searches for
\lightweight laptops", one has to determine the threshold for \lightweight". For
some product properties there are no lters available, e.g., \powerful laptops".
Another issue occurs when some criteria are in con ict with each other, e.g.,
"powerful\ vs. "cheap\. By default the query conditions are strictly interpreted
and must all be ful lled like in Boolean retrieval systems. These systems reach
their limits when the query becomes more complex and results in phenomena
like the empty answer problem. Users have to re-formulate the query by relaxing
certain conditions. But instead of this heavy-going re-formulation process, the
system could help the user, if query conditions were understood as vague, and a
discrimination between relevant and less-relevant criteria would be possible. In
the interest of the user, it could be useful to retrieve laptops that slightly miss
the query conditions. By incorporating user's query constraints, i.e., conditions
that must be met, and query preferences, i.e., optional and less-relevant
conditions, the IR system can distinguish among the di erent criteria and return
more potentially relevant items.</p>
      <p>The focus of our research lies in developing interactive IR methods that are
capable of nding objects that also closely match the query conditions in the
use case of product search. The concept of vagueness will be investigated with
regard to text and fact conditions. We are working on the implementation of a
search engine that addresses the challenges in the aforementioned problems.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Background and Related</title>
    </sec>
    <sec id="sec-3">
      <title>Work</title>
      <p>
        Probabilistic IR models are based on the probabilistic ranking principle (PRP)
claiming that documents should be ranked according to their probabilistic
relevance w.r.t. query [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The treatment of vague queries considered probabilistic
modeling approaches [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] probabilistic models are used to integrate text
and fact retrieval where both text and fact conditions are treated similarly and
vague but separately. Probabilistic indexing weights are computed for each query
condition w.r.t. an object in order to compute a nal retrieval score. There are
systems that try to handle vague queries in databases; for instance [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] proposes
the usage of the vector space model to compare the distance between a vague
query and database objects. Fuzzy logic has also been investigated in the
context of vague queries and imprecise data in databases [
        <xref ref-type="bibr" rid="ref12 ref8">8, 12</xref>
        ]. While fuzzy logic
{ a generalization of Boolean logic { aims to compute a value similar to object's
relevance degree w.r.t. a query, probabilistic logic estimates the probability of
an object being relevant to a query. One advantage of the latter approach, is
that it is able to incorporate empirical data from an application for improving
system performance.
      </p>
      <p>
        In the recent past, a quantum logic based approach (QQL) was introduced
by [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] explaining how query results returned by such a retrieval system could
be interpreted as probability relevance scores. The basic idea is the usage of a
vector space model from quantum mechanics and logic. Query and data objects
are regarded as elements of this vector space model. The cosine similarity
between query space vector and object vector is used to compute the probabilistic
relevance score of the data object w.r.t query. Based on this theoretical
quantum model [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] developed a calculus query language (CQQL) which enhances the
query language by the treatment of similar predicates and query weighting. In
CQQL uncertain results occur due to vague query formulations while the queried
objects are regarded as certain.
3
      </p>
    </sec>
    <sec id="sec-4">
      <title>Research Questions</title>
      <p>In the following we describe the challenges and research questions according to
vague text and fact conditions in product search by using the laptop purchase
as on-going example.</p>
      <sec id="sec-4-1">
        <title>Vague IR System</title>
        <p>Vague Fact Conditions A vague query fact condition describes the extent
of ful llment according to an attribute value of one laptop. Instead of binary
weights, the associated score is probabilistic and ranges from 0 to 1. There are
di erent types of vague fact conditions to distinguish:
{ Value Equality refers to a concrete value of an attribute, e.g., "display size
= 14 inch\
{ Threshold refers to a concrete value of an attribute which should not be
below or above, e.g., "price &lt; $500\
{ Tendency refers to a preference direction, e.g., "lightweight\</p>
        <p>Attributes can have di erent scales, e.g., nominal, ordinal or metric.
Depending on the vague fact condition type and the attribute scale, di erent approaches
have to be investigated for computing a respective vagueness score. For our use
case vague fact conditions can be applied to all technical product properties,
e.g., CPU, memory, hard drive, display size, battery runtime, color, operating
system, etc., as well as to the product price. Another obstacle is to nd laptops
that most closely meet all technical requirements, but for the lowest price. For
each laptop an overall probabilistic relevance score w.r.t. the user query
conditions can be computed. In this way, the result list includes also items with
relative high probabilistic scores and not only items perfectly tting to the user
query.</p>
        <p>
          Vague Text Conditions One problem in full-text search arises with
mismatching vocabularies between query and document. The same concepts can be
described by di erent words and language styles, thus making the matching
procedure more complicated. When a user searches for \high performance laptops",
matching on the lexical level would fail in case of laptops containing synonyms
of the query phrase like \high quality notebooks" or \powerful computers".
Instead of matching both sides by word-by-word comparisons which is prevalent in
many search engines, we aim to develop a semantic approach capable in
measuring the similarity between query and document. Previous work [
          <xref ref-type="bibr" rid="ref1 ref4">1, 4</xref>
          ] proposed
unsupervised methods like latent semantic analysis (LSA) to map query and
document texts to low-dimensional semantic vector space in order to combat
the drawbacks of lexical matching methods. Current state-of-the art systems [
          <xref ref-type="bibr" rid="ref11 ref5">5,
11</xref>
          ] aim to improve the system performance by incorporating clickthrough data
to di erentiate relevant documents from non-relevant ones and so representing a
weakly-supervised approach. Furthermore, the utility of word hashing allows
effective handling of large vocabularies by reducing the bag of word (BoW) vector
space dimensionality.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Weighting and Ranking</title>
        <p>Faceted retrieval conjunctively combines query conditions speci ed by the user.
In order to receive any results, users often specify conditions carefully, otherwise
the description of the optimal result would yield an empty result list. An
alternative solution would be to introduce optional query conditions. It should be
possible to weigh selected query criteria di erently. Especially for binary laptop
attributes it would be important to allow for optional condition selection.
Moreover, the relative importance among single conditions enables a better treatment
of con icting criteria, e.g., price vs. performance. As search queries are extended
by vague text and fact conditions, it is important to develop ranking functions
which take vagueness as well as explicit user weighting into account.</p>
        <p>The association between vagueness and weighting can be explained by an easy
example. A user searches for a laptop with 16 00 display size and a SSD with 256
GB for a low price. If the user prioritizes the price over technical requirements,
then the top ranked laptop in the result list could be a laptop with only 15 00
display size and a SSD in the desired size for $750. A laptop ful lling all technical
criteria but being $100 more expensive would be ranked on the second position.
Only due to the query expansion by the vague fact condition w.r.t. display size,
the user receives the rst result.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Text to Fact Condition Mapping</title>
        <p>Some phrases in the user query refer to property values of one laptop, e.g., "high
performance notebook\ refers to the attribute CPU speed. Nowadays, many
IR systems do not di erentiate text from fact conditions and treat the previous
example query phrases as text conditions, i.e., the system retrieves only products
that contain these terms in the product title or description. But a mapping from
text to fact conditions is not performed.</p>
        <p>One possible solution to this problem is based on the analysis of query logs.
Frequent phrases can be detected and mapped to their respective vague fact
condition, e.g., "cheap\ ! "low price\. Another approach is to measure the
correlation between phrases in laptop descriptions or titles with attribute values,
i.e., generate rules by regarding the association of a term-attribute pair. The nal
performance of the transformation rules will be evaluated in real search sessions
by leveraging user's implicit feedback.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Transparent Result Set Visualization</title>
        <p>Another interesting research topic is result set visualization. One challenging
task is the determination of the ordering of result objects including the
snippet and overview information. Furthermore, the user should be able to interpret
and understand the results returned by the system. Hence, it is necessary to
implement a "White-Box\ system that contains for each result item additional
information about which query conditions are met and which not. The
transparent result set visualization could help the user in her decision-making process.
Additionally, it is useful to investigate on alternative result list representations
where the user can easily read and compare con icting conditions, e.g., "low
price vs. high performance\, and to select a reasonable trade-o . The
interaction with the result list enables the collection of implicit feedback, e.g., relevance
feedback by accepting and denying laptops. If a user accepts one laptop, the
corresponding attribute values contribute to adjusting parameters of the vagueness
and ranking methods.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Experimental Setting</title>
        <p>
          As experimental data we crawled more than 20,000 laptops from the Amazon
platform. On the one hand, we can use this dataset to model di erent vagueness
functions by utilizing probabilistic logic like proposed in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. One the other hand,
it can be used to compare the performance of di erent systems, i.e., vague system
vs. boolean system. A useful evaluation experiment could be a user study where
participants should solve a task with one of the two systems and judge the
interaction process afterwards.
        </p>
        <p>The development of the UI considers user interaction. We want to investigate
how a user can a ect the parameters of the di erent concepts, e.g., vagueness
and weighting functions of fact conditions or term selection for query expansion
for treatment of vague text conditions. This user feedback is relevant to judge
the quality of the internal functions.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Deerwester</surname>
          </string-name>
          ,
          <string-name>
            <surname>Scott</surname>
          </string-name>
          , et al.
          <article-title>"Indexing by latent semantic analysis</article-title>
          .
          <source>" Journal of the American society for information science 41</source>
          .6 (
          <year>1990</year>
          ):
          <fpage>391</fpage>
          -
          <lpage>407</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Fuhr</surname>
          </string-name>
          , Norbert.
          <article-title>"A probabilistic framework for vague queries and imprecise information in databases</article-title>
          .
          <source>" Proceedings of the 16th International Conference on Very Large Databases</source>
          . Morgan Kaufman, Los Altos, California,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Fuhr</surname>
          </string-name>
          , Norbert.
          <article-title>"Integration of probabilistic fact and text retrieval." Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval</article-title>
          .
          <source>ACM</source>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hofmann</surname>
          </string-name>
          , Thomas.
          <article-title>"Probabilistic latent semantic indexing." ACM SIGIR Forum</article-title>
          . Vol.
          <volume>51</volume>
          . No.
          <article-title>2</article-title>
          . ACM,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Po-Sen</surname>
          </string-name>
          , et al.
          <article-title>"Learning deep structured semantic models for web search using clickthrough data."</article-title>
          <source>Proceedings of the 22nd ACM international conference on Information &amp; Knowledge Management. ACM</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lehrack</surname>
            , Sebastian,
            <given-names>Ingo</given-names>
          </string-name>
          <string-name>
            <surname>Schmitt</surname>
            , and
            <given-names>Sascha</given-names>
          </string-name>
          <string-name>
            <surname>Saretz</surname>
          </string-name>
          .
          <article-title>"CQQL: A Quantum LogicBased Extension of the Relation Domain Calculus."</article-title>
          <source>Proceedings of the International Workshop Logic in Databases (LID09)</source>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Motro</surname>
          </string-name>
          , Amihai.
          <article-title>"VAGUE: A user interface to relational databases that permits vague queries</article-title>
          .
          <source>" ACM Transactions on Information Systems (TOIS) 6</source>
          .3 (
          <year>1988</year>
          ):
          <fpage>187</fpage>
          -
          <lpage>214</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Prade, Henri, and
          <string-name>
            <given-names>Claudette</given-names>
            <surname>Testemale</surname>
          </string-name>
          .
          <article-title>"Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries."</article-title>
          <source>Information sciences 34.2</source>
          (
          <year>1984</year>
          ):
          <fpage>115</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Robertson</surname>
            ,
            <given-names>Stephen E. "</given-names>
          </string-name>
          <article-title>The probability ranking principle in IR."</article-title>
          <source>Journal of documentation 33.4</source>
          (
          <year>1977</year>
          ):
          <fpage>294</fpage>
          -
          <lpage>304</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Schmitt</surname>
          </string-name>
          , Ingo.
          <article-title>"Qql: A db&amp;ir query language."</article-title>
          <source>The VLDB JournalThe International Journal on Very Large Data Bases 17.1</source>
          (
          <year>2008</year>
          ):
          <fpage>39</fpage>
          -
          <lpage>56</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <surname>Yelong</surname>
          </string-name>
          , et al.
          <article-title>"A latent semantic model with convolutional-pooling structure for information retrieval</article-title>
          .
          <source>" Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management. ACM</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Zemankova</surname>
            , Maria, and
            <given-names>Abraham</given-names>
          </string-name>
          <string-name>
            <surname>Kandel</surname>
          </string-name>
          .
          <article-title>"Implementing imprecision in information systems."</article-title>
          <source>Information Sciences 37</source>
          .
          <fpage>1</fpage>
          -
          <lpage>3</lpage>
          (
          <year>1985</year>
          ):
          <fpage>107</fpage>
          -
          <lpage>141</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>