<!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>Cite4Me: Semantic Retrieval and Analysis of Scientific Publications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bernardo Pereira Nunes</string-name>
          <email>bnunes@inf.puc-rio.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Besnik Fetahu</string-name>
          <email>fetahu@l3s.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Antonio Casanova</string-name>
          <email>casanova@inf.puc-rio.br</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>L3S Research Center</institution>
          ,
          <addr-line>Appelstrasse 9a, Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>PUC-Rio</institution>
          ,
          <addr-line>Rio de Janeiro</addr-line>
          ,
          <country country="BR">Brazil</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper presents the Cite4Me Web application and its features created for the LAK Challenge 2013. The Web application focuses on two main directions: (i) interlinking of the LAK dataset with related data sources from the Linked Open Data cloud; and (ii) providing innovative search, visualization, retrieval and recommendation of scientific publications from the LAK dataset and related interlinked resources. Our approach is based on semantic and cooccurrence relations to provide new browsing experiences to Web users and an overview of scientific data available. Furthermore, we present a detailed analysis of the LAK dataset along with applications which contributes to the development of the learning analytics field.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>The volume of information on the Web has been growing steadily
over the last decade and has doubled every two years. The vast
amount of data available on the Web along with new means of
communications have transformed our society, including the way
we work, live, relate to each other and learn.</p>
      <p>In the midst of change, the Learning Analytics emerges to make
sense of the produced educational data reported by learners,
professors, institutions and so on. Analyzing and understanding the
changes along the past years help us to understand the current state
and be aware of the forthcoming trends, enabling a new outlook of
the future of learning.</p>
      <p>A recent challenge initiative of SOLAR1 and LinkedUp2 project
arises to leverage the creation of tools that enables the analysis,
visualization, browsing and recommendation of scientific and
educational data.</p>
      <p>Although the scientific field has fostered the creation of new
applications in several areas, such as medical, biology, physics,
amongst others, the information access is based mostly on free
text search and on hierarchical classification system of the
pub1Society for Learning Analytics Research - http://www.
solaresearch.org
2http://linkedup-project.eu/
Copyright c 2013 by the papers’ authors. Copying permitted only for
private and academic purposes.</p>
      <p>LAK-Data Challenge ’13 Leuven, Belgium
lications3. However, current approaches by main digital library
providers, such as ACM Digital Library4 and Elsevier5, do not
represent the current state of research on exploring resources
using approaches from Information Retrieval, Information Extraction
and Semantic Web. Thus, get an overview of research topics, find
publications and discover new nomenclatures are an arduous and
laborious task that are not always successful.</p>
      <p>In this paper, we introduce Cite4Me a novel application for
exploratory search, retrieval and visualization of scientific
publications. Cite4Me intends to provide to the end users a single point for
accessing papers and hence reducing e orts of searching in several
data sources. Our system takes advantage of reference datasets,
such as DBpedia6, to explore semantic relationships between
scientific papers and user queries. Additionally, an analysis of topic
coverage and shared concepts from related educational datasets,
extracted from the Linked Open Data cloud, will be introduced.</p>
      <p>The remaining of the paper is organized as follows. Section 2
presents the approach used for searching, retrieving and
recommending papers. Section 3 describes the process of dataset
discovery and interlinking and Section 4 shows a brief result analysis
of the data discovery. Finally, Section 5 presents related work and
Section 6 presents some concluding remarks.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>CITE4ME</title>
      <p>As one of the main goals of the field of “Learning Analytics” is
to support students in their learning process, we developed a Web
application called Cite4Me7 that assists students in making
decisions to find scientific publications and identify relevant research
topics.</p>
      <p>Cite4Me implements semantic and co-occurrence methods to (a)
search and retrieve scientific publications; and (b) recommend
scientific publications. Moreover, it provides a Web interface that
facilitates the search for publications and may help users on
discovering related terms to a given query.</p>
      <p>In this section, we provide an overview of the major features
of the Web application and its Web interface that assist users to
explore scientific data on the Web.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Search and Retrieval</title>
      <p>Cite4Me relies on search functionalities to meet the users needs.
Briefly, we implemented standard Information Retrieval (IR) and
Semantic Web (SW) approaches to retrieve and recommend
scientific papers to the users. We divided this subsection into (i) free text
3http://www.acm.org/about/class/
4http://dl.acm.org
5http://www.elsevier.com
6http://dbpedia.org
7http://www.cite4me.com/
search; (ii) exploratory search; and (iii) semantic search.
2.1.1</p>
      <sec id="sec-3-1">
        <title>Free Text Search</title>
        <p>The purpose of the free text search functionality is to o er users
