<!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>Semantic Enrichment of Social Media Resources for Adaptation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oliver Schimratzki</string-name>
          <email>oliver.schimratzki@gmx.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fedor Bakalov</string-name>
          <email>fedor.bakalov@uni-jena.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adrian Knoth</string-name>
          <email>adrian.knoth@uni-jena.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Birgitta Ko¨nig-Ries</string-name>
          <email>birgitta.koenig-ries@uni-jena.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Friedrich Schiller University of Jena</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>With more and more dynamic content available on the web, we need systems that aggregate and filter information from different sources to provide us with only the information we are really interested in. In this paper, we present one such system, the CompleXys portal, aimed at users interested in complexity or subtopics thereof. It accesses a large variety of different information sources, among them calendars, news sites and blogs, semantically annotates and categorizes the retrieved content and displays only relevant content to the user.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The amount of dynamic content available on the web is rapidly growing. It
becomes more and more difficult for users to keep track of all relevant information
in particular since it becomes more and more overwhelming to manually separate
relevant from irrelevant content. Even if a user has identified a variety of news
sites and blogs that often contain information she is interested in, those sites will
also contain lots of information the user is not interested in. Purely syntactic
filtering based, e.g., on keywords, as offered by today’s tools, offers only a partial
solution. What is really needed is semantic filtering, i.e., filtering based on some
“understanding” of the content. This will allow for higher precision, i.e., fewer
irrelevant articles displayed, and higher recall, i.e. less relevant articles deleted,
and will thus increase user confidence in using the tools.</p>
      <p>In this paper, we present the CompleXys portal, an information site that
will provide users with personalized access to information related to the topic
of complexity. CompleXys harvests information from a large variety of sites,
ranging from event calendars to blogs and news sites. It semantically annotates
the retrieved content. These annotations are then used to categorize the
retrieved items and to decide whether they are sufficiently related to complexity
or should be discarded. In the future, CompleXys will use the categorization
for a more fine-grained personalization, displaying the most relevant items most
prominently and providing recommendations to the user.</p>
      <p>In the remainder of this paper, after a brief discussion of related work in
Section 2 we take a closer look at CompleXys and the underlying technologies:
Section 3 provides an overview of the CompleXys architecture. We will then focus
on the most interesting part of this architecture, namely the semantic content
annotator which will be presented in Section 4. Finally, Section 5 contains a
summary and an outlook on our future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>In this paper we describe an architectural solution and an approach to providing
a personalized access to the variety of resources residing on the Web and in
intranets. To achieve this, we combine the approaches and technology from three
areas of research, namely content aggregation, semantic content annotation, and
content-based recommender systems.</p>
      <p>
        Content aggregation, though a relatively new field, has already achieved
the state of maturity. Apart from the multitude of research proposals [
        <xref ref-type="bibr" rid="ref10 ref11 ref16">16, 10,
11</xref>
        ], there exists a number of industry standards and commercial applications
of content aggregators. Really Simple Syndication (RSS)1 and Atom2 formats
have been successfully used by a large number of Web and desktop application
for aggregating various types of content, including but not limited to calendar
information, news, blog entries, and podcasts. The iCalendar3 format is used
by many applications for aggregating appointments and events from multiple
calendar systems. Personal Web portals like i Google4 and My Yahoo!5 allow
their users to place different types of content harvested through RSS and Atom
feeds on their personal pages. Portals like Technorati6 aggregate information on
more or less specific topics. RSS filtering tools like Feed Rinse7 allow the user
to define keyword based filters on RSS feeds to get rid of irrelevant items. These
tools work, however, on a purely syntactic level.
      </p>
      <p>
        The field of semantic content annotation mainly deals with the
challenges related to availability of well-formed metadata for the unstructured text
resources, which is essential for achieving high recall and precision of
information retrieval. A number of approaches to semantic content annotation have
been reported in the literature [
        <xref ref-type="bibr" rid="ref5 ref7 ref9">5, 9, 7</xref>
        ]. GATE [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] has become one of the most
