<!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>The Path is the Destination { Enabling a New Search Paradigm with Linked Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jorg Waitelonis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Magnus Knuth</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lina Wolf</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Johannes Hercher</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Harald Sack</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Hasso-Plattner-Institute Potsdam</institution>
          ,
          <addr-line>Prof.-Dr.-Helmert-Str. 2</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Today, searching the World Wide Web in most cases turns out in looking for a speci c item, which means that the user should know the item in advance. In the future internet, searching for information comes closer to the notion of 'window shopping' by means of exploratory and semantic search technologies. In the course of the exploratory search process the user constantly receives new information and establishes a personalized knowledge base. To make this possible, semantic search technologies utilize domain knowledge and semantic data, as e.g., Linked Open Data (LOD), to expand and re ne search results, to derive cross-references, and to reveal implicitly hidden semantic relations. Implementing semantic exploratory search requires various issues have to be solved including mapping text to semantic entities, detecting and cleaning inconsistencies in available LOD, ranking algorithms for semantic data and heuristics for recommendations, as well as appropriate visualizations of complex semantic relationships. This paper describes how LOD can be utilized to enable exploratory search systems for the future internet.</p>
      </abstract>
      <kwd-group>
        <kwd>exploratory search</kwd>
        <kwd>linked open data</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>When it comes to searching the World Wide Web (WWW, web), you should
know what you are looking for. Today's web search engines take a query phrase
consisting out of one or several key terms as input and deliver a huge set of
documents that contain these key terms. The result set is presented as an ordered
list in descending relevance and accuracy. To express her information needs to
the search engine the user has to think of appropriate key terms. But what,
if the user is not familiar with the search domain? What, if she doesn't know
how to express her information needs? What, if she simply wants to know what
information is available for a speci c knowledge domain? These tasks are almost
intractable with current web search engines. This is because of two facts: First,
the information already available in the WWW is far too large to maintain an
overview of all documents concerning a certain topic. Almost nobody will look
up more than the few rst pages of achieved search results. Secondly, current
search engines most times neglect the meaning of the document content. Thus,
it is not possible to deduct nearby cross-connections towards meaningful
information, which is closely connected to the user's search request and potentially
the solution of his original information needs.</p>
      <p>The emergence of semantic web technologies enables the machine
understandable representation of knowledge encoded in web documents. With the Linking
Open Data (LOD) initiative1 large resources of publicly available structured
data from various domains have been tripli ed to become interlinked RDF(S)
datasets. This Linked Data provides machine understandable semantics to enable
the simple deduction of cross-connections between data. Natural Language
Processing (NLP) technologies, media analysis, and statistics are applied to detect
semantic entities and their relationships in multimedia web documents. Taking
this into account, a semantic search engine should be able not only to deliver
results of higher precision and recall, but also to give suggestions on what is
nearby as regards to content and meaning. Thus, truly explorative search will
become possible, enabling the user to discover and to explore knowledge that is
hidden in web documents, and to solve complex search tasks. The Concept of
exploratory search and related work is covered with in Section 2.</p>
      <p>But, one of the basic prerequisites for the technical realization of an e cient
exploratory semantic search engine is accuracy and correctness of the underlying
data. This means that if a semantic search engine is build on top of linked data,
the obtained search results and exploratory recommendations can only be as
good as the quality of the underlying data sources and entities that are to be
connected with the web document content.</p>
      <p>
        We are not the rst, who have identi ed serious aws in current LOD
resources [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ], esp. in DBpedia2 as its central hub. These aws stem from
structural, syntactic, and semantic inconsistencies, ambiguities, and missing
information that have to be resolved to enable an advantage over traditional keyword
based search technologies and to fully exploit the potential of exploratory
semantic search. How linked data is used to enable exploratory semantic search is
explained in Section 3. Flaws and de ciencies in current linked data resources
esp. with regard to exploratory semantic search are discussed in Section 4. The
concluding Section 5 exempli es our e orts to cope with the problems raised and
points out future work. Building on adjusted and validated linked data resources
exploratory search will complement today's web search fostering the exploration
of knowledge in the future internet.
1 http://esw.w3.org/SweoIG/TaskForces/CommunityProjects/LinkingOpenData
2 http://dbpedia.org/
      </p>
    </sec>
    <sec id="sec-2">
      <title>Exploratory Search as a New Search Paradigm</title>
      <p>
        With the growing amount of information available in the WWW a few keywords
typed into an input box resulting in a unidirectional list of documents have
become insu cient to ful ll all of the user's information needs. The web generally
supports information seeking strategies such as browsing on-the- y, selection,
and navigation by trial and error. The user's expectations from search engines
have therefore turned from the pure lookup-search to more exploratory search
strategies including learning and investigation [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
      </p>
      <p>
        Exploratory search supports users in investigating the data space in depth
as well as in broadness. In keyword-based search the target is known and the
process of re ning the search should reach the desired target as fast as possible
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. In contrast, exploratory search assists the user in spotting a domain along
variant paths [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. The user can move backwards and forwards on alternative
search paths and can thereby access all underlying and related data.
      </p>
      <p>
        According to Marchionini search activities can be grouped in \lookup", \learn",
and \investigation" [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. While he considers keyword based search as su cient
for a lookup search (fact retrieval, question answering etc) to learn and to
investigate are exploratory search activities. Learning searches are an iterative
process returning various facts and media. Investigation searches can last over
an extended period of time and therefore require multiple search sessions.
Furthermore, exploratory search can involve multiple people collaboratively working
together as White et al. point out [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>In the keyword based search only content, whose keywords are known can
be found. If the user is not experienced in the domain of the search topic the
appropriate keywords for the search are di cult to devise.</p>
      <p>
        Applying facetted search the user starts with a general keyword and re nes
the search results in an iterative lter process. Stefaner et al. published the
facetted search interface \elastic-lists" [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. It supports searching from general
to special terms, navigation by selection, and trial and error by search path
backtracking. However, using facetted search only, the user mainly encounters
knowledge available in the documents already achieved by the underlying
keyword based search. An exploratory search additionally has to enable the user to
nd nearby and related topics.
      </p>
      <p>Explorative search is able to discover knowledge related to the original search
topic in addition to the re ning process of facetted search. In contrary to the
keyword-based search, exploratory search requires active user involvement in
several iterations. While the result of a keyword based search is only linear, the
output of an exploratory search can be multi dimensional, such as e. g. linear
or clustered search results, new facets, and related topics. Therefore, new user
interfaces are needed to visualize search results and data relations to assist user
interaction in the exploratory search process.</p>
    </sec>
    <sec id="sec-3">
      <title>How to Support Exploratory Search with LOD</title>
      <p>Exploratory search comprises methods to recommend alternative search paths
and to suggest of related information to the original search results. To determine
these cross-connections further information that enables the exploration of the
repository, semantic technologies are used to implement exploratory semantic
search.</p>
      <p>For exploratory semantic search, the basis for exploration among other is
constituted by LOD resources and relations. To expand and re ne the search
results and to enable following new search paths, search queries as well as search
results have to be aligned to semantic entities that are interlinked by content
based relationships. This facilitates to extend the search scope by the option
to investigate the semantic context, di erent time references, or geographical
references that are related to the search query or to the original search results.</p>
      <p>
        The semantic exploitation of a repository, whether it is comprising textual
or multimedia data, requires the content of its documents to be mapped to
corresponding semantic entities. This mapping process is denoted as named entity
recognition. In rst place, it comprises the detection of named entities in the
resource metadata or in the resource itself, if represented in textual format. These
named entities are extracted with the help of linguistic techniques (Natural
Language Processing, NLP) and are mapped to semantic entities from LOD resources
(entity mapping). Named entities might be mapped to various semantic entities
with di erent meanings. These ambiguities are caused by the natural language
phenomenon of polysemy and can be solved by word sense disambiguation based
on additional contextual information [
        <xref ref-type="bibr" rid="ref14 ref2 ref5 ref7">2, 5, 7, 14</xref>
        ].
      </p>
      <p>
        In contrast to straight RDF search engines such as 'sindice' or 'sig.ma' [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], it
is now possible to search for documents and semantic entities at the same time.
Semantic entities assigned to documents extend the capabilities of traditional
keyword based search by:
{ true semantic facetted browsing to lter search results,
{ extension of the query string with related entities and keywords, and
{ recommendations of related documents and further search suggestions by
following cross connections.
      </p>
      <p>
        Search results can be reorganized and classi ed by clustering their entities, or
assigning corresponding documents to (super-)classes and categories of the
contained entities.Compared to the rather uni-dimensional search results in
keywordbased search, it is now possible to follow relations in multiple directions. For
instance, Fig. 1 shows an example of three related entities in DBpedia. If the
user's original search is targeted for the British author 'Aldous Huxley', the user
might also be interested in the works of the authors 'H.G. Wells' or 'George
Orwell', which both share the Huxley's underlying Yago [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] class and are related to
him by the 'in uences' relationship. Properties such as 'in uences' can be used
to move hand over hand through the underlying RDF graph, while exploring the
repository documents.
      </p>
      <p>Aldous Huxley</p>
      <p>George Orwell
dbpedia:ontology/influences</p>
      <p>dbpedia:ontology/influences
rdfs:type
rdfs:type</p>
      <p>rdfs:type</p>
      <p>Yago:EnglishScienceFictionWriters</p>
      <p>
        Furthermore, entities related by time or geographical location provide a
chronological or geographical classi cation accordingly. Time always refers to
di erent modalities, as e. g., when a document was created, when it was
published, or content based time-references. In a similar way, geographical-references
can refer to di erent modalities, as e. g., where a document is located, where it
was produced, and published, or to content based geographical references.These
multimodal subtleties also require an adaption of the search interfaces. Far away
from the paradigm of simple linear search result lists, new and more expressive
navigational features, such as (RDF-)graph-visualizations, cluster-maps,
geomaps, and time-lines support the user in perceiving the information. Because
of the high diversity w. r. t., the visualization relationships between entities, the
interfaces have to be highly generic. This requires methods to prioritize and
visually structure the information displayed to the user in general, according to
the user's personal interests. Therefore, it is necessary to develop importance
respective the relevance of related entities. For example, to visualize information
about the DBpedia entity 'Albert Einstein' more than 600 facts (RDF triples)
do exist. This amount of information cannot be presented to the user all at a
glance. Heuristics based on statistical and semantic analysis of the underlying
RDF graph structure are applied to rank related entities according their
relevance [
        <xref ref-type="bibr" rid="ref11 ref12">12, 11</xref>
        ]. In addition, every user might have di erent preferences. Thus, the
relevance rankings have to be personalized. The user's behavior can be tracked by
log- le analysis. Together with the user's preferences a pro le can be generated
and mapped to an LOD sub graph, representing the user's interests. This enables
a subjective relevance ranking and allows personalized search recommendations.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Issues on Using LOD to Support Exploratory Search</title>
      <p>
        One essential prerequisite to achieve satisfactory search results for semantic
exploratory search according to our approach as described in the previous section
is the provision of consistent and complete knowledge bases. A serious weakness
of LOD data sets is their lack of data integrity and preciseness [
        <xref ref-type="bibr" rid="ref3 ref4">4, 3</xref>
        ], whereas
quality strongly di ers between single data sets.
      </p>
      <p>In LOD there is no such thing as a consistent category system. This
shortcoming makes it di cult to identify all resources of a given type. Resources often
are not explicitly typed (by using rdf:type property) to those classes they
belong to. Solving this issue becomes a forensic investigation, since in the majority
of cases, types of an entity only can be deduced from the domain and range of
the properties the resource is used with.</p>
      <p>To wait for the data producers to upgrade their data is not a suitable solution.
Therefore, methods are required to achieve improved semantic richness, higher
quality, and completeness of linked data. Such a linked data `washing machine'
performing data cleansing on very large knowledge bases needs to implement e
cient and scalable algorithms. Scalability for highly parallel and cloud computing
technologies, as e. g., the HPI Future SOC Lab infrastructure3, is mandatory to
address and to solve this problem in an appropriate way.</p>
      <p>
        Likewise, the performance of large-scale RDF data management has to be
improved, because current triple store systems are many times less e cient
compared to relational data management systems [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Not least for this reason, it
is currently good practice to reduce processing complexity by extracting only
a subset of the LOD cloud, processing it o ine, and store it in a precomputed
index, which in turn impairs the requirement for completeness and exibility.
One solution for this issue is the development of adaptive indexing and caching
strategies.
      </p>
      <p>Another issue is, how to deal with contentual gaps. The LOD cloud is far
from being a comprehensive and complete mirror of available information, if ever
achievable at all. However, some gaps might be closed by deductive reasoning to
generate complementing RDF statements on existing data.</p>
      <p>The success of exploratory semantic search and linked data as such heavily
depends on accessible and user-friendly interfaces to visualize (intermediate)
results and relations between entities. To take advantage of the rich structure of
linked data, user interfaces have to display all relevant information to aggregate
interrelations and to hide negligible facts depending on the context. Evaluation
of such new technologies requires a reliable database of sound ground truth data,
which is hard to come by. Allowing users to give immediate feedback on search
results establishes a possible way to achieve this.</p>
      <p>There is a ne line between usability and expressivity in semantic web based
search. User interaction overall needs to become more intuitive, especially for
building expressive queries, which have to be generated in the background by
means of elementary user actions without neglecting more complex requests.</p>
      <p>Furthermore exploratory search has to be personal. To enable personalized
exploratory search results one has to keep track of provenance information
beyond metadata while ensuring compliance with privacy requirements.</p>
      <sec id="sec-4-1">
        <title>3 http://www.hpi.uni-potsdam.de/forschung/future soc lab.html</title>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>By harnessing the meaning of content associative, facetted, and exploratory
search interfaces can be developed providing high quality search results (by
means of recall and precision). The Linking Open Data (LOD) initiative has
engaged various communities to share their data for sustainable usage based on
semantic web technologies. However, the publicly available LOD datasets often
do not meet mandatory quality requirements. The future internet will be based
on semantic technologies that enable information access in a content-based way
by including formal semantics in a machine understandable manner. Therefore,
LOD resources require thorough analysis and subsequent bug xing or
refurbishing as we have pointed out in the previous chapters. Our current research
focusses on analysis and cleansing LOD resources on structural and syntactical
level as well as on semantical and contentual level. We tackle these issues with
the help of the infrastructure of the HPI Future SOC Lab that provides
computing resources with main memory on terabyte level to cope with the necessary
large-scale processing. To deduce cross-connections to meaningful information
related to the user's information needs we apply refurbished datasets of the LOD
cloud to build on and propose an exploratory search paradigm. Exploratory
semantic search is based on generic facets, enabling the user to better re ne and
broaden search queries and to provide content-based recommendations. A
prototype implementation of the exploratory search featurefocussing on academic
video search is publicly available4 and subject of ongoing research. By shifting
the current paradigm of web search from simple keyword based search that
provides satisfactory results as long as the user knows what exactly she is looking
for, to an exploratory approach, web search is becoming a quest for knowledge,
guiding the user along new pathways to serendipitous ndings.</p>
      <sec id="sec-5-1">
        <title>4 http://mediaglobe.yovisto.com:8080/</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schultz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Berlin SPARQL Benchmark</article-title>
          .
          <source>Int. J. Semantic Web Inf. Syst</source>
          .
          <volume>5</volume>
          (
          <issue>2</issue>
          ),
          <volume>1</volume>
          {
          <fpage>24</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bunescu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pasca</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Using Encyclopedic Knowledge for Named Entity Disambiguation</article-title>
          .
          <source>In: Proc. of the 11th Conf</source>
          .
          <article-title>of the European Chapter of the Assoc. for Computational Linguistics (EACL2006), Trento</article-title>
          ,
          <source>Italy (Apr</source>
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shinavier</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shangguan</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuinness</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data</article-title>
          .
          <source>In: 9th Int. Semantic Web Conference (ISWC2010)</source>
          . Shanghai, China (Nov
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Passant</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Weaving the Pedantic Web</article-title>
          .
          <source>In: Proc. of the Linked Data on the Web (WWW2010) Workshop (LDOW</source>
          <year>2010</year>
          ). Raleigh, North Carolina, USA (Apr
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morie</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Semantic Integration in Text { From Ambiguous Names to Identi able Entities</article-title>
          .
          <source>AI Magazine</source>
          <volume>26</volume>
          (
          <issue>1</issue>
          ),
          <volume>45</volume>
          {
          <fpage>58</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Marchionini</surname>
          </string-name>
          , G.:
          <article-title>Exploratory Search: From Finding to Understanding</article-title>
          .
          <source>Commun. ACM</source>
          <volume>49</volume>
          (
          <issue>4</issue>
          ),
          <volume>41</volume>
          {
          <fpage>46</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Navigli</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velardi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Structural Semantic Interconnections: A Knowledge-Based Approach to Word Sense Disambiguation</article-title>
          .
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          <volume>27</volume>
          (
          <issue>7</issue>
          ),
          <volume>1075</volume>
          {1086 (Jul
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Stefaner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Urban</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seefelder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Elastic Lists for Facet Browsing and Resource Analysis in the Enterprise</article-title>
          .
          <source>In: Int. Workshop on Database and Expert Systems Applications (DEXA2008)</source>
          , Turin,
          <source>Italy (Sep</source>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kasneci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikumun</surname>
          </string-name>
          , G.:
          <article-title>YAGO: A Core of Semantic Knowledge Unifying WordNet and Wikipedia</article-title>
          .
          <source>In: Proc. of the 16th Int. World Wide Web Conf. (WWW2007)</source>
          , Ban , Canada (May
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Tummarello</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delbru</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oren</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Sindice.com: Weaving the Open Linked Data</article-title>
          .
          <source>In: Proc. of the Int. Semantic Web Conference (ISWC2007)</source>
          . Busan, South Korea (
          <year>Nov 2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Waitelonis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sack</surname>
          </string-name>
          , H.:
          <article-title>Augmenting Video Search with Linked Open Data</article-title>
          .
          <source>In: Proc. of Int. Conf. on Semantic Systems 2009 (i-semantics2009)</source>
          . Graz,
          <string-name>
            <surname>Austria</surname>
          </string-name>
          (Sep
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Waitelonis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sack</surname>
          </string-name>
          , H.:
          <article-title>Towards Exploratory Video Search Using Linked Data</article-title>
          .
          <source>In: Proc. of the 2009 11th IEEE Int. Symp. on Multimedia (ISM2009)</source>
          . Washington, DC, USA (Dec
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>White</surname>
            ,
            <given-names>R.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          :
          <article-title>Exploratory Search: Beyond the Query-Response Paradigm</article-title>
          .
          <source>No. 3 in Synthesis Lectures on Information Concepts</source>
          , Retrieval, and Services, Morgan &amp; Claypool Publishers (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fung</surname>
            ,
            <given-names>G.P.:</given-names>
          </string-name>
          <article-title>A Term-Based Driven Clustering Approach for Name Disambiguation</article-title>
          .
          <source>In: Proc. of the Joint Int. Conf. on Advances in Data and Web Management (APWeb/WAIM2009)</source>
          . Suzhou,
          <string-name>
            <surname>China</surname>
          </string-name>
          (Apr
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>