the abilities to search for mentions, titles and authors of academic
publications contained in the LAK dataset. Even though, this
functionality is similar to existing digital libraries, we agree that this is a
basic functionality that must be provided by our application.
Therefore, we use standard vector space models (tf-idf ) for indexing and
retrieving documents.</p>
        <p>
          The tf-idf scores were computed for each term extracted from the
publication content after applying stemming [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. Furthermore, the
searching functionality o ers boolean queries with standard
operators, such as ’OR’, ’AND’, and also a ranking of the matching
publications based on the sum of tf-idf scores from the individual
query terms.
        </p>
        <p>In summary, our free text search provides to the users
publications (P) that match query terms and non-matching publications
P0, which are related to P according to a degree of similarity (see
Eq. 1), but does not contain the query terms.</p>
        <p>The similarity between a matching publication P and other
nonmatching publication P0 in the LAK dataset is measured by the
standard cosine similarity measure, which is built on top of the
computed tf-idf scores.</p>
        <p>S im(P; P0) =</p>
        <p>P P0
jPjjP0j
(1)
where P and P0 represent the tf-idf scores for the terms in two
distinct publications.
2.1.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Exploratory Search</title>
        <p>In this section, we provide detailed insights on the exploratory
search functionality of our application. As a preliminary step to
provide analytics and information about the actual content and
topics coverage, all the scientific publications contained in the LAK
dataset are previously enriched. The enrichment process was
performed using DBpedia Spotlight API8, where entities, entity types
and their respective categories were extracted.</p>
        <p>After the enrichment process, we cluster the publications
according to entities and its categories found in each document. The
publications are clustered in a tree-based structure over the enrichments.
Note that, each node of the tree represents a topic in which a
publication under this node covers. Thus, the exploratory search is
performed through the topics covered by each publication.</p>
        <p>The process of linking publications, categories and extra
resources is mediated by DBpedia knowledge graph, where we use
the dcterms:subject property to match the resources.</p>
        <p>Thus, as a result, the exploratory search provides a way to
explore resources through the connections between their topics,
which facilitates the search for topically related resources. Figure 1
shows the exploratory search.
2.1.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Semantic Search</title>
        <p>
          Cite4Me provides also a semantic search engine that assists users
to find publications semantically related to the query terms.
Analogously to explicit semantic analysis (ESA) technique [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], the
relatedness score, is computed between the enriched concepts found in
the publications’ content.
        </p>
        <p>Basically, the semantic search is an adaptation of the free text
search presented in the Section 2.1.1. Instead of computing the
tf-idf scores for the words in a text, it computes the tf-idf score</p>
        <sec id="sec-3-3-1">
          <title>8http://dbpedia.org/spotlight</title>
          <p>for the entities contained in a publication. Finally, the ranking of
the results is based on the sum of the tf-idf scores of the matching
concepts.</p>
          <p>Figure 2 illustrates the semantic search functionality. It also
generates a tag cloud from matching publications, showing the most
prominent terms for a given query. Specifically, the tag cloug based
on the results helps the users to have an insight about the topics and
may assist in finding related terms previously unknown by them.
2.2</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Paper recommendation</title>
      <p>
        Another key feature of our system is the paper recommendation
based on semantic relationships extracted from reference datasets.
The recommendation is based on a previous work [
        <xref ref-type="bibr" rid="ref11 ref12">12, 11</xref>
        ], where
we exploit the number of paths and the distance (length of a path)
between given entities to compute a relatedness score between
extracted entities and associated documents. The first step to measure
the relatedness between documents is to compute the semantic
connectivity score (S CS e) of the entities found in each text (see Eq. 2).
(2)
(3)
S CS e(a; b) =
      </p>
      <p>
        X l jpaths(&lt;al;&gt;b)j
l=1
where jpaths(&lt;al;&gt;b)j is the number of paths between a and b of length l
and 0 &lt; 1 is a positive damping factor. As in [
        <xref ref-type="bibr" rid="ref11 ref12">12, 11</xref>
        ], we used
= 0:5 as our damping factor. Furthermore, we also constrained
the length of a path to = 4.
      </p>
      <p>Based on the score for entities, we then define the semantic
connectivity score (S CS w) between two documents W1 and W2 as
follows:
0
B
B
B</p>
      <p>B
S CS w(W1; W2)=BBBBBB X</p>
      <p>B
B
B
BBBe12E1
BB@e22E2
e1,e2
1
C
C</p>
      <p>C
S CS e(e1; e2) + jE1 \ E2j CCCCC 1</p>
      <p>C
2 CCCCC jE1j jE2j</p>
      <p>C
C
C
C
A
where Ei is the set of entities associated with Wi, for i = 1; 2. Note
that documents that contain the same entities receive an extra bonus
(the second term on the right-hand side of Eq. 3).</p>
      <p>Thus, a list of documents pairs is generated and ranked according
the score and suggested to the user. Figure 3 illustrates the paper
recommendation process computed based on S CS w.</p>
    </sec>
    <sec id="sec-5">
      <title>DISCOVERY AND</title>
    </sec>
    <sec id="sec-6">
      <title>INTER3.</title>
    </sec>
    <sec id="sec-7">
      <title>DATASET</title>
    </sec>
    <sec id="sec-8">
      <title>LINKING</title>
      <p>This section briefly describes the datasets used on automatic
related data discovery from DataHub9 and future steps on dataset
discovery and interlinking.
3.1</p>
    </sec>
    <sec id="sec-9">
      <title>LAK Dataset</title>
      <p>The LAK dataset contains the metadata of the papers published
in the proceedings of LAK conference 2011-12, a special issue of
Learning and Knowledge Analytics: Educational Technology &amp;
Society, the proceedings of the International Conference on
Educational Data Mining (2008-12) and the Journal of Educational Data
Mining (2008-12). In total, 315 descriptions of papers containing
detailed information about authors, institutions, conference venues
and the full content of the paper were available.
3.2</p>
    </sec>
    <sec id="sec-10">
      <title>Data Analysis</title>
      <p>The goal of the data analysis procedure is to align the various
publications in the LAK dataset based on mutual information, such</p>
      <sec id="sec-10-1">
        <title>9http://www.datahub.io</title>
        <p>as the topics covered by them. This is achieved using well
established datasets like DBpedia10 and Freebase11, where a reference
point for the unstructured textual content of publications is created
through an enrichment process.</p>
        <p>
          Again, the enrichment process is carried out using DBpedia
Spotlight12 [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and addresses several issues of significant
importance. For instance, it o ers several advantages such as: (i)
identification of (common) named entities, (ii) disambiguation; and (iii)
expansion of the limited dataset and resource descriptions with
additional background knowledge.
3.3
        </p>
      </sec>
    </sec>
    <sec id="sec-11">
      <title>Data Discovery</title>
      <p>Our Web application uses as its starting point the instances in
the LAK dataset to automatically explore and recommend to users,
datasets that covers similar topics. In order to query, detect and
interlink related datasets, we chose the DataHub as a data provider.
DataHub serves as a collecting point of datasets from various fields
and currently it has over 5000 datasets. Note that, from the large
number of datasets, only 300 datasets are provided as Linked Open
Data. As the latter is the main focus of our work, the analysis and
interlinking process is focused for such datasets.</p>
      <p>Briefly, the data discovery is performed using CKAN13 data
management framework from DataHub, where based on data
analysis and user interests (such as topics covered by a
publication/resource) related datasets are suggested.</p>
      <p>Additionally, we provide to the user a set of resources, amongst
other data analytics, that enables the user to harvest and correlate
new information from the discovered resources, considering the
LAK dataset as a starting point of such discovery.</p>
      <p>This approach presents several advantages such as the adoption
and the widespread use of Linked Data principles for publishing
scientific papers. Nowadays, many conferences make their
proceedings and journals freely accessible, hence our approach would
take advantage of such open data and o er users topically relevant
papers for a particular resource in the LAK dataset.
10http://dbpedia.org
11http://www.freebase.com/
12http://spotlight.dbpedia.org/
13http://www.ckan.org
4.</p>
    </sec>
    <sec id="sec-12">
      <title>EVALUATION OF DATA</title>
    </sec>
    <sec id="sec-13">
      <title>AND DATA DISCOVERY</title>
      <p>This section presents an overview of the results obtained by
analyzing the LAK dataset with respect to the constructed feature set
that describes topics covered by individual publications. Moreover,
based on the data analysis procedure and shared information, we
show that the establishment of links between the di erent
publications within the LAK dataset and from other datasets in DataHub
is possible.</p>
      <p>In the following subsections, we show the analysis of the LAK
dataset and the discovery of relevant datasets and publications.
4.1</p>
      <p>The data analysis of the LAK dataset focuses mostly on
assessing the individual publications for their topic coverage. In this
manner, we build a connected data graph consisting of the individual
publications and items from the feature set. This step is necessary
to provide the exploratory search functionality, where based on the
established edges between publications and feature set items, we
can navigate through the publications or topics of interest.
Therefore, the results obtained with respect to the constructed feature set
and LAK dataset graph are shown in what follows.</p>
      <p>Table 1 shows the top ranked items for each of the feature sets,
along with the number of associations an item has with respect to
all publications (entity, category and type items). Figure 5 shows
the constructed data graph for the LAK dataset.
4.2</p>
    </sec>
    <sec id="sec-14">
      <title>Data Discovery</title>
      <p>After creating the feature set based on the information provided
from reference datasets, we are able to query for relevant datasets
in DataHub.</p>
      <p>Thus, for the top ranked feature set items, the data discovery
for relevant resources is considered. Table 2 shows the discovered
resources and datasets for the top-10 entity items. Note that, we
focus only on bibliographic datasets, since we aim at recommending
topically related scientific publications. Due to the lack of
bibliographic datasets, we were not able to find related publications
for all entities considered. Table 2 summarizes the discovered
resources. The dataset names are represented by their acronyms as
follows: b3kat - “Bayerische Staatsbibliothek", hebis -
“Hessisches Bibliotheks Informations System" and npg - “Nature
Publishing Group - ALL".</p>
      <p>Additionally, from the set of 96 bibliographic datasets available,
only a few of them were o ered as Linked Data, thus narrowing
our search space for relevant resources.</p>
      <p>Entity
Data
Learning
Data mining
Algorithm
Education
Analysis
Student
Knowledge
Methodology
Statistics</p>
      <p>Com unity
Syntactic relationsh.</p>
      <p>EquatiToynpses of unctions</p>
      <p>Ap lied linguistics</p>
      <p>Types of unEivgeinrseityrin.g
Technol gy</p>
    </sec>
    <sec id="sec-15">
      <title>RELATED WORK</title>
      <p>
        Cobo et al.[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] presents an analysis of student participation in
online discussion forums using an agglomerative hierarchical
clustering algorithm, and explore the profiles to find relevant
activity patterns and detect di erent student profiles. Barber et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
uses a predictive analytic model to prevent students from failing
in courses. They analyze several variables, such as grades, age,
attendance and others, that can impede the student learning.Kahn
et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] present a long-term study using hierarchical cluster
analysis, t-tests and Pearson correlation that identified seven behavior
patterns of learners in online discussion forums based on their
access. García-Solórzano et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] introduce a new educational
monitoring tool that helps tutors to monitor the development of the
students. Unlike traditional monitoring systems, they propose a
faceted browser visualization tool to facilitate the analysis of the
student progress. Glass [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] provides a versatile visualization tool to
enable the creation of additional visualizations of data collections.
      </p>
      <p>
        Essa et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] utilize predictive models to identify learners
