<!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 />
    <article-meta>
      <title-group>
        <article-title>SE-PQA: StackExchange Personalized Community Question Answering⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pranav Kasela</string-name>
          <email>P@1</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Braga</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gabriella Pasi</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rafele Perego</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ISTI-CNR</institution>
          ,
          <addr-line>Pisa</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Politecnico di Torino, Dipartimento di Automatica e Informatica DAUIN, Corso Duca degli Abruzzi</institution>
          ,
          <addr-line>Torino</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Università degli Studi di Milano-Bicocca</institution>
          ,
          <addr-line>Milano</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Personalization in Information Retrieval (IR) is a topic studied by the research community since a long time. Nevertheless, the availability of high-quality, real-world datasets for large-scale experiments and model evaluation remains limited. This paper helps to fill this gap by introducing SE-PQA (StackExchange - Personalized Question Answering), a new curated dataset designed for the development and evaluation of personalized models in the domain of community Question Answering (cQA). SE-PQA encompasses over one million queries and two million answers, annotated with a rich set of features that capture the social interactions among users on a cQA platform. We provide reproducible baseline methods for the cQA task based on the resource, including deep learning and personalized approaches. The results of the preliminary experiments conducted show the appropriateness of SE-PQA to train efective cQA models; they also show that personalization remarkably improves the efectiveness of all the methods tested.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Question Answering</kwd>
        <kwd>User Model</kwd>
        <kwd>Personalization</kwd>
        <kwd>Resource</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The problem of Personalization in Information Retrieval (IR) has been explored by the research
community since a long time [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5 ref6 ref7">2, 3, 4, 5, 6, 7</xref>
        ]. Personalized search tries to tailor search results to individual
