<!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>Using Word Embeddings for Recommending Datasets based on Scientific Publications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Narges Tavakolpoursaleh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Johann Schaible</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stefan Dietze</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>GESIS - Leibniz Institute for the Social Sciences</institution>
          ,
          <addr-line>Cologne</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute for Computer Science, Heinrich-Heine University Duesseldorf</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In scholarly search systems, computing recommendations of the same type, for example, additional publications when reading a particular publication, is a well-approached problem. However, suggesting items from another type, e.g., research data when reading a publication, is rarely covered in scholarly recommendations. In this position paper, we employ word embeddings to approach the problem of such cross-domain recommendations in scientific search systems, more specifically, recommending research data based on publications. Besides various metadata, publication and research dataset entries comprise textual metadata (e.g. title, abstract), which allows to detect similar entries using word embeddings. We illustrate first results, major problems and possible solutions when using word embeddings for recommending datasets based on publications.</p>
      </abstract>
      <kwd-group>
        <kwd>Dataset Retrieval and Recommendations</kwd>
        <kwd>Cross-Domain Recommendations</kwd>
        <kwd>Word Embeddings</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In digital libraries, such as arXiv3, typically, a scientific search system aids users in
finding literature covering a topic of interest [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. To additionally alleviate the users’
situation in finding appropriate literature, scientific search systems may also comprise
recommender systems, which provide suggestions for items – sometimes previously
unknown items – that are most likely of interest to a user [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. One prominent use case
in scholarly recommendations is suggesting literature which is similar to a publication
the user is currently viewing. This resembles recommending items of the same type
(i.e. the domain of the item) and is a well-approached problem in scientific search
systems. However, there is another important use case that exploits recommendations from
different types, i.e., cross-domain recommendations. We focus on the following
prominent and more and more emerging example, which is rarely covered in scientific search
systems: recommending research data when viewing a scientific publication.
      </p>
      <p>Some information systems provide a search over various types of information in
a given field of interest. For example, besides publications, the GESIS-wide Search4
(GWS), comprises research datasets, questions as well as variables, and further
information in the field of Social Sciences. Such entries of different types enable scholarly
recommendation systems to provide the desired cross-domain suggestions.</p>
      <p>
        Why is retrieving research data important? Research data is an important
facilitator of scientific progress. Making it publicly available is crucial towards enabling
open science, i.e., towards replicating and/or reproducing research outcomes as well as
validating newly developed methods and insights [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. When research data is archived in
a digital form, the problem how to retrieve it, is mainly covered by dataset search and
retrieval. Typically, retrieval systems return relevant datasets for explicitly formulated
user queries [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Recommendations can further alleviate finding suitable research data.
However, most recommendation approaches target rather dataset interlinking by using
semantic technologies to match datasets with other datasets that overlap in their content.
Recommending datasets based on publications can pose problems using this approach,
as publications might use general datasets, e.g., statistics on a country’s demographics,
for rather specific topics, e.g., mobility of youth towards large cities. Utilizing the
content description, such as the abstract of publications and datasets, is likely to be more
promising, as both might contain needed information to detect similarities.
      </p>
      <p>In this paper, we present our on-going work on using word embeddings for research
dataset recommendations in the GESIS-wide Search based on scientific publication that
a user is currently viewing. Word embeddings seem promising in detecting appropriate
recommendations based on the textual metadata of both a publication and a dataset.
We focus on the specific use case in which we define a recommended dataset as
relevant, if that dataset has been subject to the publication, i.e., the publication cites that
dataset. The main task of the recommender is thereby defined as: the recommended
dataset should/could be used and/or cited if the user intends to build her research upon
the currently viewed publication. We illustrate that our word embedding model,
unfortunately, does not achieve promising results, provide possible reasons, as well as give a
first outlook on possible solutions how to improve the recommendations.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Whereas finding information in scientific search systems that satisfies a user’s
information need is a well-elaborated topic in classical information retrieval [
        <xref ref-type="bibr" rid="ref16 ref17">17,16</xref>
        ],
specifically targeting the goal to retrieve research data is still a growing field [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. To this day,
still most research data repositories use the same approaches to retrieve research data
as for publications, since there are only a few studies (including user behavior studies)
which seem to be more promising than the established document retrieval methods [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
For recommender systems in scientific search systems, according to [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], content-based
filtering is the most common recommendation approach (55%), followed by
collaborative filtering (18%) and graph-based recommendation approaches (16%), while the
remaining recommender systems use rather hybrid approaches. A major reason for this,
is that collaborative filtering requires a large collection and investigation of user profiles
and graph-based approaches require a well-designed knowledge graph describing and
linking the data in a repository [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Content-based approaches merely use the entries’
metadata, which especially in digital libraries is rather rich.
      </p>
      <p>
        Prior works on the general problem of dataset recommendation focus on particular
scenarios, for instance, recommendation of datasets for interlinking
(dataset-datasetrecommendation). Ellefi et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] use clustering and established schema-matching
metrics to recommend datasets with overlapping schemata, i.e., overlapping content. Lopes
et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] considers the link graph among datasets to recommend datasets which link to
the same or similar resources. Given the lack of reliable and exhaustive metadata for
research datasets, prior work in the field of dataset retrieval and dataset recommendation
relies on techniques for dataset profiling [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], for instance, in order extract and represent
dataset metadata capturing various dimensions of relevance. Thus, we restrict ourselves
to first utilize only the textual metadata of publications and research datasets.
      </p>
      <p>
        Word embedding techniques like Latent Semantic Indexing or word2vec can be
utilized to capture the contents’ metadata and provide semantics to the content [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
Recent works on unsupervised representation learning have the intent to embed context
to predict the words in a sentence [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] or the nodes in a graph [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Learning the
vector space representations of words have facilitated obtaining distributional semantics of
words [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and have been shown to perform well in many natural language processing
tasks of understanding the word-context [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Determining the semantic similarity
between items is also a related problem in the application of recommending datasets based
on publications. Therefore as the first experiment, we applied Mikolov’s Doc2Vec [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
which is as an extension to Word2Vec for learning document-level embeddings.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Data and Approach</title>
      <p>
        GESIS-wide Search: In this paper, we exploit the contents of the integrated search
system GESIS-wide Search [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for recommending datasets based on publications that a
user is currently viewing. The GESIS-wide search comprises publications (ca. 95k),
research data (ca. 84k), questions and variables (ca. 12.7k), as well as instruments and
tools (370) in the field of Social Sciences, and thus allows for such cross-domain
recommendations between these four types of data. The publications are mostly in English
and German language and are annotated with further textual metadata like title, abstract,
topic, persons, and other. Metadata on research data comprises (among others) a title,
topics, datatype, abstract, collection method, universe, primary investigator, as well as
contributor in English and/or German.
      </p>
      <p>Recommendation Task: When recommending items to a user, the following question
arises: what is the general task of the recommendation? This means, is the
recommended item supposed to complement, be as similar as possible to, or even contradict
the item viewed or downloaded by the user? Additionally, other parameters of a
recommendation, such as novelty and the impact on the domain, can be quite important to
satisfy the users’ information needs. In scientific search systems, all these dimensions
might play a role when defining a relevant recommendation. However, this also makes
it quite difficult to design and evaluate (cross-domain) recommendations, as with all
these parameters, there are different definitions of the relevance and/or the usefulness
of a recommended item. In the task of recommending datasets based on a publication,
it might be desirable to recommend datasets which support the publication,
complement the publication’s findings, are cited in the paper, or are related in some other way,
e.g., topic, domain, temporal and geographical coverage. For our prototype, we focus
on a first simple use case. Datasets that are cited by a publication the user is currently
viewing are considered relevant, i.e., the ground truth. This resembles the following
scenario: which datasets should/could be used and/or cited if the user intends to build
her research upon the currently viewed publication.</p>
      <p>
        Word Embeddings: Le et al. [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] introduced an unsupervised algorithm that learns the
vector representations from texts of different lengths to predict the surrounding words in
a sample of a paragraph. This Paragraph Vector framework (Doc2Vec) maps every
paragraph to a unique vector and concatenates it together with vectors of words, in order to
predict the next word in a context. We used this framework for representing the context
of research datasets and publications in a vector space. Subsequently, we computed the
distances between the dataset representations and the representations of publications.
Finally, we measured the semantic similarities and provided a list of recommendations
ranked from most to least similar.
      </p>
      <p>In more detail, datasets and publications in the GESIS-wide search are described
with several general textual metadata like title, abstract, author or investigator, topic,
and other type-specific metadata. We decided to utilize only titles and abstracts, as first
both types have these labels, and second they are focused on the main topic of their
contents. We concatenated the title and abstract of all items, i.e., we did not separate
between dataset title/abstract and publication title/abstract but rather put them together,
and trained the Doc2Vec model. Fig. 1 shows the number of words in titles, topics,
and abstracts in publications and datasets. We set up a 300-dimensional vector space
with a window size of five models for German and English language words and built
the vocabulary of the entire corpus (177k items). For computing the similarity between
datasets and publications, we have compared the paragraph vectors in the vector space
of items. We trained two models for English and German words. Subsequently, we
measured the similarities between 98k items (62k datasets and 36k publications with
English metadata) using the English language model, and 78k items (20k datasets and
57; 884 publications with German metadata) using the German language model.
As mentioned, our recommendation task considers suggesting a cited dataset in a
publication as relevant for the user who is currently viewing this publication. Thus, we
computed “related dataset”-links of publications in GWS and considered them as
relevant for dataset recommendation. As an example of those links, dataset with title “Role
of Government -ISSP 1985” 5 is cited by the publication entitled: “Police powers” 6.
Table 1 illustrates our corpus as well as the number of correctly retrieved datasets.</p>
      <p>When retrieving the recommendable datasets for each publication, we observed the
rank of used/cited datasets in the retrieval results. The outcome was not as we expected,
since we could retrieve only 5:82% (i.e., only 1; 294 out of 22; 201) of all used/cited
datasets in the first 1; 000 results (and only 327 in the top-10).</p>
      <p>Using only the abstract and the title of publications and datasets, we found that it
is difficult to retrieve datasets which are utilized in publications. This can have various
reasons, such as the insufficient amount of words in the title and abstract and the lack of
consideration of other, potentially useful information, such as publication dates or the
dataset citation context as representation of a dataset. In general, the amount of metadata
per record in the GWS corpus is quite different. Some records have well and
prosperous metadata whereas others are poorly described, e.g., restricted to a short title and
authors name. Additionally, quite an amount of datasets did not even have an abstract
describing the dataset, but rather some keywords and bullet points placed as abstract.
Also, training over the mix of publications and datasets might cause a problem. One
possible solution would be to train embeddings for datasets and documentations
separately. Another possibility to improve the results is to include a publication’s abstract in
the datasets’ descriptions which are cited by this publication. Among other reasons, as
mentioned before, the actual relevance of a recommendation is difficult to assess, which
indicates that offline evaluations might be inappropriate in recommendation scenarios,
as they are limited in representing the users’ interests. This means, a retrieved dataset
in higher rank could still be semantically relevant to the currently viewed publication
although it is not applied/cited in the publication.
5 https://search.gesis.org/research_data/ZA1490
6 https://search.gesis.org/publication/gesis-bib-24288</p>
      <p>Tavakolpoursaleh et al.</p>
      <p>
        In the next steps, we intend to improve our model by using a pre-trained vector
space where the representation of the known words are determined, or refine the model
by assigning a weight to each word (e.g., a simple TF-IDF or attention layer).
Additionally, one can represent the GWS datasets, publications, and their relationships within a
graph. This can serve a lot of applications such as node recommendation and link
prediction [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Considering more metadata for each item, such as authors or publication
years, can also improve the result. Finally, we intend to perform an online evaluation
of our approaches using a Living Lab [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and compare them to the default
“more-likethis”-baseline SOLR offers out of the box by analyzing click-through-rates and similar.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Beel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gipp</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Langer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Breitinger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Paper recommender systems: a literature survey</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          <volume>17</volume>
          (
          <issue>4</issue>
          ),
          <fpage>305</fpage>
          -
          <lpage>338</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Ben</given-names>
            <surname>Ellefi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bellahsene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>John</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Demidova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Szymanski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Todorov</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>RDF Dataset Profiling - a Survey of Features, Methods, Vocabularies and Applications</article-title>
          .
          <source>Semantic Web Journal Accepted in August</source>
          <year>2017</year>
          , to appear.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Borgman</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          :
          <article-title>The conundrum of sharing research data</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology (6)</source>
          ,
          <fpage>1059</fpage>
          -
          <lpage>1078</lpage>
          (jun)
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Breuer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaer</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tavakolpoursaleh</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schaible</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolff</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mueller</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>STELLA: Towards a Framework for the Reproducibility ofOnline Search Experiments</article-title>
          . In:
          <article-title>Proceedings of the Open-Source IR Replicability Challenge (OSIRRC) (accepted</article-title>
          ) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ellefi</surname>
            ,
            <given-names>M.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bellahsene</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dietze</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Todorov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Dataset recommendation for data linking: An intensional approach</article-title>
          . In: ESWC. Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gregory</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Groth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cousijn</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Scharnhorst</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wyatt</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Searching data: A review of observational data retrieval practices in selected disciplines</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hienert</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kern</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boland</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zapilko</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mutschke</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>A digital library for research data and related information in the social sciences</article-title>
          .
          <source>In: ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL) (forthcoming)</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
          </string-name>
          , R.:
          <source>Advances in Collaborative Filtering</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kunze</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Dataset Retrieval</article-title>
          .
          <source>In: 2013 IEEE Seventh International Conference on Semantic Computing</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . IEEE (sep)
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of sentences and documents</article-title>
          . pp.
          <fpage>II</fpage>
          -1188
          <string-name>
            <surname>-</surname>
          </string-name>
          II-1196. ICML'
          <volume>14</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Levy</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goldberg</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Neural word embedding as implicit matrix factorization</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <fpage>2177</fpage>
          -
          <lpage>2185</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lopes</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paes</surname>
            <given-names>Leme</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>L.A.</given-names>
            ,
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Two approaches to the dataset interlinking recommendation problem (</article-title>
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Musto</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Gemmis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lops</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Word embedding techniques for contentbased recommender systems: An empirical evaluation</article-title>
          .
          <source>In: RecSys Posters</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Narayanan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chandramohan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Venkatesan</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaiswal</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>Graph2Vec: Learning Distributed Representations of Graphs</article-title>
          .
          <source>CoRR</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rokach</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shapira</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Introduction to Recommender Systems Handbook</article-title>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>35</lpage>
          . Springer US, Boston, MA (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>White</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Interactions with search systems (</article-title>
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.H.I.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bainbridge</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nichols</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          :
          <article-title>How to build a digital library</article-title>
          . Morgan Kaufmann Publishers (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
          </string-name>
          , J.:
          <article-title>Scalable graph embedding for asymmetric proximity</article-title>
          .
          <source>In: Thirty-First AAAI Conference on Artificial Intelligence</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>