academically at-risk. They present the problem with an interesting
analogy to the patient-doctor workflow, where first they identify the
problem, analyze the situation and then prescribe courses that are
indicated to help the student to succeed. Siadaty et al.[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] present
the Learn-B environment, a hub system that captures information
about the users usage in di erent softwares and learning activities
in their workplace and present to the user feedback to support future
decisions, planning and accompanies them in the learning process.
      </p>
      <p>
        In the same way, McAuley et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] propose a visual
analytics to support organizational learning in online communities. They
present their analysis through an adjacency matrix and an
adjustable timeline that show the communication-actions of the users
and is able to organize it into temporal patterns. Bramucci et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
presents Sherpa an academic recommendation system to support
students on making decisions. For instance, using the learner
profiles they recommend courses or make interventions in case that
students are at-risk.
      </p>
      <p>In the related work, we showed how di erent perspectives and
the necessity of new tools and methods to make data available and
help decision-makers.</p>
    </sec>
    <sec id="sec-16">
      <title>CONCLUSION</title>
      <p>In this paper we presented the main features of the Cite4Me Web
application. Cite4Me makes use of several data sources to provide
information for users interested on scientific publications and its
applications.</p>
      <p>Additionally, we provided a general framework on data
discovery and correlated resources based on a constructed feature set,
consisting of items extracted from reference datasets. It made
possible for users, to search and relate resources from a dataset with
other resources o ered as Linked Data.</p>
      <p>For more information about the Cite4Me Web application refer
