<!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>Towards a Framework for Adaptive Faceted Search on Twitter</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ilknur Celik</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fabian Abel</string-name>
          <email>abelg@tudelft.nl</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Patrick Siehndel</string-name>
          <email>siehndel@l3s.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>L3S Research Center, Leibniz University Hannover</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Web Information Systems, Delft University of Technology</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In the last few years, Twitter has become a powerful tool for publishing and discussing information. Yet, content exploration in Twitter requires substantial e orts and users often have to scan information streams by hand. In this paper, we approach this problem by means of faceted search. We propose strategies for inferring facets and facet values on Twitter by enriching the semantics of individual Twitter messages and present di erent methods, including personalized and context-adaptive methods, for making faceted search on Twitter more e ective. We conduct a preliminary analysis that shows that semantic enrichment of tweets is essential for faceted search on Twitter and that there is essential need for adaptive faceted search on Twitter. Furthermore, we propose an evaluation methodology that allows us to automatically evaluate the quality of adaptive faceted search on Twitter without requiring expensive user studies.</p>
      </abstract>
      <kwd-group>
        <kwd>faceted search</kwd>
        <kwd>twitter</kwd>
        <kwd>semantic enrichment</kwd>
        <kwd>adaptation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>With the growing information space on the Web and the increasing popularity of
Social Media, Social Web applications became part of daily activities as well as
the source of information for millions of people. The dynamic nature of the Web
and the diversity of the users along with the heavy information load demanded
some form of adaptation or personalization in many Web-based applications
in various domains. Nowadays, many Social Web applications are su ering from
similar information overload problems, where the users of these applications nd
it di cult to read, nd and follow the relevant and interesting information shared
by a large network of other users. Our research focuses on tackling information
overload in one of the most popular of these applications, Twitter.</p>
      <p>
        Twitter is the most popular micro-blogging site and a growing Social Web
