<!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>tFacet: Hierarchical Faceted Exploration of Semantic Data Using Well-Known Interaction Concepts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sören Brunk</string-name>
          <email>soren.brunk@deri.org</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Philipp Heim</string-name>
          <email>philipp.heim@vis.uni-stuttgart.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Digital Enterprise Research Institute, National University of Ireland</institution>
          ,
          <addr-line>Galway</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institute for Visualization and Interactive Systems (VIS), University of Stuttgart</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>31</fpage>
      <lpage>36</lpage>
      <abstract>
        <p>Information stored in the Semantic Web is becoming more and more interesting for average Web users. Due to the complexity of existing tools, however, accessing it is difficult. In this paper we therefore introduce tFacet, a tool that uses well-known interaction concepts to enable hierarchical faceted exploration of semantic data for non-experts. The aim is to facilitate the formulation of semantically unambiguous queries to allow a faster and more precise access to information in the Semantic Web for the broader public.</p>
      </abstract>
      <kwd-group>
        <kwd>Faceted exploration</kwd>
        <kwd>faceted search</kwd>
        <kwd>Semantic Web</kwd>
        <kwd>known interaction concepts</kwd>
        <kwd>hierarchical facets</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        The amount of information available as semantic data is growing rapidly. As of June
2011, the Linking Open Data (LOD) cloud [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], for instance, contained more than 200
different datasets. The most popular dataset within the LOD cloud is the DBpedia
dataset [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. It contains structured information that is extracted from Wikipedia articles
and converted into a semantic representation. It is publicly accessible via the SPARQL
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] query language, allowing for semantically unambiguous access. In comparison to
the often ambiguous text search, it allows the formulation of more complicated
requests accurately and thus supports targeted and quick access to information.
      </p>
      <p>
        A disadvantage of using SPARQL is, however, that users have to learn the