widely used open source frameworks for implementing natural language
processing (NLP) tasks. The framework empowers developers to implement such
components as tokenizers, sentence splitters, part-of-speech taggers, gazetteers,
semantic taggers, and the components for identifying relationships among the
entities in the text. A number of NLP systems leverage GATE and its
components for semantic tagging of content; these include but not limited to the KIM
platform [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], MUSE [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and Ont-O-Mat [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
1 http://web.resource.org/rss/1.0/
2 http://tools.ietf.org/html/rfc4287
3 http://tools.ietf.org/html/rfc5545
4 http://www.google.com/ig
5 http://my.yahoo.com
6 http://technorati.com/
7 http://http://www.feedrinse.com/
      </p>
      <p>
        Availability of machine-processable metadata of content is one of the most
essential requirements for the content-based recommender systems [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
These systems recommend relevant content to the user based on the semantic
description of available resources and the user’s personal preferences. The
relevant content is selected by analyzing the content metadata and the user’s profile
and identifying the items that match the user’s individual interests. A number of
systems leveraging this approach have been proposed. CHIP [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], for instance, is
capable of recommending the user artworks from multiple museum collections.
For recommendation, the system leverages the semantic description of artworks
and the user’s personal interests in the domain of cultural heritage, which the
system identifies based on the user’s explicit ratings of artworks and semantic
relations among the art topics. Other examples of the systems leveraging similar
recommendation approach are the Personal Reader Framework [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and Personal
Learning Assistant [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Overall Architecture</title>
      <p>The CompleXys portal aggregates a multitude of different sources from the
Internet, categorises the retrieved content, applies semantic annotation and
finally presents the filtered and personalised results to the user. Table 1 shows
a schematic overview of CompleXys’ architecture and its data flow in a left to
right manner, which basically implements the Input-Processing-Output model.</p>
      <p>On the input site, the harvester retrieves arbitrary content and stores a
mangled version in the crawler database. Since the particular source of each entry is
known, this step also provides content type indexing for free.</p>
      <p>The crawler database is fully generic and hence supports any kind of input
source. Figure 1 shows the underlying schema. The DBMS will increment the
unique key id for every newly retrieved entry. All later processing steps make
use of this key: querying the crawler database for new content simply means
querying for all id s higher than the last known or processed id.8</p>
      <sec id="sec-3-1">
        <title>Column</title>
      </sec>
      <sec id="sec-3-2">
        <title>Type</title>
      </sec>
      <sec id="sec-3-3">
        <title>Modifiers</title>
        <p>id bigint UNIQUE
source character varying(255)
content text
internal id character varying(255) UNIQUE not null</p>
        <p>The content itself is blindly stored as text (BLOB), semantic parsing is
delayed to subsequent stages in the processing pipeline. The source column contains
the SIOC content type, it serves as a type indicator to the processing modules.</p>
        <p>The crawler is idempotent, that is, it can be run several times without storing
already known content again. This property is achieved by internal id, another
column set to be a unique key. For each retrieved entry, the crawler calculates
a suitable MD5 hash and stores both, content and its derived hash into the
database. If this entry has been already fetched, the DBMS will prevent inserting
a duplicate MD5 hash into internal id and consequently avoid storing known
content again. Obviously, finding an appropriate way for calculating the MD5
hash is crucial. CompleXys currently has built-in support for two different source
types: it can directly retrieve calendar events from SQL databases and arbitrary
HTML input from the web via RSS, but more resource types can be added
via crawler plugins. Generating a suitable hash representing the content usually
differs among sources and is hence individually implemented in each such crawler
plugin.</p>
        <p>The SQL crawler connects to specified source databases in the University’s
network and harvests information about upcoming events, potentially of
interest to the user. Since CompleXys strictly adhere to UTF-8 character encoding
throughout the whole processing, the crawler is responsible to convert any source
specific encoding, e.g., from Latin1 to UTF-8. This way, subsequent processing
modules do not have to take care for different character encodings.</p>
        <p>The retrieved SQL calendar events are normalised into a standardised
template as shown in Figure 2.
8 SELECT * FROM crawler WHERE id &gt; already seen
def fill_template(params)
"&lt;sioc:Item rdf:about=\"#{params[:source]}-#{params[:their_id]}\"&gt;\n" +
"\t&lt;vevent:dtstart&gt;#{params[:date]}&lt;/vevent:dtstart&gt;\n" +
"\t&lt;dcterms:creator&gt;#{params[:speaker]}&lt;/dcterms:creator&gt;\n" +
"\t&lt;vevent:location&gt;#{params[:affi]}&lt;/vevent:location&gt;\n" +
"\t&lt;dcterms:title&gt;#{params[:title]}&lt;/dcterms:title&gt;\n" +
"\t&lt;dcterms:abstract&gt;&lt;![CDATA[#{params[:abstract]}]]&gt;\n\t&lt;/dcterms:abstract&gt;" +
"\t&lt;vevent:url&gt;#{params[:url]}&lt;/vevent:url&gt;" +
"\t&lt;vevent:dtend&gt;#{params[:endtime]}&lt;/vevent:dtend &gt;\n" +
"\t&lt;dcterms:modified&gt;#{params[:lastupdate]}&lt;/dcterms:modified&gt;\n" +
"&lt;/sioc:Item&gt;"
end</p>
        <p>The crawler finally calculates the appropriate MD5 hash for this event by
concatenating the source prefix (a constant arbitrary string), the event’s
primary key in the foreign database and the provided last-update timestamp. This
way, the MD5 hash of the concatenation is different for each event from every
source database. Even more, updates to already retrieved events have a
different timestamp, and consequently, a new MD5 hash together with this updated
content will end up in the crawler database. Whenever the CompleXys portal
encounters multiple entries for the same source URI in its crawler database,
younger rows are updates to already known events.</p>
        <p>In addition to SQL calendar events, the harvester has a HTTP crawler for
arbitrary HTML content. URLs are extracted from RSS feeds specified in a static
configuration file (see Figure 3).</p>
        <p>Whenever possible, the crawler tries to use the print version of a document
to remove navigation menus, advertisements and other unrelated noise. If the
source already provides a more structured representation, e.g., iCal format, it will
be used instead. Likewise the SQL crawler, the HTTP crawler wraps retrieved
content into a SIOC9 schema as depicted in Figure 4, generates a suitable MD5
hash and tries to store the result in the crawler database. Again, this insert will
fail if the content is already known.</p>
        <p>At this stage, all entries in the crawler database are simply unstructured raw
text. Unless already provided by the source, there is no semantic information
available, yet. However, semantic annotation is required to decide if a given
content item is of interest to the user. The next section will explain in detail
how this is done.</p>
        <p>
          Once semantic annotation has been provided, relevant items are displayed
to the user of the CompleXys portal categorized in appropriate domains. We
are currently working on integrating our approach to personalization into
CompleXys. This will allow to adapt the information provided to individual user
9 http://sioc-project.org/ontology
&lt;?xml version="1.0" encoding="UTF-8"?&gt;
&lt;rss-channels&gt;
&lt;channel&gt;
&lt;url&gt;http://scienceblogs.com/sample/technology.xml&lt;/url&gt;
&lt;source&gt;scienceblogs.com&lt;/source&gt;
&lt;type&gt;blogs&lt;/type&gt;
&lt;name&gt;ScienceBlogs - Technology&lt;/name&gt;
&lt;category&gt;Technology&lt;/category&gt;
&lt;/channel&gt;
&lt;channel&gt;
&lt;url&gt;http://scienceblogs.com/sample/medicine.xml&lt;/url&gt;
&lt;source&gt;scienceblogs.com&lt;/source&gt;
&lt;type&gt;blogs&lt;/type&gt;
&lt;name&gt;ScienceBlogs - Medicine&lt;/name&gt;
&lt;category&gt;Medicine&lt;/category&gt;
&lt;/channel&gt;
&lt;channel&gt;
&lt;url&gt;http://www.wired.com/wiredscience/feed/&lt;/url&gt;
&lt;source&gt;wired.com&lt;/source&gt;
&lt;type&gt;blogs&lt;/type&gt;
&lt;name&gt;Wired Science&lt;/name&gt;
&lt;category&gt;Science&lt;/category&gt;
&lt;/channel&gt;
&lt;/rss-channels&gt;
needs: Only information relevant to a specific user (and not to complexity in
general) will be provided, the most important information will be displayed
most prominently, related information (and possibly related users) will be
recommended etc. Underlying this adaptation is a user interest model realized as
an overlay over the domain model, that collects user interests based on the
interactions of the user with the system and also allows the user manual adaptations
[
          <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
          ].
The Semantic Content Annotators pursue the purpose of extracting semantic
data from incoming text documents and of annotating this data back to the
resources. Furthermore, they are meant to decide whether a given resource is
relevant for the topic of complexity and to categorize it by means of
corresponding topical concepts.
        </p>
        <p>Both, the annotation and the categorization tasks rely on an ontology, that
represents the domain knowledge space of complexity. It is implemented as a
SKOS10 taxonomy and shallowly organized within two hierarchical levels - ten
10 http://www.w3.org/TR/skos-reference/
main categories and 297 appendant terms. Furthermore some terms are
interconnected by the relation type related, to express either topical closeness between
two terms or an ambiguity of belonging, when a term could be assigned to more
than one main category. Figure 5 shows an excerpt of the model as taxonomy
circle11. The main categories are displayed in the inner circle, while the outer
circle contains examples of their appendant terms. The connections between some
of the terms are exemplarily for the use of the related relationships.</p>
        <p>Figure 6 visualizes the architectural composition of the Semantic Content
Annotator. It is structured as a parallel working pipeline, utilizing the standard
java concurrency package12 for its implementation. The current pipeline consists
of five components, which are called CompleXys Tasks. The Crawled Content
Reader and the Content Writer take care of an internally valid data structure
and of persistency tasks. In contrast, the inner Complexys Tasks are the actual
processing units. They analyze the resources, extract the semantic data and
finally annotate it back to the text. The analysis is based on existing NLP
services from various contexts. These services are called by using intermediate
GATE modules, so that the Complexys Tasks need not care about the technical
details of the annotation, but just have to adjust the modules according to their
needs and evaluate the solutions.</p>
        <p>Crawled
Content
Reader</p>
        <p>Document
Resources
+Metadata</p>
        <p>Onto Gazetteer</p>
        <p>Annotator
general architecture
GATE
for text engineering</p>
        <p>KEA Annotator
KEA
keyphrase extraction algorithm</p>
        <p>Open Calais
Annotator
CALAIS
PoweredbyThomsonReuters</p>
        <p>Content Writer</p>
        <p>Resources
+Metadata
+Semantics</p>
        <p>The Crawled Content Reader is the first component of the pipeline and its
main purpose is to gather the documents from the input data store and to prepare
them for the succeeding tasks. It wraps the new resources into the internally used
11 The complete ontology can be found at</p>
        <p>portals.de/o/complexys.rdf.
12
http://java.sun.com/j2se/1.5.0/docs/api/java/util/concurrent/packagesummary.html
http://www.minervaGATE data format, embeds them into the corresponding persistency layer and
sends them into an output queue for further processing in the pipeline.</p>
        <p>The Onto Gazetteer Annotator searches the text for keywords, that are listed
in the gazetteer files and annotates found terms with the corresponding
taxonomy concepts. The frequency of occurring annotations can then be used as a
simple indicator for the categorization. The central element of this component
is the OntoGazetteer or semantic tagger, that is included in the information
extraction system ANNIE13. It is not directly applicable to the SKOS CompleXys
taxonomy, but can make use of a derived, rule-based version. Therefore, every
main category of the domain model gets its own .lst gazetteer file, wherein all
subordinate terms are listed one per line. A file mappings.def defines the
mapping rules from the .lst files to SKOS concepts. However, the expressiveness of
the gazetteer data is very limited, so the relationships can not be transformed.</p>
        <p>The KEA Annotator also categorizes a document into the concepts of the
CompleXys domain model. It is based on the Keyphrase Extraction Algorithm
KEA14, that analyzes texts in order to identify the most important words or word
groups for each one. The idea of leveraging this behavior for the task of semantic
data extraction is, that KEA is implicitly capable of scoring terms according to
their text importance. While the OntoGazetteer is capable of answering the
question ”Do taxonomy terms occur in the text and how often?”, KEA goes
one step further and additionally tries to answer ”Are these terms relevant for
the text?”. In order to do so, it utilizes additional factors like the relative term
occurrence in a single text, compared to the occurrence in all processed texts
or the SKOS related relationships as weight boosting functions. To ensure that
the keyphrases are matchable to the domain model anyway, it simply uses the
CompleXys taxonomy as a controlled vocabulary for the extraction process. To
use this functionality the older KEA GATE plugin was manually adapted to the
new KEA version 5.0, which allows the controlled indexing. As categorization
model CompleXys is trained with the CiteULike-180 data set15. First evaluations
indicate, that a well adjusted KEA Annotator is capable of outperforming the
competing OntoGazetteer solution by means of precision.</p>
        <p>The Open Calais Annotator utilizes the OpenCalais16 metatagging web
service to semantically annotate named entities, events and facts in the text. The so
obtained data is not yet used for the domain categorization, but links the data
to the wide external set of Calais’ stored semantical knowledge base. To exploit
these relations has great potential in further improving the categorization, but
also for other features like enriching the displayed resources in the front end with
additional information.</p>
        <p>Finally the Content Writer ensures, that every document is correctly stored
in the Semantic DB, before the pipeline terminates. However, it also checks
if a document has actually exceeded the critical threshold of Onto Gazetteer
13 http://gate.ac.uk/sale/tao/splitch6.html
14 http://www.nzdl.org/Kea/index.html
15 11.01.2010: http://maui-indexer.googlecode.com/files/citeulike180.tar.gz
16 http://www.opencalais.com/
annotations or Kea annotations, that marks the relevancy for the domain of
complexity. If a document fails to pass this test, it is deleted. Furthermore, the
annotations of a document are counted and mapped to their corresponding main
categories. The document is ultimately regarded as being a member of the most
frequently occurring categories.
5</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we have described the CompleXys portal, an information system
about complexity, as an example for a system that allows to automatically
aggregate, semantically annotate and filter content stemming from a wide variety of
sources. We believe that in times of a rapidly growing amount of content that is
being dynamically created in ever increasing rates, such systems are an absolute
necessity to ensure that users do not “drown in information” and at the same
time do not miss relevant information. Only with such intelligent support will
we be able to take advantage of this information revolution.</p>
      <p>
        Up to now, the parts of CompleXys dealing with information harvesting,
annotating and filtering have been implemented. A first evaluation shows that
CompleXys reaches, indeed reasonable precision and recall with acceptable
runtime. For more details please refer to [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Right now, we are working on
integrating our approach to personalization into CompleXys. Once this has been
done, the portal will be launched as an information site for the members of the
research focus area “Analysis and Management of Complex Systems” at our
university and for the general public.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>F.</given-names>
            <surname>Bakalov</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          <article-title>K¨onig-</article-title>
          <string-name>
            <surname>Ries</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Nauerz</surname>
            , and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Welsch</surname>
          </string-name>
          .
          <article-title>A Hybrid Approach to Identifying User Interests in Web Portals</article-title>
          .
          <source>In Proc. of the 9th Int. Conf. on Innovative Internet Community Systems</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>F.</given-names>
            <surname>Bakalov</surname>
          </string-name>
          ,
          <string-name>
            <surname>B.</surname>
          </string-name>
          <article-title>K¨onig-</article-title>
          <string-name>
            <surname>Ries</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Nauerz</surname>
            , and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Welsch</surname>
          </string-name>
          .
          <article-title>IntrospectiveViews: An interface for scrutinizing semantic user models</article-title>
          .
          <source>In Proc. of the 18th Int. Conf. on User Modeling</source>
          , Adaptation, and
          <string-name>
            <surname>Personalization</surname>
          </string-name>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>R.</given-names>
            <surname>Baumgartner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Henze</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Herzog</surname>
          </string-name>
          .
          <article-title>The Personal Publication Reader: Illustrating web data extraction, personalization and reasoning for the semantic web</article-title>
          .
          <source>In Proc. of the 2nd European Semantic Web Conference</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>V.</given-names>
            <surname>Tablan</surname>
          </string-name>
          .
          <article-title>GATE: A framework and graphical development environment for robust nlp tools and applications</article-title>
          .
          <source>In Proc. of the 40th Anniversary Meeting of the Association for Computational Linguistics (ACL'02)</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>E.</given-names>
            <surname>Desmontils</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Jaquin</surname>
          </string-name>
          .
          <article-title>Indexing a web site with a terminology oriented ontology</article-title>
          .
          <source>In The Emerging Semantic Web</source>
          , pages
          <fpage>181</fpage>
          -
          <lpage>197</lpage>
          . IOS Press,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Dolog</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Henze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sintek</surname>
          </string-name>
          .
          <article-title>Personalization in distributed elearning environments</article-title>
          .
          <source>In Proc. of the 13th Int. World Wide Web Conf.</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>McCool</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and E.</given-names>
            <surname>Miller</surname>
          </string-name>
          .
          <article-title>Semantic search</article-title>
          .
          <source>In Proc. of the 12th Int. Conf. on World Wide Web</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>S.</given-names>
            <surname>Handschuh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Staab</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ciravegna. S-CREAM -</surname>
          </string-name>
          Semi
          <article-title>-automatic CREAtion of Metadata</article-title>
          .
          <source>In Proc. of the 13th Int. Conf. on Knowledge Engineering and Knowledge Management</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>A.</given-names>
            <surname>Kiryakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Popov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Terziev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Manov</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Ognyanoff</surname>
          </string-name>
          .
          <article-title>Semantic annotation, indexing, and retrieval</article-title>
          .
          <source>Journal of Web Semantics</source>
          ,
          <volume>2</volume>
          (
          <issue>1</issue>
          ):
          <fpage>49</fpage>
          -
          <lpage>79</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>M. Kowalkiewicz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Kaczmarek</surname>
            , and
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Abramowicz</surname>
          </string-name>
          .
          <article-title>MyPortal: robust extraction and aggregation of web content</article-title>
          .
          <source>In Proc. of the 32nd Int. Conf. on Very Large Data Bases</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>M.</given-names>
            <surname>Lalmas</surname>
          </string-name>
          and V. Murdock, editors.
          <source>Proc. of the Workshop on Aggregated Search held in conj. with the 31st Int. ACM SIGIR Conf.</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>D.</given-names>
            <surname>Maynard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tablan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Bontcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Cunningham</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wilks. MUSE:</surname>
          </string-name>
          <article-title>a MUlti-Source Entity recognition system</article-title>
          .
          <source>Computers and the Humanities</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>M.J.</given-names>
            <surname>Pazzani</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Billsus</surname>
          </string-name>
          .
          <article-title>Content-based recommendation systems</article-title>
          .
          <source>In The Adaptive Web: Methods and Strategies of Web Personalization</source>
          , chapter
          <volume>10</volume>
          , pages
          <fpage>325</fpage>
          -
          <lpage>341</lpage>
          . Springer,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>B.</given-names>
            <surname>Popov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kiryakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ognyanoff</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Manov</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A. Kirilov. KIM</surname>
          </string-name>
          <article-title>a semantic platform for information extraction and retrieval</article-title>
          .
          <source>Natural Language Engineering</source>
          ,
          <volume>10</volume>
          (
          <issue>3-4</issue>
          ):
          <fpage>375</fpage>
          -
          <lpage>392</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>O.</given-names>
            <surname>Schimratzki</surname>
          </string-name>
          .
          <article-title>An approach for semantic enrichment of social media resources for context dependent processing</article-title>
          ,
          <source>Diploma Thesis</source>
          , University of Jena,
          <year>2010</year>
          . Fulltext: http://www.minerva-portals.de/publications/theses/an
          <article-title>-approachfor-semantic-enrichment-of-social.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>M.</given-names>
            <surname>Shilman</surname>
          </string-name>
          .
          <article-title>Aggregate documents: making sense of a patchwork of topical documents</article-title>
          .
          <source>In Proc. of the 8th ACM Symp. on Document Engineering</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wanga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Stash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Aroyoa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gorgels</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rutledge</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Schreiber</surname>
          </string-name>
          .
          <article-title>Recommendations based on semantically enriched museum collections</article-title>
          .
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ):
          <fpage>283</fpage>
          -
          <lpage>290</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>