phenomenon that is attracting interest from di erent types of people all around
the world for a variety of di erent purposes, such as fast communication, work,
status updates, following news, sports, events, opinions, hot topics, and so on [1{
8]. With millions of Twitter messages (tweets) per day, highly active users are
estimated to receive hundreds of tweets every day3. Due to the lack of any
adaptive or personalized navigation support in Twitter, users may get lost, become
de-motivated and frustrated in this network of information overload [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
Accessing required or interesting fresh content easily is vital in today's information
age. Hence, there is a need for an e ective personalized searching option from the
users' point of view that would assist them in following the optimal path through
a series of facets to nd the information they are looking for, while providing a
structured environment for relevant content exploring. Our research focuses on
investigating ways to enhance searching and browsing in microblogging sites like
Twitter by means of adaptive and personalized faceted search.
      </p>
      <p>
        Searching and browsing are, indeed, somewhat limited in Twitter. For
example, one can search for tweets by a keyword or by a user in a timeline that would
return the most recent posts. So, if a user wants to see the di erent tweets about
a eld of sports, and were to search for \sports" in Twitter, only the recent tweets
that contain the word \sports" would be listed to the user. Many tweets that
do not contain the search keyword, but are about di erent sport events, sport
games and sport news in general, would not be returned. Moreover, the Twitter
keyword search di ers from the general Web search due to the restricted message
size of 140 characters in Twitter [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Traditional faceted search interfaces allow
users to search for items by specifying queries regarding di erent dimensions and
properties of the items (facets) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. For example, online stores such as eBay4 or
Amazon5 enable narrowing down their users' search for products by specifying
constraints regarding facets such as the price, the category or the producer of a
product. In contrast, information on Twitter is rather unstructured and short,
which does not explicitly feature facets. This puts constrains on the size and the
number of keywords, as well as facets, that can be used as search parameters
without risking to lter out many relevant results. Hence, searching by more
than one topic (multiple facets), such as \sport events", would return only those
recent tweets that contain both of these words and miss tweets like \O to BNP
Paribas at Indian Wells", which mentions the name and the location of a sport
event without necessarily including the keywords. In this paper, we introduce
an adaptive faceted search framework for Twitter and investigate how to
extract facets from tweets, how to design appropriate faceted search strategies on
Twitter and how to evaluate such a framework. Our main contributions can be
summarized as follows.
      </p>
      <p>Semantic Enrichment We present methods for enriching the semantics of
tweets by extracting facets (entities and topics) from tweets and related
external Web resources.</p>
      <p>User and Context Modeling Given the semantically enriched tweets, we
propose user and context modeling strategies that identify (current) interests of
a given Twitter user and allow for contextualizing the demands of this user.
3 http://techcrunch.com/2010/06/08/twitter-190-million-users/
4 http://ebay.com/
5 http://amazon.com/
Adaptive Faceted Search We introduce faceted search strategies for content
exploration on Twitter and propose methods that adapt to the interests and
context of a user.</p>
      <p>Evaluation Framework We present an evaluation environment based on
simulated users to evaluate di erent strategies in our adaptive faceted search
engine on Twitter.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work and Our Motivation</title>
      <p>The exponential growth of Twitter has attracted signi cant amount of research
from various perspectives and elds recently. In this section, we focus on the
related work that motivates and inspires our work, as well as relating our work
to the existing literature.</p>
      <sec id="sec-2-1">
        <title>2.1 Content Exploration on Twitter</title>
        <p>
          A prototype for topic-based browsing in Twitter was proposed after observing
how the users manage the incoming ood of updates [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. This prototype
interface, called Eddi, visualizes a user's Twitter feed using topic clusters constructed
via a topic identi cation algorithm without using any semantics or natural
language processing. This approach, however, does not nd the relations between
the topics or perform any recommendation of related topics. While it provides
a means for browsing through a user's own feed by topics, our ambition is to
infer relations between entities of all tweets in the network in order to adapt
the list of facets presented to contain the related entities of the tweet of interest
even outside of the user's feed. The aim is to provide a means where not only
the users can easily reach to the information they are looking for by controlling
their search parameters as they move along, but can also browse the related
information about the current subject of interest by related people, countries,
cities, events, and other selected facets.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Semantic Enrichment of Tweets</title>
        <p>
          The main problem in searching microblogging platforms is the size of the
messages. For example, the Twitter messages, with 140 characters limit, are too
short to extract meaningful semantics on their own. Furthermore users tend to
use abbreviations and short-form for words to save space, as well as colloquial
expressions, which make it even harder to infer semantics from tweets. Rowe
et al. mapped tweets to conference talks and exploited metadata of the
corresponding research papers to enrich the semantics of tweets to better understand
the semantics of the tweets published in conferences [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. We follow a similar
approach to this, except we try to enrich the tweets in general and not in a
restricted domain like scienti c conferences. A study by Kwak et al. revealed that
the majority of the trending topics in Twitter are either headline or persistent
news, with 85% of all the posted tweets being related to news, claiming Twitter
is used more as a news media than a social network [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Consequently, we try to
map tweets to news articles on the Web over the same time period in order to
enrich them and to allow for extracting more entities to generate richer facets.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>User and Context Modeling for Adaptive Faceted Search in</title>
      </sec>
      <sec id="sec-2-4">
        <title>Twitter</title>
        <p>
          We also try to discover the relations between the extracted entities by studying
di erent strategies in order to determine relatedness relations between entities
such as persons related to an event and identify any temporal constraints on
such relations. These learnt relations between entities can be utilized to ease
the search by grouping together the related facets and recommending the most
relevant facets that the user is looking for. Marinho et al. proposed a method for
collabulary learning which takes a folksonomy and domain-expert ontology as
input and performs semantic mapping to generate an enriched folksonomy [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
An algorithm based on frequent itemsets techniques is then applied to learn an
ontology over this enriched folksonomy. A similar approach exploited frequent
itemsets to learn association rules from tagging activities [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. We study the
cooccurrence frequencies of entity pairs and compare these with other strategies
for tweets in combination with news articles to learn relations between these
entities.
        </p>
        <p>
          In addition to adapting the facets to the current search, we aim at
adapting the facet values to the current state of the users in order to personalize the
search and content exploration. Liu et al. analyzed content-based recommenders
for Google News and showed that interests in news topics such as technology,
politics, et cetera change over time [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. They also predicted user interests and
showed that these user pro les in combination with recent trends on Google
News outperform collaborative ltering. Similarly, Chen et al. studied content
recommendation in Twitter and found out that both topic and relevance are
important considerations [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. They also observed that URLs extracted from the
user's close social group is more successful than the most popular ones.
Correspondingly, we observe the users' past activities to infer their recent interests
based on their recent tweets and re-tweets. In other words, we build a pro le
of user interests in accordance with entities and topics, which is then used to
adapt ranking of the facet values. Re-arranging the facet values according to
user history and interests in line with the trendy topics can accelerate and thus
improve the searching experience.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Faceted Search on Twitter</title>
      <p>
        On Twitter, facets describe properties of a Twitter message. For example,
persons that are mentioned in a tweet or events a tweet refers to. Oren et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]
formulate the problem of faceted search in RDF terminology. Given an RDF
statement (subject; predicate; object), the faceted search engine interprets (i)
the subject as the actual resource that should be returned by the engine, (ii)
the predicate as the facet type and (iii) the object as the facet value (restriction
value). A faceted query (facet-value pair) that is sent to a faceted search engine
thus consists of a predicate and an object. We follow this problem formulation
proposed by Oren et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and interpret tweets as the actual resources the
faceted search engine should return. If a tweet (subject) mentions an entity then
)"'44 )#"8
" 3
/ )*7
1"./ 156"
!
))%*#1566""$9
!"##$%&amp;'("$#)*'
0$1$#$#' B$%%2,'
+$,"-&amp;,*'
./'0$1$#$#'1$-23$#,'4%5&amp;6$#'7%124%'
8$-,'92%':5#'62,':4%,'6;&lt;*==&gt;55/ /'
?/'0$1$#$#'@A'B5'82%%2%&gt;'C&amp;4#&amp;D'
849#2%E4F'G$-H$#'02&gt;6&amp;'I4JE'6;/ /'
K/'7,'0$1$#$#',L-'14L%&gt;':5#M$#'
&lt;#5:$,,25%4-'&amp;$%%2,'&lt;-4)$#'G2#E4'/ /'
N/'+5&gt;$#'0$1$#$#'3,'O#%4"1'!-$M$%&amp;'
K#1'+5"%1*'82MP-$15%'?Q.Q'R'6&amp;/ /'
S/  0$1$#$#F'TU5E532J'4%1'+5112JE'
      </p>
      <p>#$4J6'&amp;62#1'#5"%1'6;&lt;*==P2&amp;/-)=:/ /'
V/  8$#$')5"',"#&lt;#2,$1'96$%'</p>
      <p>0$1$#$#'-5,&amp;'&amp;6$'W/C/'@&lt;$%X*Y$,/ /'
Z/  02#,&amp;'M4U5#'&amp;5"#%4M$%&amp;'4[$#'&amp;6$'</p>
      <p>@H'5&lt;$%/'0$1$#$#'4%1'TU5E532J'/ /'
\/  865'&amp;62%E,'&amp;64&amp;'+5&gt;$#'0$1$#$#'2,'
(a) Faceted search interface
!"#$%&amp;'()
*+""*#)
,-./)*0") !"#$%
1$--"'*)
2$"-3)
-.#/,/0))
12/$3)</p>
      <p>Faceted Search Engine</p>
      <p>Semantic Enrichment
facet extraction linkage
User and Context Modeling
profile generation relation learning
Adaptive Faceted Search
facet ranking query suggestion
!"#$%&amp;'%()*%+,+)
(b) Faceted search architecture
the type of the entity is considered as facet type (predicate) and the actual
identi er of the entity is considered as facet value (object). For example, given
a tweet t that refers to the tennis player \Federer", the corresponding URI of
the entity (U RIfederer) and the URI of the entity type (U RIperson) are used to
describe the tweet by means of an RDF statement: (t; U RIperson; U RIfederer).</p>
      <p>
        Figure 1(a) illustrates how we envision the corresponding faceted search
interface that allows users to formulate faceted queries. Given a list of facet
values which are grouped around facet types such as locations, persons and events,
users can select facet-value pairs such as (U RIevent; U RIwimbeldon) to re ne their
current query ((U RIperson; U RIfederer), (U RIsportsgame; U RItennis)). A faceted
query thus may consist of several facet-value pairs. Only those tweets that match
all facet-value constraints will be returned to the user. The ranking of the tweets
that match a faceted query is a research problem of its own and could be solved
by exploiting the popularity of tweets { e.g. measured via the number of
retweets or via the popularity of the user who published the tweet (cf. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]). The
core challenge of the faceted search interface is to support the facet-value
selection as good as possible. Hence, the facet-value pairs that are presented in the
faceted search interface (see left in Figure 1(a)) have to be ranked so that users
can quickly narrow down the search result lists until they nd the tweets they
are interested in. Therefore, the facet ranking problem can be de ned as follows.
De nition 1 (Facet Ranking Problem). Given the current query Fquery,
which is a set of facet-value pairs (predicate; object) 2 Fquery, the hit list H
of resources that match the current query, a set of candidate facet-value pairs
(predicate; object) 2 F and a user u, who is searching for a resource t via the
faceted search interface, the core challenge of the faceted search engine is to rank
the facet-value pairs F . Those pairs should appear at the top of the ranking that
restrict the hit list H so that u can retrieve t with the least possible e ort.
      </p>
      <p>The e ort, which u has to invest to narrow down the search result list H,
can be measured by click and scroll operations. Strategies for facet ranking are
discussed in Section 3.2.</p>
      <sec id="sec-3-1">
        <title>Architecture for Adaptive Faceted Search on Twitter</title>
        <p>
          Semantic Enrichment The semantic enrichment layer aims to extract facets
from tweets and generate RDF statements that describe the facet-value pairs
which are associated with a Twitter message. In particular, each tweet is
processed to identify entities (facet values) that are mentioned in the message. We
therefore make use of the OpenCalais API6, which allows for the extraction of
39 di erent types of entities (facet types) including persons, organizations,
countries, cities and events. As Twitter messages are limited to 140 characters, the
extraction of entities from tweets is a non-trivial problem. Thus, we introduced a
set of strategies that link tweets with external Web resources (news articles) and
propagate the semantics extracted from these resources to the related tweets
in [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. For example, given a tweet \This is great http://bit.ly/2fRds1t", we
extract entities from the referenced resource (http://bit.ly/2fRds1t) and attach
the extracted entities to the tweet. In our analysis, we show that this semantic
enrichment allows us to signi cantly better prepare the tweets for faceted search
than enrichment which is merely based on tweets.
        </p>
        <p>
          User and Context Modeling In order to adapt the facet ranking to the
people who are using the faceted search engine, we propose user modeling and
context modeling strategies. The user modeling strategies model the interests
of the users in certain facet values (entities and topics). We therefore exploit
the tweets that have been published (including re-tweets) by a user. In future
work, we also plan to consider click-through data from the faceted search
engine. Context modeling covers mining of new knowledge from the Twitter data.
We therefore propose relation learning strategies that exploit co-occurrence of
entities in Twitter messages to infer typed relationships between entities [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
Adaptive Faceted Search Based on the semantically enriched tweets, the
learnt relationships between entities extracted from tweets and the user pro les
generated by the user modeling layer, the adaptive faceted search layer solves
the actual facet ranking problem. It provides methods that adapt the
facetvalue pair ranking to the given context and user. Furthermore, it provides query
suggestions by exploiting the relations learnt from the Twitter messages. Given
the current facet query, which is a list of facet-value pairs where each value refers
to an entity, we can exploit relationships between entities in order to identify
entities that are related to those entities that occur in the current facet query.
We leave the analysis of such query suggestions for future work. Instead, we
focus on the facet ranking problem and propose di erent strategies for ranking
facet-value pairs in the next subsection.
        </p>
        <sec id="sec-3-1-1">
          <title>6 http://www.opencalais.com/</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Adaptive Faceted Search and Facet Ranking Strategies</title>
        <p>Non-Personalized Facet Ranking A lightweight approach is to rank the
facet-value pairs (p; e) 2 F based on their occurrence frequency in the current
hit list H, the set of tweets that match the current query (cf. De nition 1):
rankfrequency((p; e); H) = jH(p;e)j (1)
jH(p;e)j is the number of (remaining) tweets that contain the facet-value pair
(p; e) that can be applied to further lter the given hit list H. By ranking those
facets that appear in most of the tweets, rankfrequency minimizes the risk of
ltering out relevant tweets but might increase the e ort a user has to invest to
narrow down search results.</p>
        <p>Context-adaptive Facet Ranking The context-adaptive strategy exploits
relationships between entities (facet values) to produce the facet ranking. A
relationship is therefore de ned as follows:</p>
      </sec>
      <sec id="sec-3-3">
        <title>De nition 2 (Relationship). Given two entities e1 and e2, a relationship be</title>
        <p>tween these entities is described via a tuple rel(e1; e2; type; tstart; tend; w), where
type labels the relationship, tstart and tend specify the temporal validity of the
relationship and w 2 [0::1] is a weighting score that allows for specifying the
strength of the relationship.</p>
        <p>The higher the weighting score w the stronger the relationship between e1
and e2. We use co-occurrence frequency as weighting scheme. Hence, given the
enriched tweets, we count the number of tweets both entities (e1 and e2) are
associated with. The context-adaptive facet ranking strategy ranks the
facetvalue pairs (p; e) 2 F according to w(ei; e), where ei is a facet value that is
already part of the given query: (pi; ei) 2 Fquery (cf. De nition 1):
rankrelation((p; e); Fquery) =</p>
        <p>X w(ei; e)j(p; ei) 2 Fquery
i
(2)</p>
        <p>Hence, the context-sensitive strategy can only be applied in situations where
the user has already made one selection, so that jFqueryj &gt; 0.</p>
        <p>Personalized Facet Ranking The personalized facet ranking strategy adapts
the facet ranking to a given user pro le that is generated by the user modeling
layer depicted in Figure 1(b). User pro les conform to the following model and
specify a user's interest into a speci c facet value (entity).</p>
        <p>De nition 3 (User Pro le). The pro le of a user u 2 U is a set of weighted
entities where with respect to the given user u for an entity e 2 E its weight
w(u; e) is computed by a certain function w.</p>
        <p>P (u) = f(e; w(u; e))je 2 E; u 2 U g</p>
        <p>Here, E and U denote the set of entities and users respectively.
s1x106
e
u
l
a
1tv00000
e
c
a
ttfx10000
o
e
lae 1000
tr
a
tsh 100
t
e
e
tfow 10
r
ubem 1
n
3.6 twee3t.-4based3.2 3 2.81111....824621
tweet-based + exploitation of news relations</p>
        <p>Given the set of facet-value pairs (p; e) 2 F (see De nition 1), the
personalized facet ranking strategy utilizes the weight w(u; e) in P (u) to rank the
facet-value pairs:
rankpersonalized((p; e); P (u)) =
w(u; e) if w(u; e) 2 P (u)
0 otherwise
(3)</p>
        <p>By combining the above three strategies it is possible to generate further facet
ranking methods. A combination of two strategies can be realized by building the
weighted average computed for a given facet-value pair (p; e) (e.g. rankcombined =
rank ((p; e)) + rank ((p; e))).
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Analysis of Faceted Search on Twitter</title>
      <p>In our analysis, we study the characteristics of facets on Twitter. As described
above, tweets do not feature many facets by nature. Therefore, strategies that
enrich the semantic of tweets are required in order to derive facet-value pairs
for tweets. In this section, we examine how the semantic enrichment supports
the derivation of facets. Furthermore, we analyze the feasibility of the user and
context modeling strategies for making faceted search on Twitter adaptive.
4.1</p>
      <sec id="sec-4-1">
        <title>Analysis of Semantic Enrichment</title>
        <p>As tweets do not provide facets related to the topic, our faceted search
framework provides the functionality to enrich the semantics of tweets. To analyze the
feasibility of our semantic enrichment component (see Section 3), we monitored
the Twitter activities of more than 20,000 users over a period of more than two
months and processed the data that we collected (1,671,389 tweets in total) to
extract facet values from the tweets. For 62.91% of the tweets, we succeeded in
extracting at least one entity that we can use as facet value. By making use of the
semantic enrichment functionality that exploits links to external Web resources
(and news articles in particular), we increased the coverage so that 66.77% of</p>
        <p>Tweet-only</p>
        <p>Tweet+News-based enrichment
1
10
100</p>
        <p>
          1000
the tweets which are enriched with facet values obtained from related news have
at least one facet value. In the context of the news-based enrichment, we
connected 458,566 Twitter messages with news articles of which 98,189 relations
were explicitly given in the tweets by URLs that pointed to the corresponding
news article. The remaining 360,377 relations were obtained by comparing the
entities that were mentioned in both news articles and tweets as well as
comparing the timestamps. In previous work we showed that this method correlates
news and tweets with an accuracy of more than 70% [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ].
        </p>
        <p>Figure 2(a) reveals that the number of facet values increases clearly when
tweets are enriched with entities of related news articles. For example, less than
20 tweets exhibit more than 10 facet values in the case of semantic enrichment
that is merely based on tweets . Given that tweets are limited to 140 characters,
this observation is expected. Moreover, the number of di erent facet types per
tweet also increases when linkage to news articles is exploited (see Figure 2(b)).
In our current implementation, we di erentiate between 39 di erent facet types,
where persons, countries and organizations are the most popular types of facets.
In Figure 2(b), we see that the tweet-based enrichment does not allow for more
than 10 di erent types of facet types per tweets while the exploitation of news
relations features more than 10,000 tweets that can be discovered via more than
10 di erent facet types, i.e. users can choose between various facets to narrow
down the actual hit list (cf. Figure 1(a)).
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Analysis of User and Context Modeling</title>
        <p>The adaptation of the faceted search interface to the preferences of the user and
therefore the personalized facet ranking strategy (see Equation 3) requires
entitybased user pro les (see De nition 3). To analyze to what extent this method can
succeed, we show the pro le size of 1500 randomly selected user pro les in
Figure 3. We see that the news-based enrichment results in pro les that provide
more entities than the tweet-only based enrichment. For example, semantic
enrichment based merely on tweets fails for three users as the size of the pro le is
zero for these users. In contrast, the news-based enrichment successfully
generates pro les for all users. For more than 98% of the users, the number of distinct
entities per pro le is even higher than 100. This indicates that news-based
enrichment prevents from sparsity problems and thus allows for supporting the
personalized facet ranking better than the tweets-only-based enrichment.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Evaluation Framework for Faceted Search</title>
      <p>
        Evaluating the performance of faceted search is challenging. It usually requires
query logs and click-through data, which is di cult to get for researchers, or
calls for user studies, which are expensive if they are conducted on a large scale.
In this section, we propose a novel technique for automatically evaluating the
performance of faceted search on Twitter. Our evaluation methodology follows
an idea introduced by Koren et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and exploits re-tweets as ground truth
for estimating user relevance. The evaluation methodology is based on simulated
users who behave in a prede ned way. The utility of the interface is measured
by the actions a simulated user needs to perform in order to nd a relevant
document.
      </p>
      <p>General Setup. The general setup used for the evaluation process contains
parameters describing the user interface itself and algorithms characterizing the
simulated user behavior. In general, all faceted search user interfaces share some
common characteristics and contains at least two parts: an area displaying the
facets and a part showing the search results. For our evaluation process, the
number of documents to be presented at a time, the number of di erent facets
to be displayed and the number of elements which can be shown for each di erent
facet need to be de ned. We setup a basic framework for a search interface by
de ning these three parameters. Based on this interface, a user can perform
di erent actions, where the goal is to nd a relevant document. For every action
we can de ne a cost, where the cost is related to the time a real user would
need to accomplish this action. In our scenario a user can perform the following
actions:
Select facet-value pair Basic action a user performs every time a facet-value
pair is clicked, where the displayed search results are automatically updated
after the selection (costs: 1).</p>
      <p>View more facet-value pairs This action indicates that none of the currently
displayed facet-value pairs are relevant for the user. By performing this action
the user gets an additional amount of facet-value pairs related to one facet
(costs: 2).</p>
      <p>Show more documents This action allows the user to see more documents
(tweets) matching the currently selected facet-values (costs: 2).</p>
      <p>Select relevant tweet This action ends the current search (costs: 0).</p>
      <p>Beside the actions mentioned above one could also consider the act of
deselecting previously marked facet-values. In our search scenario, this action is not
included as we assume that the users have perfect knowledge about the tweet
they are looking for, and therefore a wrong selection will not take place.
Selection Strategies. The simulated users select facet-value pairs based on
di erent strategies. The strategies we use for our evaluation are:
Random user This user randomly selects one of the displayed facet-values
which matches the tweet he is looking for. If none of the displayed
facetvalue pairs matches the tweet, he randomly chooses one facet to see more
facet-value pairs.</p>
      <p>First-match user This user selects the rst matching facet-value pair
displayed by the interface. The basic idea behind this strategy is based on
a user who directly clicks on a matching facet-value pair suggestion and do
not look at all displayed facet value pairs to nd the best matching one.
Greedy user This strategy tries to reduce the number of matching documents
as fast as possible. This user selects the facet-value pair which occurs in the
least number of remaining documents. This can be motivated by a user who
selects the facet-value pair which is particularly important for the targeted
tweet, in comparison to facet-value pairs which are related to many tweets.</p>
      <p>Based on these facet selection strategies, the simulated user searches for a
relevant document. The cost of this search is measured by the costs and number
of actions a user needs to perform to nd a relevant document.</p>
      <p>Evaluation process. To measure the bene t of the proposed methods for
faceted search, we evaluate the cost for a user to nd relevant documents. Here,
a tweet is relevant to a user, if the user re-tweeted this tweet. Re-tweeting a tweet
indicates that the user has read the tweet and is to some extend interested in
the content of the tweet. The proposed method is used to compare the costs of
nding a relevant document when using the baseline ranking strategy based on
frequency (non-personalized facet ranking) in comparison with context-adaptive
facet ranking and personalized facet ranking.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>
        In this paper, we presented an adaptive and personalized faceted search engine
for Twitter, where we explained approaches for enriching the semantics of tweets,
extracting facets, discovering relatedness information between entities and
observing user activities to learn their behavior and interests in order to support
users in their search for speci c information or tweets. We proposed di erent
strategies based on learnt relations together with user action history for
adapting the search behavior as well as improving content exploration in Twitter.
Furthermore, we introduced a generic evaluation environment based on Koren
et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] that will allow us to evaluate our strategies by simulated experiments,
which constitutes part of our future research.
      </p>
      <p>Acknowledgements The research leading to these results has received
funding from the European Union Seventh Framework Programme (FP7/2007-2013)
under grant agreement no ICT 257831 (ImREAL project7).</p>
      <sec id="sec-6-1">
        <title>7 http://imreal-project.eu</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Hughes</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Twitter Adoption and Use in Mass Convergence and Emergency Events</article-title>
          .
          <source>In: Proc. of ISCRAM</source>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosson</surname>
            ,
            <given-names>M.B.</given-names>
          </string-name>
          :
          <article-title>How and why people Twitter: the role that micro-blogging plays in informal communication at work</article-title>
          .
          <source>In: Proc. GROUP</source>
          , ACM (
          <year>2009</year>
          )
          <volume>243</volume>
          {
          <fpage>252</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cha</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haddadi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benevenuto</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gummadi</surname>
            ,
            <given-names>P.K.</given-names>
          </string-name>
          :
          <article-title>Measuring User In uence in Twitter: The Million Follower Fallacy</article-title>
          .
          <source>In: Proc. of ICWSM</source>
          , The AAAI Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Kwak</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
            , H., Moon,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>What is twitter, a social network or a news media?</article-title>
          <source>In: Proc. of WWW</source>
          , ACM (
          <year>2010</year>
          )
          <volume>591</volume>
          {
          <fpage>600</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Lerman</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghosh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Information contagion: an empirical study of spread of news on digg and twitter social networks</article-title>
          .
          <source>In: Proc. of ICWSM</source>
          , The AAAI Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Java</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tseng</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Why we twitter: understanding microblogging usage and communities</article-title>
          .
          <source>In: Proc. of WebKDD/SNA-KDD, ACM</source>
          (
          <year>2007</year>
          )
          <volume>56</volume>
          {
          <fpage>65</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kaufman</surname>
          </string-name>
          , S.J.,
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , J.:
          <article-title>Where we Twitter</article-title>
          .
          <source>In: Proc. of Workshop on Microblogging: What and How Can We Learn From It?</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Romero</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meeder</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kleinberg</surname>
          </string-name>
          , J.:
          <article-title>Di erences in the mechanics of information di usion across topics: Idioms, political hashtags, and complex contagion on twitter</article-title>
          .
          <source>In: Proc. of WWW</source>
          , ACM (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Teevan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramage</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morris</surname>
            ,
            <given-names>M.R.</given-names>
          </string-name>
          :
          <article-title>#TwitterSearch: A Comparison of Microblog Search and Web Search</article-title>
          .
          <source>In: Proc. of WSDM</source>
          , ACM (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kairam</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hong</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chi</surname>
            ,
            <given-names>E.H.:</given-names>
          </string-name>
          <article-title>A torrent of tweets: managing information overload in online social streams</article-title>
          .
          <source>In: Proc. of Workshop on Microblogging: What and How Can We Learn From It?</source>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Oren</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Delbru</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Extending faceted navigation for rdf data</article-title>
          .
          <source>In: Proc. of ISWC</source>
          , Springer (
          <year>2006</year>
          )
          <volume>559</volume>
          {
          <fpage>572</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>M</given-names>
          </string-name>
          , Stankovic,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Laublet</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          : Mapping Tweets to Conference Talks:
          <article-title>A Goldmine for Semantics</article-title>
          . In: Proc.
          <article-title>of SDoW, colocated with ISWC, CEUR-WS.org (</article-title>
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>Balby</given-names>
            <surname>Marinho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Buza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Schmidt-Thieme</surname>
          </string-name>
          ,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>Folksonomy-based collabulary learning</article-title>
          .
          <source>In: Proc. of ISWC</source>
          , Springer (
          <year>2008</year>
          )
          <volume>261</volume>
          {
          <fpage>276</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Hotho</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Jaschke, R.,
          <string-name>
            <surname>Schmitz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
          </string-name>
          , G.:
          <article-title>Emergent Semantics in BibSonomy</article-title>
          .
          <source>In: Informatik fur Menschen</source>
          . Volume
          <volume>94</volume>
          (
          <issue>2</issue>
          )
          <string-name>
            <surname>of</surname>
            <given-names>LNI</given-names>
          </string-name>
          , GI (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dolan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>E.R.</given-names>
          </string-name>
          :
          <article-title>Personalized news recommendation based on click behavior</article-title>
          .
          <source>In: Proc. of IUI</source>
          , ACM (
          <year>2010</year>
          )
          <volume>31</volume>
          {
          <fpage>40</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nairn</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nelson</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chi</surname>
          </string-name>
          , E.:
          <article-title>Short and tweet: experiments on recommending content from information streams</article-title>
          .
          <source>In: Proc. of CHI</source>
          , ACM (
          <year>2010</year>
          )
          <volume>1185</volume>
          {
          <fpage>1194</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Weng</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>E.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>Twitterrank: nding topic-sensitive in uential twitterers</article-title>
          .
          <source>In: Proc. of WSDM</source>
          , ACM (
          <year>2010</year>
          )
          <volume>261</volume>
          {
          <fpage>270</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Abel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Houben</surname>
            ,
            <given-names>G.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Analyzing User Modeling on Twitter for Personalized News Recommendations</article-title>
          .
          <source>In: Proc. of UMAP</source>
          , Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Celik</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Abel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Learning Semantic Relationships between Entities in Twitter</article-title>
          .
          <source>In: Proc. of ICWE</source>
          , (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Abel</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Houben</surname>
            ,
            <given-names>G.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tao</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Semantic Enrichment of Twitter Posts for User Pro le Construction on the Social Web</article-title>
          . In: ESWC, Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>X.</surname>
          </string-name>
          :
          <article-title>Personalized interactive faceted search</article-title>
          .
          <source>In: Proc. of WWW</source>
          , ACM (
          <year>2008</year>
          )
          <volume>477</volume>
          {
          <fpage>486</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>