to http://www.cite4me.com.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R.</given-names>
            <surname>Barber</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sharkey</surname>
          </string-name>
          .
          <article-title>Course correction: using analytics to predict course success</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>259</fpage>
          -
          <lpage>262</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bramucci</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Gaston</surname>
          </string-name>
          .
          <article-title>Sherpa: increasing student success with a recommendation engine</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>82</fpage>
          -
          <lpage>83</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>G.</given-names>
            <surname>Cobo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>García-Solórzano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Morán</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Santamaría</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Monzo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Melenchón</surname>
          </string-name>
          .
          <article-title>Using agglomerative hierarchical clustering to model learner participation profiles in online discussion forums</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>248</fpage>
          -
          <lpage>251</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Essa</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Ayad</surname>
          </string-name>
          .
          <article-title>Student success system: risk analytics and data visualization using ensembles of predictive models</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>158</fpage>
          -
          <lpage>161</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Gabrilovich</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Markovitch</surname>
          </string-name>
          .
          <article-title>Computing semantic relatedness using wikipedia-based explicit semantic analysis</article-title>
          .
          <source>In Proc. of the 20th international joint conference on Artifical intelligence, IJCAI'07</source>
          , pages
          <fpage>1606</fpage>
          -
          <lpage>1611</lpage>
          , San Francisco, CA, USA,
          <year>2007</year>
          . Morgan Kaufmann Pub. Inc.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>García-Solórzano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cobo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Santamaría</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Morán</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Monzo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Melenchón</surname>
          </string-name>
          .
          <article-title>Educational monitoring tool based on faceted browsing and data portraits</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>170</fpage>
          -
          <lpage>178</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T. M.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Clear</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Sajadi</surname>
          </string-name>
          .
          <article-title>The relationship between educational performance and online access routines: analysis of students' access to an online discussion forum</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>226</fpage>
          -
          <lpage>229</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Leony</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pardo</surname>
          </string-name>
          , L. de la Fuente Valentín, D. S. de Castro, and
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Kloos</surname>
          </string-name>
          .
          <article-title>Glass: a learning analytics visualization tool</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>162</fpage>
          -
          <lpage>163</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>McAuley</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. O'Connor</surname>
            ,
            <given-names>and D.</given-names>
          </string-name>
          <string-name>
            <surname>Lewis</surname>
          </string-name>
          .
          <article-title>Exploring reflection in online communities</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>102</fpage>
          -
          <lpage>110</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P. N.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jakob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>García-Silva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          .
          <article-title>Dbpedia spotlight: shedding light on the web of documents</article-title>
          .
          <source>In Proc. of the 7th International Conference on Semantic Systems, I-Semantics '11</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          , New York, NY, USA,
          <year>2011</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>B.</given-names>
            <surname>Pereira Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Casanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kawase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Fetahu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          .
          <article-title>Combining a co-occurrence-based and a semantic measure for entity linking</article-title>
          .
          <source>In ESWC</source>
          ,
          <year>2013</year>
          (to appear).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.</given-names>
            <surname>Pereira</surname>
          </string-name>
          <string-name>
            <surname>Nunes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kawase</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dietze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Taibi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Casanova</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          . Can entities be friends? In G. Rizzo,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mendes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Charton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hellmann</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Kalyanpur, editors,
          <source>Proc. of the Web of Linked Entities Workshop in conjuction with the 11th International Semantic Web Conference</source>
          , volume
          <volume>906</volume>
          <source>of CEUR-WS.org</source>
          , pages
          <fpage>45</fpage>
          -
          <lpage>57</lpage>
          , Nov.
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>M.</given-names>
            <surname>Siadaty</surname>
          </string-name>
          , D. Gaševic´, J. Jovanovic´, N. Milikic´,
          <string-name>
            <surname>Z. Jeremic´</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ali</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Giljanovic´, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Hatala</surname>
          </string-name>
          .
          <article-title>Learn-b: a social analytics-enabled tool for self-regulated workplace learning</article-title>
          .
          <source>In Proc. of the 2nd International Conference on Learning Analytics and Knowledge</source>
          ,
          <source>LAK '12</source>
          , pages
          <fpage>115</fpage>
          -
          <lpage>119</lpage>
          , New York, NY, USA,
          <year>2012</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C. van Rijsbergen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Robertson</surname>
            , and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Porter</surname>
          </string-name>
          .
          <article-title>New models in probabilistic information retrieval</article-title>
          .
          <year>1980</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>