users or groups based on their interests and online behaviour. One of the biggest issues in the training
of Personalized neural models is the lack of large-scale, publicly available datasets that include detailed
user-related information. Common datasets, like the AOL query log [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], the Yandex query log and the
CIKM Cup 2016 dataset are frequently used, even if they come with privacy concerns and limitations due
to anonymization. Our proposed research SE-PQA (StackExchange - Personalized Question Answering)
is specifically designed to develop and assess personalized models in community Question Answering
(cQA) task. SE-PQA is based on StackExchange, a cQA platform encompassing 178 open forums. The
dataset, derived from a publicly available dump of user-contributed content under a cc-by-sa 4.0 licence,
includes around one million questions and two million answers, annotated with features that reflect
user interactions. These features include vote counts, view numbers, favourite selections, topic tags,
and user comments. Additionally, we provide comprehensive user profiles linked to their historical
questions and answers, social biographies, reputation scores, and view counts. In this study, we adapt
the cQA task to an ad-hoc retrieval scenario, wherein the question is treated as a query, and the answers
are retrieved from a pool of indexed past answers. In this setup, the objective is to retrieve a ranked
set of documents containing the most appropriate answers to the user’s query. The dataset is shared
according to the conditions detailed in the included license agreement1. The code to create the dataset
and reprodcue the baselines is publicly available 2.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. The Proposed Resource</title>
      <p>
        Data from StackExchange has been utilized in the training of language models for sentence similarity [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
However, to the best of our knowledge, the application of StackExchange for Question and Answer
(Q&amp;A) tasks has been limited to the selection of similar sentence training pairs, without using user
or social features for personalized information retrieval tasks. With SE-PQA, we address previous
limitations by ofering a comprehensive, curated dataset comprising textual questions and answers from
diverse, heterogeneous forums. In SE-PQA, a user can belong to multiple communities: for instance,
by considering users who have contributed at least five documents (either questions or answers), we
observe that out of the resulting 62,000 users, only 37% contributed to just a single community and,
for example, 28% wrote documents in more than three communities. To enhance diversity, SE-PQA
integrates data from multiple networks that fall under the broad category of humanistic communities.
These communities, while focusing on diferent topics, utilize language that is not excessively varied
among them. The dataset comprises a total of 1,125,407 questions, of which 1,001,706 (89%) have at least
one answer. The training, validation, and test splits are performed temporally to prevent data leakage.
      </p>
      <p>We infer the relevance of an answer to a question based on the number of up-votes it receives
from community members. For experiments involving personalized cQA models, we consider only
the single answer explicitly labelled as the best answer by the user who submitted the question as
relevant. Using this information, we define two versions of the dataset: the base version, where we
consider all answers with a positive score as relevant for a question, and the personalized (pers) version,
which considers only the single answer selected by the user as the best answer as relevant for both the
user and the question. A variety of user-generated information from the training set can be utilized in
the personalization phase. For each question, we include all prior user posts to prevent data leakage
during the training. However, user data is not limited to these documents: it also encompasses social
interactions between users, tags assigned by users to previous questions along with their meanings,
and badges earned by users. Additionally, the dataset contains biographic text (about me) introducing
each user, a comprehensive set of numeric features (e.g., user reputation score, number of up-votes and
down-votes for each post, number of views), and temporal information (e.g., user creation date, last
access date, post creation timestamp).</p>
      <p>Comparison with available datasets. In Table 1 we summarize the basic statistics of the main
datasets used in the literature for personalized IR tasks. The AOL query log, released in 2006, remains a
widely used resource despite privacy concerns, containing around 20 million web queries from over
657,000 users. However, the dataset’s limitation lies in representing web pages solely by their URLs
without text content. To address this, researchers have used a 2017 version that includes scraped text
content, though this approach introduces the issue of web page content changes over time. The more
recent AOLIA dataset resolves this by retrieving 2006 web page versions from the Internet Archive,
providing a cleaner and higher-quality query set. Additionally, synthetic datasets such as PERSON,
Amazon product search, and MAG have been developed to circumvent real-world dataset limitations.
PERSON and MAG use citation networks to create personalized evaluation frameworks, while the
Amazon product search dataset employs item categories and properties to generate user queries. As
depicted in Table 1, the proposed dataset exhibits similarities with other datasets concerning corpus
volume and other statistical measures. Notably, it stands out as the largest dataset in terms of the
number of queries provided. Unique to this dataset is the explicit annotation by users for relevance
assessment. A single user labels the best answer, while various community members contribute by
either up-voting or down-voting an answer based on its perceived relevance.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Experimental Evaluation</title>
      <p>In this section, we briefly describe the experimental setup and discuss the results of the preliminary
experiments conducted. We adopt a two-stage ranking architecture: the first stage uses BM25 as a
fast ranker; for the second stage, we rely on a linear combination of the scores computed by BM25,
a neural re-ranker based on a pre-trained language model, and, when used, a personalization model
exploiting user history, represented by the tags used by the users. In the second stage, three neural
models are employed: MiniLM, which was trained and tuned using billions of training pairs, including
StackExchange data; DistilBERT; MonoT5 small and base. For the DistilBERT and MonoT5 models,
ifne-tuning is performed using all the training queries of SE-PQA. To fine-tune MonoT5 model we
rely on Adapter modules [14, 15, 16]. The intermediate dimension of the Adapter is set to 48. The
personalization score is computed for an answer a generated in response to a query q written by user u,
wherein the interests of u are captured through the set of tags assigned to all her/his previous questions
posted before time t. The personalized score, called the TAG model, assesses the relevance of a to q by
computing the intersection of tags associated with a and u’s previous questions, normalized by the
total number of tags associated with u’s previous questions plus one, to account for cases where the
set of tags is empty. We use P@1, NDCG@3, NDCG@10 and MAP@100 as our evaluation metrics.
The experimental results are presented in Tables 2 and 3 for the base and pers datasets, respectively.
Statistically significant improvements, indicated by *, are determined using a Bonferroni-corrected
twosided paired Student’s t-test at a 99% confidence level. Neural re-rankers based on MiniLM outperform
DistilBERT and T5-small, due to MiniLM’s extensive training set. DistilBERT and T5-small, nfie-tuned
for 10 epochs, show MAP@100 improvements of approximately 22% and 33% over BM25, respectively.
T5-base, on the other hand, outperforms all the baselines, obtaining relative improvements in terms of
MAP@100 of 6% and 46% over MiniLM and BM25, respectively. The most notable result is that TAG
improves, by a statistically significant margin, any cQA method it is combined with and for all the
metrics considered on the pers version of the dataset, thus showing the advantages of personalization.
The improvement due to the addition of this simple personalized model reaches up to 8% in terms of
MAP@100 compared to their non-personalized baseline. We claim that personalization is particularly
useful for multi-domain collections, where we can exploit information about users’ interests in multiple
topics of diferent domains. To validate our hypothesis, we perform a series of experiments considering
single-domain data extracted from SE-PQA. Specifically, we consider 50 partitions of SE-PQA (base
version) built by isolating the data from the 50 communities. We apply to each one of these subsets
the non-personalized and personalized combinations of models using the bi-encoder model MiniLM,
and measure the performance according to the same metrics used for the previous cQA tests. For
Academia
Apple
Bicycles
Christianity
Cooking
DIY
Hermeneutics
Law
Money
Music
Rpg
Scifi</p>
      <p>MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM
MiniLM + TAG 0.453*
MiniLM + TAG 0.335*
MiniLM + TAG 0.436*
MiniLM + TAG 0.549*
MiniLM + TAG 0.619*
MiniLM + TAG 0.335*
MiniLM + TAG 0.632*
MiniLM + TAG 0.677*
a fair comparison, we performed for each community the optimization of the  weights on
singledomain validation data. We notice that the contribution of the TAG model is lower in this setting,
and in some cases missing. Specifically, for 25 out of 50 communities, personalization does not lead
to any improvement, i.e.,    = 0. On the other 13 communities, we do not observe statistically
significant improvements for P@1 over the non-personalized methods. As expected, the absolute
metrics are slightly higher for single-domain tests due to the higher recall in the first-stage retrieval,
since we drastically reduce the size of the collection indexed, allowing the first-stage ranker to perform
better. However, in terms of the absolute performance boost due to the TAG model, we achieve a 2%
improvement on P@1 when using all communities together, while the average boost decreases to 1.1%
when considering the communities separately. In Table 4, we report the results for the 12 communities
for which personalization achieves statistically significant improvements.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion and Future Work</title>
      <p>Despite significant eforts by the IR community in studying personalization, a comprehensive dataset
for evaluating and comparing diferent approaches has been lacking. This work addresses this gap
by introducing a large-scale dataset encompassing 14 years of StackExchange user activity. Detailed
information about the dataset is provided, along with its potential for training and evaluating both
classical and personalized models for the community question-answering (cQA) task. Preliminary
experiments demonstrate that personalization significantly enhances state-of-the-art methods based on
pre-trained large language models. The analysis and unique features of the SE-PQA dataset suggest
numerous future research directions, including the development of more complex personalized models
utilizing additional user features not employed in the current models.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>We acknowledge the CINECA award under the ISCRA initiative, for the availability of high-performance
computing resources and support.
on Research and Development in Information Retrieval, SIGIR ’17, Association for Computing
Machinery, New York, NY, USA, 2017, p. 645–654. URL: https://doi-org.unimib.idm.oclc.org/10.
1145/3077136.3080813. doi:10.1145/3077136.3080813.
[14] C. Poth, H. Sterz, I. Paul, S. Purkayastha, L. Engländer, T. Imhof, I. Vulić, S. Ruder, I. Gurevych,
J. Pfeifer, Adapters: A unified library for parameter-eficient and modular transfer learning,
in: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing:
System Demonstrations, Association for Computational Linguistics, Singapore, 2023, pp. 149–160.</p>
      <p>URL: https://aclanthology.org/2023.emnlp-demo.13.
[15] J. Pfeifer, A. Kamath, A. Rücklé, K. Cho, I. Gurevych, AdapterFusion: Non-destructive task
composition for transfer learning, in: P. Merlo, J. Tiedemann, R. Tsarfaty (Eds.), Proceedings of
the 16th Conference of the European Chapter of the Association for Computational Linguistics:
Main Volume, Association for Computational Linguistics, Online, 2021, pp. 487–503. URL: https:
//aclanthology.org/2021.eacl-main.39. doi:10.18653/v1/2021.eacl-main.39.
[16] M. Braga, A. Raganato, G. Pasi, AdaKron: An adapter-based parameter eficient model tuning
with kronecker product, in: N. Calzolari, M.-Y. Kan, V. Hoste, A. Lenci, S. Sakti, N. Xue (Eds.),
Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language
Resources and Evaluation (LREC-COLING 2024), ELRA and ICCL, Torino, Italia, 2024, pp. 350–357.
URL: https://aclanthology.org/2024.lrec-main.32.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kasela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Braga</surname>
          </string-name>
          , G. Pasi,
          <string-name>
            <given-names>R.</given-names>
            <surname>Perego</surname>
          </string-name>
          ,
          <article-title>Se-pqa: Personalized community question answering</article-title>
          ,
          <source>in: Companion Proceedings of the ACM on Web Conference</source>
          <year>2024</year>
          , WWW '24,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2024</year>
          , p.
          <fpage>1095</fpage>
          -
          <lpage>1098</lpage>
          . URL: https://doi.org/10.1145/ 3589335.3651445. doi:
          <volume>10</volume>
          .1145/3589335.3651445.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Borisov</surname>
          </string-name>
          , I. Markov, M. de Rijke,
          <string-name>
            <given-names>P.</given-names>
            <surname>Serdyukov</surname>
          </string-name>
          ,
          <article-title>A context-aware time model for web search</article-title>
          ,
          <source>in: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '16,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2016</year>
          , p.
          <fpage>205</fpage>
          -
          <lpage>214</lpage>
          . URL: https://doi.org/10.1145/2911451.2911504. doi:
          <volume>10</volume>
          .1145/2911451.2911504.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Calegari</surname>
          </string-name>
          , G. Pasi,
          <article-title>Personal ontologies: Generation of user profiles based on the yago ontology</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>49</volume>
          (
          <year>2013</year>
          )
          <fpage>640</fpage>
          -
          <lpage>658</lpage>
          . URL: https://www. sciencedirect.com/science/article/pii/S0306457312001070. doi:https://doi.org/10.1016/j. ipm.
          <year>2012</year>
          .
          <volume>07</volume>
          .010, personalization and Recommendation in Information Access.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Braga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Raganato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pasi</surname>
          </string-name>
          , et al.,
          <article-title>Personalization in bert with adapter modules and topic modelling</article-title>
          ,
          <source>in: Proceedings of the 13th Italian Information Retrieval Workshop (IIR</source>
          <year>2023</year>
          ). Pisa, Italy,
          <year>2023</year>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>29</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Bassani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kasela</surname>
          </string-name>
          , G. Pasi,
          <article-title>Denoising attention for query-aware user modeling</article-title>
          , in: K. Duh,
          <string-name>
            <given-names>H.</given-names>
            <surname>Gomez</surname>
          </string-name>
          , S. Bethard (Eds.),
          <source>Findings of the Association for Computational Linguistics: NAACL</source>
          <year>2024</year>
          ,
          <article-title>Association for Computational Linguistics</article-title>
          , Mexico City, Mexico,
          <year>2024</year>
          , pp.
          <fpage>2368</fpage>
          -
          <lpage>2380</lpage>
          . URL: https://aclanthology.org/
          <year>2024</year>
          .findings-naacl.
          <volume>153</volume>
          . doi:
          <volume>10</volume>
          .18653/v1/
          <year>2024</year>
          .findings-naacl.
          <volume>153</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Braga</surname>
          </string-name>
          ,
          <article-title>Personalized large language models through parameter eficient fine-tuning techniques</article-title>
          ,
          <source>in: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval</source>
          , SIGIR '24,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2024</year>
          , p.
          <fpage>3076</fpage>
          . URL: https://doi.org/10.1145/3626772.3657657. doi:
          <volume>10</volume>
          .1145/3626772.3657657.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Kasela</surname>
          </string-name>
          , G. Pasi,
          <string-name>
            <given-names>R.</given-names>
            <surname>Perego</surname>
          </string-name>
          ,
          <article-title>Se-pef: a resource for personalized expert finding</article-title>
          ,
          <source>in: Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region, SIGIR-AP '23</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2023</year>
          , p.
          <fpage>288</fpage>
          -
          <lpage>309</lpage>
          . URL: https://doi.org/10.1145/3624918.3625335. doi:
          <volume>10</volume>
          .1145/ 3624918.3625335.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>G.</given-names>
            <surname>Pass</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Chowdhury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Torgeson</surname>
          </string-name>
          ,
          <article-title>A picture of search</article-title>
          ,
          <source>in: Proceedings of the 1st International Conference on Scalable Information Systems</source>
          , InfoScale '06,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2006</year>
          , p.
          <fpage>1</fpage>
          -
          <lpage>es</lpage>
          . URL: https://doi-org.
          <source>unimib.idm.oclc.org/10</source>
          .1145/1146847. 1146848. doi:
          <volume>10</volume>
          .1145/1146847.1146848.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <article-title>[9] HuggingFace, Train a sentence embedding model with 1b training pairs</article-title>
          ,
          <year>2021</year>
          . URL: https:// huggingface.co/blog/1b-sentence-embeddings.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>MacAvaney</surname>
          </string-name>
          , C. Macdonald,
          <string-name>
            <surname>I. Ounis</surname>
          </string-name>
          ,
          <article-title>Reproducing personalised session search over the aol query log</article-title>
          ,
          <source>in: Advances in Information Retrieval: 44th European Conference on IR Research</source>
          , ECIR
          <year>2022</year>
          , Stavanger, Norway,
          <source>April 10-14</source>
          ,
          <year>2022</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , Springer-Verlag, Berlin, Heidelberg,
          <year>2022</year>
          , p.
          <fpage>627</fpage>
          -
          <lpage>640</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -99736-6_
          <fpage>42</fpage>
          . doi:
          <volume>10</volume>
          .1007/ 978-3-
          <fpage>030</fpage>
          -99736-6_
          <fpage>42</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Tabrizi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shakery</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Tavallaei</surname>
          </string-name>
          , Person:
          <article-title>Personalized information retrieval evaluation based on citation networks</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>54</volume>
          (
          <year>2018</year>
          )
          <fpage>630</fpage>
          -
          <lpage>656</lpage>
          . URL: https://www.sciencedirect.com/science/article/pii/S0306457317307811. doi:https://doi. org/10.1016/j.ipm.
          <year>2018</year>
          .
          <volume>04</volume>
          .004.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>E.</given-names>
            <surname>Bassani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kasela</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Raganato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Pasi,</surname>
          </string-name>
          <article-title>A multi-domain benchmark for personalized search evaluation</article-title>
          ,
          <source>in: Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management, CIKM '22</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2022</year>
          , p.
          <fpage>3822</fpage>
          -
          <lpage>3827</lpage>
          . URL: https://doi.org/10.1145/3511808.3557536. doi:
          <volume>10</volume>
          .1145/3511808.3557536.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          ,
          <article-title>Learning a hierarchical embedding model for personalized product search</article-title>
          ,
          <source>in: Proceedings of the 40th International ACM SIGIR Conference</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>