language first in order to access information through SPARQL queries; making it
rather a language for experts. In order to meet the needs of all users, a simpler user
interface is required to create semantically unambiguous and complex queries without
the need to learn the complex syntax of a query language. One approach to solve this
problem is based on the concept of faceted exploration [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In faceted exploration, the
user always sees all remaining search options within the search process and can select
them step-by-step in order to refine the query.
      </p>
      <p>
        Several applications exist that implement the concept of faceted exploration in
order to allow users to access semantic data. Examples are mSpace [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Parallax [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ],
Faceted Wikipedia Search [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] or gFacet [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Most existing applications, however,
don’t use the full potential of faceted exploration in combination with semantic data
and thus lack the ability to create powerful queries. Others allow the creation of more
complex queries but are often difficult to use. mSpace and Faceted Wikipedia Search,
for example, are easy to use, but they don’t support the creation of hierarchical facets;
that is, facets that are connected to the results through indirect attributes. In contrast,
Parallax and gFacet do support hierarchical facets. However, the creation of those can
be difficult for inexperienced users due to the use of new and unfamiliar interaction
concepts within these tools.
      </p>
      <p>For that reason we introduce tFacet, a tool that uses well-known interaction
concepts in order to make the power of faceted exploration available also for
inexperienced users.</p>
    </sec>
    <sec id="sec-2">
      <title>2 tFacet</title>
      <p>
        tFacet, like the other tools, uses the concept of faceted exploration to access semantic
data. However, it thereby applies interaction concepts that are well-known from other
applications and thus allows the widespread use of already existing knowledge in the
formulation of semantically unique queries. It is implemented using the Adobe Flex
Framework [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and therefore runs in any Web Browser with the Flash plugin. Using
SPARQL as the query language allows for faceted exploration of any RDF dataset
accessible via a SPARQL endpoint. By default tFacet uses the DBpedia dataset but
can be easily configured to access other datasets as well.
      </p>
      <sec id="sec-2-1">
        <title>2.1 Initial Search Space Limitation</title>
        <p>Each exploration within tFacet starts with an initial limitation of the search space.
This step is necessary to reduce the number of possible results as well as the number
of facets to a displayable amount. The user selects a base result class from a tree
representation of all classes contained in the dataset. The better the user knows what
he is looking for, the more precisely he can restrict the search space. For example in
the DBpedia Ontology he could select “Eurovision song contest entry” as a very
specific base class limiting the search space to 1054 objects. On the other hand, if he
is not able to specify his search goal in detail in advance, he could choose a more
abstract base class such as “film”; containing 53619 objects (see Figure 1).
By pre-selecting a base class, the exploration is limited to objects of that class. Thus
in Figure 2 only objects of the class “film” are displayed in the result set (A). On the
left side a directory tree representation of facets is shown. It displays all facets that
can be used to filter objects in the result set. At first, only the top hierarchy of the tree
is visible, containing all facets related to direct attributes of the result set. In case of
films, for instance, it contains facets such as directors or actors of the corresponding
movies. In addition, some elements of the tree can be expanded in order to show
lower hierarchy levels with additional facets. Those facets refer to indirect attributes
of the result set. For movies these could be, for example, the birthplace of the director
of the movie.</p>
        <p>The user now can select individual facets from the tree to show the facet’s detail
view in the right area (Figure 2, C). Facets in the detail view are arranged vertically
and always contain all remaining search options as selectable attributes to explore or
filter the result set. By selecting individual attribute values, the result set is reduced to
objects having that value. For instance, by selecting a director, the result set is filtered
to show only movies from that director. Attributes in different facets are combined
using the AND-operator while attributes within one facet are combined using the
ORoperator. In this manner, the result set can be refined iteratively until the information
wanted has been found.</p>
        <p>In addition to the result set, a filter operation also updates all other facets that are
shown in the detail view. All attributes that would lead to an empty result set when
selected are hidden. Furthermore, the expected number of results when selecting a
certain attribute is shown in brackets besides this attribute. This feature helps to avoid
dead-ends and allows a user to estimate the outcome of a specific filter operation.</p>
        <p>All facets available in the directory tree can be extracted automatically from
semantic data by using SPARQL queries. All properties of the selected base class are
collected and displayed in the tree. If a property leads to a literal this is represented by
a document symbol in the tree and cannot be further explored (see “release date” in
Figure 2, B). If a property leads to objects of another ontological class it is
represented by a directory symbol and can be further explored (see “director: Person”
in Figure 2, B). The name of such a sub-directory is composed of two components:
(1) the type of the property (here “director”) and (2) the class of the objects (here
“Person”). Representing object properties as sub-trees allows also deeply nested
information to be used for faceted exploration. In this way, the birthplaces of the
directors of the movies in the result set can be used as hierarchical facet to show, for
example, only movies that were directed by directors born in Stuttgart (Figure 2, C).</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.3 Additional Columns</title>
        <p>Until now we have used the linked structure of the Semantic Web only for faceted
exploration. It is also possible to use this structure to enhance the presentation of the
result set by additional details. To demonstrate this, tFacet implements a functionality
that allows users to add additional columns to both the result set as well as the facets
and also to use those columns for sorting.</p>
        <p>In order to add an additional column, the user can click the button "Visible
Properties" to see all properties and choose the ones that should be visible in the list
(Fig. 2, D). For example, in this way it is possible to use information about the actors
of a movie ("Starring") both to filter and sort the result set. Furthermore, having the
properties available as additional columns allows the relations between information to
be directly visible for the user (e.g. the relations between movies and actors) in
contrast to the separated representation via facets.</p>
        <p>But often there is more than one value for a property (e.g. usually more than one
actor plays in a movie). In that case, the current implementation of tFacet uses a
simple list to display multiple values. This can cause problems however, if many
values exist for a property, for example, if a movie has many actors. To avoid this
problem an abbreviated list could be shown initially or just the number of entries,
with the possibility to expand the view if necessary. With numerical data it would also
be possible to show an aggregated view.</p>
        <p>In general, the idea of additional columns is not only limited to direct properties,
but can be implemented also for indirectly related properties. For that, one could
imagine displaying a directory tree like in Fig. 2 D to select information only
connected indirectly. However, one problem with such an implementation would be
how to maintain the clarity of the presentation as many trees and their hierarchical
directory structures could confuse the user more than help him create search requests.
2.4</p>
      </sec>
      <sec id="sec-2-3">
        <title>Well-known interaction concepts</title>
        <p>tFacet uses several interaction concepts that are known from common applications in
order to ease the use of faceted exploration. The most important ones are:
Directory tree: In many applications, directory trees are used for the navigation in
and the management of hierarchical data. A logical conclusion was therefore the
representation of hierarchical facets in a directory tree within tFacet. Like in
popular file managers, nodes shown as folder symbol can be explored further while
nodes shown as file symbol represent a leaf node.</p>
      </sec>
      <sec id="sec-2-4">
        <title>Subdivision of the user interface into three parts: Also, a partitioning of the user</title>
        <p>interface into an overview (directory tree), a detailed view (right pane) and a result
view is frequently used. The possibility to show multiple detail views (in this case
facets) at the same time is not widespread, for the definition of filters in more than
one facet, however, necessary.</p>
        <p>Organization into columns: In many grid-based applications (for example, in
Windows or Mac OS applications) the user can determine individually, which
columns are of interest for him and have these displayed. In a similar way in tFacet
he can display a menu of all properties he might be interested in and add or remove
individual columns. The same is true for sorting by individual columns by clicking
on the column header.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3 Summary and Future Work</title>
      <p>In this paper, we proposed tFacet, a new application to enable all users to create
semantically unambiguous search requests using the concept of faceted exploration.
The aim was to enable the full potential of this concept by keeping its usage as simple
as possible through the use of well-known interaction concepts. Through the use of a
directory tree even remote information can be included in the query as hierarchical
facets and the possibility to show connected properties in additional columns
facilitates control over the level of detail of the information displayed.</p>
      <p>Thus, tFacet offers interesting approaches to make the potential of semantic data
accessible for everyone. A key part of this is the strategy to transfer already known
concepts into the specific interaction environment of the Semantic Web.</p>
      <p>In the future we plan further development of tFacet to make its usage even simpler.
For example, data-specific visualizations, such as sliders or maps could be used to
ease the creation of queries and improve the presentation of results. An integration of
the approaches discussed in Section 2.3 to extend the columns functionality to use
hierarchical properties could be useful for a consistent and powerful implementation
of this concept. Furthermore, an evaluation of the user interface would be helpful,
especially to see if the use of known interaction concepts can help users to reach their
goal faster. Including a comparison to similar tasks and tools in order to measure
empirically, whether the intended goal of tFacet, a simplified usage, has been
achieved.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. LOD cloud (
          <year>2010</year>
          ): http://richard.cyganiak.de/2007/10/lod/lod-datasets_
          <fpage>2010</fpage>
          -09-22.html
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kobilarov</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ; Cyganiak,
          <string-name>
            <given-names>R.</given-names>
            ;
            <surname>Ives</surname>
          </string-name>
          ,
          <string-name>
            <surname>Z.</surname>
          </string-name>
          :
          <article-title>DBpedia: A Nucleus for a Web of Open Data</article-title>
          .
          <source>In: Proc. of the 6th ISWC</source>
          <year>2008</year>
          ,
          <year>2008</year>
          , pp.
          <fpage>722</fpage>
          -
          <lpage>735</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>SPARQL</surname>
          </string-name>
          (
          <year>2008</year>
          ): http://www.w3.org/TR/rdf-sparql-query/
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Yee</surname>
          </string-name>
          , K.-P.;
          <string-name>
            <surname>Swearingen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Faceted metadata for image search and browsing</article-title>
          .
          <source>In: Proc. of the CHI</source>
          <year>2003</year>
          , ACM Press,
          <year>2003</year>
          ; pp.
          <fpage>401</fpage>
          -
          <lpage>408</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Schraefel, m.c.;
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Owens</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ; Wilson,
          <string-name>
            <surname>M.:</surname>
          </string-name>
          <article-title>The evolving mSpace platform: leveraging the semantic web on the trail of the memex</article-title>
          .
          <source>In: Proc. of Hypertext</source>
          <year>2005</year>
          , ACM Press,
          <year>2005</year>
          ; pp.
          <fpage>174</fpage>
          -
          <lpage>183</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Huynh</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Karger</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Parallax and companion: Set-based browsing for the Data Web (</article-title>
          <year>2009</year>
          ). http://davidhuynh.net/media/papers/2009/www2009-parallax.pdf
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hahn</surname>
            , R.; Bizer,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Sahnwaldt</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Herta</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Robinson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Bürgle,
          <string-name>
            <given-names>M.</given-names>
            ;
            <surname>Düwiger</surname>
          </string-name>
          ,
          <string-name>
            <surname>H.</surname>
          </string-name>
          ; Scheel,
          <string-name>
            <surname>U.</surname>
          </string-name>
          :
          <article-title>Faceted Wikipedia Search</article-title>
          .
          <source>In: Proc. of BIS</source>
          <year>2010</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Heim</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ; Ertl,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Ziegler</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          : Facet Graphs:
          <article-title>Complex Semantic Querying Made Easy</article-title>
          .
          <source>In: Proc. of the 7th Extended Semantic Web Conference (ESWC2010)</source>
          ,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , Springer,
          <year>2010</year>
          , pp.
          <fpage>288</fpage>
          -
          <lpage>302</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Adobe</given-names>
            <surname>Flex</surname>
          </string-name>
          (
          <year>2011</year>
          ): http://www.adobe.com/de/products/flex/
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>