<!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>Context-aware User Pro les for the Social Web</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sebastian Bohm</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marko Luther</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DOCOMO Communications Laboratory Europe GmbH</institution>
          ,
          <addr-line>Munich</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this work we report about the automatic creation of dynamic user pro les that combine personal data from diverse social networks with context information recorded by IYOUIT, a mobile community service in the eld of context awareness. Data mining algorithms are applied to learn about users and their preferences over time. Rich, semantically annotated Friend of a Friend (FOAF) pro les are created on demand, and thus always re ect the latest level of information. Existing extensions and potential enhancements of FOAF are discussed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In order to provide truly personalized services, having knowledge about the
meaning and the correlation of personal information streams is inevitable. In
the following, we present our attempts to interpret diverse types of information,
either coming from sensing the user's vicinity via the mobile phone or retrieved
from connected Web 2.0 services. As a result, rich user pro les can be deduced to
explore social interaction in the virtual world. This paper summarizes rst results
of newly established research aspects in IYOUIT that focus on context-based
user pro ling and the adoption of common semantic representation formats.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Social Data Mining</title>
      <p>With IYOUIT's mobile application personal information including digital
location traces, status updates or communication patterns can be automatically
recorded, processed and in turn made available to the user on the mobile handset
or on the Web. From localized service o erings to real-time presence updates of
registered buddies, IYOUIT o ers a broad range of bene ts to the mobile user.
Most personalized service o erings require user pro les that hold information
about basic demographics and application speci c preferences. To facilitate and
substantially improve the automatic creation of such pro les, data mining
algorithms are applied. Here, the general aim is to learn about the user, his habits
and liking to increase the personal pro t in participating and contributing to
the community.</p>
      <p>IYOUIT builds upon a distributed component infrastructure to allow for
exible service deployments. Each distinct type of context information is therefore
processed in a corresponding network component, in the following referred to as
ContextProvider, and is made available to clients and other components through
a rich API. Whenever possible, a ContextProvider is meant to abstract from raw
data sources to qualitative information. In some cases, however, semantic
references cannot be easily made, given the fact that some pieces of information, e.g.
manual presence updates, may not be categorized subsequently.</p>
      <p>
        Based on continuously recorded location traces, the LocationProvider
applies clustering techniques [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] to deduce frequently visited places. Such places
can be named and typi ed by the user to add meaning to automatically
generated content. Places can be categorized in business related places, private as
well as public areas of interest. Places that have been typi ed by the user are
mapped to well-de ned concepts in an underlying place ontology. These
semantic references allow for several subsequent computations with regard to a user's
personal pro le. Based on a user's presence within a place typed as o ce,
average working hours can be derived. Over time, not only the total hours of work
are known but also a more detailed schedule of the time spent at home, at the
o ce or on the train to work. Commuting time, for instance, can be
approximated as the time between leaving and entering a home as well as o ce place.
When comparing user speci c values to those recorded by the entire community,
a certain variance may further lead to interesting characteristics such as being
a workaholic or frequent traveler. The latter can be assumed whenever the total
number of automatically recognized trips within a prede ned time interval
exceeds a certain threshold, determined by the average travel activity of the entire
community.
      </p>
      <p>Since each ContextProvider may also encapsulate external data sources as
well as 3rd party services, data provided by popular Web 2.0 services is in turn
utilized within IYOUIT. To give an example, Last.FM, a community service
that lets people socialize around music, o ers an API to access a registered
user's pro le as well as music favors. This pro le information can be enriched
with automatically recorded usage patterns on the mobile handset. This way,
not only the most popular artists or genres of a user are known, but also the
context in which a certain type of music is preferred. Having information about
the time of the day when a user is usually playing music in addition to associated
activities such as commuting or being at home allows for signi cantly enriched
music pro les.
2.1</p>
      <sec id="sec-2-1">
        <title>Pro le Management</title>
        <p>Even though distinct, context-type speci c user pro les are available in
distributed components, the management and enrichment of pro les across multiple
context types is accomplished by one central component - the Pro leProvider.
In regular time intervals, all published pro les are harvested from registered
components to provide a single endpoint for the retrieval of pro les for services
building on top of the framework. The Pro leProvider's main task, however, is
concerned with the cross-context analysis of personal data, as summarized in
Figure 1. So-called context summaries, an aggregated variant of the actual data
record, are retrieved periodically from all available components. The subsequent
procedure identi es a uniform weighting of the context summaries retrieved,
to compare di erent types of information with regard to their importance in
the given time interval. References to the original information residing in the
respective network component as well as its measured signi cance values are
stored for further assessment. This context retrieval process is executed in
periodical time intervals, eventually resulting in multiple snapshots of a concept's
signi cance distribution over time. A concept stands for any atomic piece of
information being considered, for instance information about staying in a
personal place or updating ones presence information. Semantic associations that
may have been computed within the respective ContextProvider, e.g. references
to the place ontology, are maintained for subsequent reasoning tasks. The
signi cance distribution of a concept results in trends of increasing, decreasing or
steady importance.</p>
        <p>Even though a certain trend of a given concept may indicate its relevance over
time, the overall importance of a concept in a user's digital trace cannot solely
be characterized by its presence in only one context stream. In addition, the
degree of correlation with other concepts of di erent types and their respective
co-occurrence considerably adds valuable meta-information about a concept's
signi cance in general. As soon as a concept is being considered relevant, its
..</p>
        <p>..</p>
        <sec id="sec-2-1-1">
          <title>Context Provider</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Context Correlator</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>Data Mining Toolkit +</title>
          <p>DB
+
r
e
d
i
v
o
r
P
e
l
fi
o
r
P</p>
        </sec>
        <sec id="sec-2-1-4">
          <title>Retrieval of diverse context data</title>
        </sec>
        <sec id="sec-2-1-5">
          <title>Uniform weighting of context summaries</title>
        </sec>
        <sec id="sec-2-1-6">
          <title>Storage and trend computation</title>
        </sec>
        <sec id="sec-2-1-7">
          <title>Identification of temporal context correlations</title>
        </sec>
        <sec id="sec-2-1-8">
          <title>Rule learning</title>
          <p>temporal correlation with other context categories is computed. The
computation of such context correlations is accomplished within the ContextCorrelator.
Here, the temporal co-occurrence is the deciding factor whether or not two or
more concepts are marked as correlated. To improve this co-occurrence
measurement, each distinct type of context has been annotated with a validity attribute.
The validity attribute has been assigned by the respective ContextProvider and
is meant to quantify a concept's temporal duration. To give an example, an
actual weather reading may have a validity of one hour, whereas a single location
measurement may only be considered valid for 10 minutes.</p>
          <p>
            The ContextCorrelator does not only identify correlations in multiple
context streams but also assigns a weighting factor to each correlation pair. Based
on these correlations and their corresponding weighting factors, association rule
learning algorithms are applied subsequently. The Pro leProvider incorporates
the WEKA toolkit [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ], a collection of open-source data mining algorithms, to
infer descriptive rules from temporal context correlations. More speci cally, a
Tertius algorithm is applied to compute arbitrary attribute combinations. Premise
and consequence item-sets, each consisting of one or more attribute/value pairs
de ne such a rule, further characterized by its coverage (the number of instances
for which it applies correctly) and con dence (the fraction of examples
satisfying the rule). An exemplary rule that has been automatically inferred from a
user's combined context streams is shown below. It states that the respective
user typically listens to Jazz music while being at home on Saturday.
place="space.owl#home" and weekday="time.owl#saturday" =&gt;
          </p>
          <p>activity="activity.owl#listening_to_music" and genre="music.owl#jazz"
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Pro le Matchmaking and Visualization</title>
        <p>The prime advantage of having rich user pro les in place are better,
personalized service o erings. Usually, a community service commits itself to connecting
users across explicitly given social relationships to leverage interaction and
information exchange. To do so, the computed pro les and deduced patterns are
further utilized in IYOUIT by applying a matchmaking mechanism, meant to
identify and weight similarities in user pro les within the community. Users
with similar hobbies, interests or preferences can thus pro t from being
implicitly connected. Input parameters for the actual matchmaking algorithm include
a concept's current signi cance, its temporal distribution (trend) as well as its
correlation degree. The latter can be seen as another indicator for a concept's
overall importance among a given set of concepts. The weighting factors for each
input parameter may vary depending on the actual application. In case the latest
state of a concept's importance is the key factor, its signi cance value can be
seen as the deciding factor. On the other hand, long-term considerations can be
stressed by weighting a concept's temporal distribution accordingly.</p>
        <p>So, in order to provide such a matchmaking algorithm for nding other users
with similar interests, for instance as part of an online community portal, several
other aspects with respect to the actual visualization of pro le information in
general and a corresponding query interface in particular need to be considered.
Since the resulting user pro les are meant to be edited and reviewed by the user,
the actual requirements on the data visualization are manifold. For one, the user
should not be overwhelmed by the amount of information being displayed while,
at the same time, the dynamic aspects of the pro le data should be considered,
too. On the other hand, the user should also be able to browse through pro le
information of other users in case a certain match has been found.</p>
        <p>The most common way to visualize (mainly unstructured) data on the Web
is by utilizing tag clouds. With tag clouds, the importance of concepts can be
visualized by a tag's overall font size. However, only a very limited amount of
meta-data is encoded within the cloud, preventing important information from
being visualized. On the other hand, the advantages of a tag cloud based
visualization are its wide adoption, ease of use and applicability to diverse domains.
To overcome the limiting factors while still maintaining some bene cial aspects,
we came up with a more advanced visualization paradigm, still borrowing the
basic concept of representing data in a way similar to tag clouds. In short, the
signi cance distribution of a tag over time is visualized by changing its font
characteristics (e.g. by using di erent font sizes) within the representation of
one tag. So in case the signi cance of a tag has decreased signi cantly, the font
size of the distinct tag decreases, too, and vice versa. As a result, the tendency
of the observed signi cance of multiple tags can be visualized in one (static)
cloud, and thus enables a better identi cation and selection of tags not only
based on their current signi cance, but their signi cance distribution over time.
In addition, being able to visually identify trends of single data items or groups
of items, it becomes possible to not only better understand the provided
information but also to browse to historic samples of the data as recorded in the past.
Once a certain tag has been selected, distinct parts of this tag that represent
historic samples of the data set can be picked. As a result, the tag cloud is
recomputed given the chosen temporal constraints. Likewise, through visualizing
a tag's signi cance distribution over time, a trend-based browsing through the
given dataset becomes possible.</p>
        <p>The actual font sizes used for a given tag and its signi cance distribution
can be computed by assuming that the number of distinct sections (or letters)
of a given tag also restricts the number of signi cance measurements considered.
This trend visualization can be described by</p>
        <p>k
8i=0fi = Fmin +
s
i (Fmax
Smax</p>
        <p>Fmin)
with fi being a distinct fonts size, Fmin and Fmax representing minimum and
maximum font sizes, si being a distinct signi cance measurement and Smax
representing the maximum signi cance measurement. Apart from those temporal
aspects, existing tag cloud representations do often not allow for visualizing the
degree of correlation and therefore lack another suitable di erentiating factor
between tags in one cloud. As a result, navigating through the dataset and
restricting a given query along the lines of correlated tags is not possible. Our
proposed visualization and interaction techniques tackle this constraint in
visualizing the correlation factor between tags with either a distinct grouping,
colorcoding or distance indication. Figure 2 depicts a screenshot of our Web-based
pro le browser that implements the aforementioned visualization characteristics.
By visualizing the correlation of tags by, for instance, more than one color, it
becomes possible to di erentiate between concepts representing a premise item
set from the ones representing consequence attribute/value pairs.</p>
        <p>
          Through the selection of one distinct tag, its signi cance and correlation
with other concepts can be assessed. At the same time, the selected tag's
metainformation is used to nd matching descriptions in other user's pro les. The
resulting weighted list of users is retrieved and displayed in a separate drawer
on the left hand side of the pro le browser. Here, the similarity degree of the
pro les determines the ranking within the result set. Once another user's pro le
has been selected, the interactive tag cloud displays the selected user's pro le. By
browsing through di erent (anonymous) pro les, patterns found within the cloud
can be explored to draw meaningful conclusions about the respective user. The
pro le browser as depicted in Figure 2 represents a prototypical implementation
of the proposed visualization paradigm and will thus be further re ned with
respect to its adoption within the deployed service framework. The IYOUIT user
community is invited to try out several aspects of the automatic user pro ling
and the pro le matchmaking to provide valuable feedback on the practical use
and general perception.
8"()$.,52)4"0/2)*+,-./)
+/*+/0/'#"6,')
!"#$%&amp;'()*+,-./0)
Even though some semantic references are present, the underlying format of the
pro le data mainly builds upon a hierarchical XML representation shared among
all IYOUIT components, including meta-information such as a concept's
correlation or signi cance distribution. This allows for e ciently processing large
amounts of data with common technologies while, at the same time,
higherlevel reasoning can still be accomplished by references to underlying
ontologyconcepts. However, a complete semantic foundation of the pro le data would be
bene cial in some respects. For one, a standard vocabulary for describing user
pro les makes data exchange across service providers far easier. At the same
time, a growing number of tools in the eld of the Semantic Web provide
support for enhanced query mechanisms across distributed knowledge sources [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
The interconnected nature of IYOUIT and the Web 2.0 has always been
predestined to create added value through the exchange of information across
community barriers. Therefore, Friend-of-a-Friend (FOAF) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], one de-facto standard
vocabulary for the representation of social data on the Web, has been chosen
as the external representation format. FOAF allows for the meaningful
interpretation of personal pro le information in a broad variety of services. It has
been designed as a lightweight and extensible vocabulary. Incomplete by design,
a number of extensions emerged since its introduction in 2001, covering a broad
range of application speci c requirements.
        </p>
        <p>
          The core of each FOAF pro le is comprised of the social network of the
respective person. With the foaf:knows property, other people and their FOAF
pro les can be interlinked. As stated in the vocabulary speci cation, foaf:knows
is rather vague by design. Some applications, however, require a more
negrained representation of social relationships between people. IYOUIT is an
application of the latter, and provides means to express a social network by
well-de ned properties in a social ontology [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. With it, ontology based
reasoning mechanisms allow for maintaining the consistency of the network and its
completion by making implicit relationships explicitly available. To preserve at
least parts of this valuable information within the FOAF representation, we chose
the RELATIONSHIP6 ontology to express social relationships in addition to the
unre ned foaf:knows constructs. Even though, the RELATIONSHIP ontology
provides additional vocabulary to describe a number of relationships, some roles
that could meaningfully describe the social connections between two or more
people are missing. The trade-o between the possibility to model all facets
of a social network and the reusability of the resulting representation needs to
be carefully considered. The restrictions inherent in the limited expressivity of
the resulting representation format also do not allow for distinguishing asserted
from inferred knowledge. For instance, given the currently available vocabulary
de nitions, it is not possible to distinguish whether or not a social relationship
has been inferred or has been given explicitly. However, the widespread use of
FOAF and some of its most popular extensions allow for a rich tool support on
the Web and therefore outplays the somehow limited expressivity in our case.
        </p>
        <p>Another rather small vocabulary that is being used to express information
about a user's visited countries is VISIT.7 Through IYOUIT's worldwide
adoption of people who tend to travel frequently, this addition is most welcome to
represent at least one aspect of their travel activity. By constantly observing
a user's location traces, trips can be automatically detected by computing the
distance between subsequent measurements and the resulting speed
approximation. Being able to automatically recognize trips, a user's pro le can be updated
instantly and without any user interaction.</p>
        <p>In fact, most context data available within the IYOUIT framework is
primarily concerned with real-time presence information about a user's current activity.
Even though the principle use of FOAF is focused on rather static pro le and
contact information, the idea to also represent highly dynamic and frequently
changing data seems to be reasonable as well. However, to actually state the
timeliness of information, a timestamp must be present along with the data
attribute and its value. One existing approach that utilizes dc:date attributes
is the so-called MeNow vocabulary.8 Basically, MeNow aims at describing the
6 http://vocab.org/relationship/
7 http://purl.org/net/vocab/2004/07/visit
8 http://crschmidt.net/foaf/menow/
current status of a person. Its properties allow for expressing that a user is
currently reading a book, the type of music he is listening or the websites he is
browsing, amongst others. Also worth noting is the possibility to express the
physical proximity of other users and their online activities. Therefore, MeNow
addresses the growing demand for vocabularies that express the timeliness of
information, as required for applications dealing with frequently changing
information. An excerpt of an automatically created IYOUIT user pro le is shown in
the Appendix, including applicable real-time presence information encoded with
the MeNow vocabulary.
4</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>
        The FOAF vocabulary is the semantic representation format of choice for
expressing social data in online networks. It has been explored in a broad variety
of research areas with recent interest stimulated by the Linked Data approach
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. A profound study of FOAF pro les found in online networks has been
conducted by Golbeck and Rothstein [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. By crawling available FOAF pro les and
the subsequent application of reasoning mechanisms, overlapping pro les and
links between separated networks are revealed. The authors show that users
tend to make connections between separate networks, leveraging once again the
need for a common representation format. Furthermore, implications on the use
of social networking data and the development of intelligent user interfaces are
given. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the authors extract social graphs from online networks to
investigate overlapping network fragments to link person instances from di erent
information sources. Three alternative methods to compute graph similarity are
discussed, including a low-level reasoning approach to investigate the implicit
semantic similarity. Identi ed matches in separated graphs are resolved and the
resulting links are in turn provided as a social graph.
      </p>
      <p>
        Likewise to the semantic representation of data, the visualization of
information on the web is a well-established research topic, too. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], the authors
describe algorithms for improving existing tag cloud visualization techniques by
optimizing the amount and placement of white spaces within the cloud. The
authors propose to utilize the font spacing attribute to describe the visual weight
and importance of single tags, however, the inner-tag space remains constant
and does not encode a temporal signi cance or correlation distribution. An
attempt to visualize tags over time is described by Dubinko et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In contrast
to our proposed methodology, the authors follow an animation-based approach.
The principle idea is to present only a selection of tags in a pre-de ned time
interval. This approach is concerned with characterizing a certain time period
rather than describing tags over time. No query restriction through the
interaction with the tags can be achieved, whereas the selection of tags is only based
on their frequency within the given time interval.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Summary &amp; Outlook</title>
      <p>The steady increase in the availability of semantically annotated knowledge
sources across the Web and the development of tools making use of that
information drives the ongoing trend towards a widespread, practical use of semantic
data. Even though FOAF has been around for almost a decade, it has seen recent
uptake through Google's attempt to crawl publicly available FOAF pro les and
Yahoo's SearchMonkey9 and its support for structured data, including RDF.</p>
      <p>Typically, the information represented with FOAF can be seen as rather
static, involving less frequent updates. However, the way people tend to use
tools and services on the Web and in turn their personal re ection in social
communities has changed considerably over the years. Frequently updating ones
presence in Twitter and the provision of personal information is common practice
for a lot of people. With IYOUIT we aim at simplifying this process through the
combination of context information with personal pro le data. Rich user pro les
are automatically created and published, always re ecting the latest level of
information. The timeliness of the information and the rich descriptions of a
user's preferences are meant to provide the basis for novel, user-centric services.</p>
      <p>
        In utilizing FOAF as the external representation format in combination with
the use of cool URIs [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], IYOUIT user pro les enter the Linked Data Web [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
However, FOAF has not been designed to represent frequently changing
information. Existing extensions like MeNow vocabulary provide at least a minimal
vocabulary to express a user's current activity. Nevertheless, in order to express
all available presence data in IYOUIT, a more ne-grained vocabulary is
required. Here, the possibility to not only express the actual level of information
but also outdated data and future trends might be worth considering. A broad
range of applications like personal recommendation engines [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] would
considerably pro t from multiple data snapshots in one distinct user pro le to better
reproduce the user's preferences over time. Having knowledge about the
temporal distribution of personal information allows applications to dynamically
adjust their service o erings and would therefore provide added value through
the use of social data on the Web.
      </p>
      <p>
        A future aspect of our work is to evaluate the use of exible semantic
representations, like (extended) FOAF, also as basic data structures internally within
IYOUIT components. Preliminary results on realizing an IYOUIT social network
visualization on a FOAF/RDF substrate via corresponding SPARQL queries
demonstrated greater exibility and improved robustness. The common
representation format allows to interlink distributed social graphs through the
interpretation of foaf:holdsAccount, owl:sameAs and rdfs:seeAlso triples in
a generic way and thus allows for browsing friendships across social networks
(almost) for free. Web 2.0 accounts that do not provide FOAF descriptions like
Flickr, Twitter, Last.FM or DBLP [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] are linked to wrappers that generate
the user pro les on the y using the corresponding Web 2.0 APIs or SPARQL
endpoints [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. We hope to extend this FOAF substrate with the dynamic
aspects discussed above, to realize the IYOUIT pro le browser completely based
on RDF and to fully integrate the current social network visualization.
9 http://developer.yahoo.com/searchmonkey/
&lt;foaf:PersonalProfileDocument rdf:about='http://.../user/1086/foaf'&gt;
&lt;foaf:maker rdf:resource='http://.../1086/foaf#me'/&gt;
&lt;foaf:primaryTopic rdf:resource='http://.../user/1086/foaf#me'/&gt;
&lt;/foaf:PersonalProfileDocument&gt;
&lt;foaf:Person rdf:about='http://.../1086/foaf#me'&gt;
&lt;rel:colleagueOf rdf:resource='http://.../1096/foaf#me'/&gt;
&lt;rel:friendOf rdf:resource='http://.../1231/foaf#me'/&gt;
&lt;rel:acquaintanceOf rdf:resource='http://.../user/1239/foaf#me'/&gt;
&lt;foaf:givenName&gt;Sebastian&lt;/foaf:givenName&gt;
&lt;foaf:family_name&gt;Boehm&lt;/foaf:family_name&gt;
&lt;foaf:mbox_sha1sum&gt;de287af181028474861d71b8b343805e9dbe5f15&lt;/foaf:mbox_sha1sum&gt;
&lt;foaf:based_near&gt;
&lt;geo:Point&gt;
&lt;geo:lat&gt;48.151700000000005&lt;/geo:lat&gt;
&lt;geo:long&gt;11.5411&lt;/geo:long&gt;
&lt;/geo:Point&gt;
&lt;/foaf:based_near&gt;
&lt;foaf:gender&gt;Male&lt;/foaf:gender&gt;
&lt;foaf:nick&gt;McCoy&lt;/foaf:nick&gt;
&lt;foaf:img rdf:resource='http://.../archive/photo/mccoy44_1.png'/&gt;
&lt;foaf:holdsAccount&gt;
&lt;foaf:OnlineAccount&gt;
&lt;foaf:accountServiceHomepage rdf:resource='http://www.flickr.com/'/&gt;
&lt;foaf:accountName&gt;83626367@N00&lt;/foaf:accountName&gt;
&lt;/foaf:OnlineAccount&gt;
&lt;/foaf:holdsAccount&gt;
&lt;foaf:interest dc:title='Rock' rdf:resource='http://dbpedia.org/resource/Rock'/&gt;
&lt;foaf:interest dc:title='Grunge' rdf:resource='http://dbpedia.org/resource/Grunge'/&gt;
&lt;foaf:knows&gt;
&lt;foaf:Person rdf:about='http://.../user/1084/foaf#me'&gt;
&lt;foaf:mbox_sha1sum&gt;c8b84c1fb9bd0d5457963a9e603996586d2d14a9&lt;/foaf:mbox_sha1sum&gt;
&lt;rdfs:seeAlso rdf:resource='http://.../user/1084/foaf#me'/&gt;
&lt;/foaf:Person&gt;
&lt;/foaf:knows&gt;
&lt;visit:country&gt;
&lt;iso:Country rdf:about="http://www.daml.org/2001/09/countries/iso#JP"&gt;
&lt;iso:code&gt;JP&lt;/iso:code&gt;
&lt;iso:name&gt;Japan&lt;/iso:name&gt;
&lt;/iso:Country&gt;
&lt;/visit:country&gt;
&lt;menow:hasStatus&gt;
&lt;menow:Status&gt;
&lt;dc:date&gt;2009-08-06T11:02:43Z&lt;/dc:date&gt;
&lt;menow:located&gt;
&lt;geo:Point&gt;
&lt;geo:lat&gt;48.143409&lt;/geo:lat&gt;
&lt;geo:long&gt;11.502268&lt;/geo:long&gt;
&lt;/geo:Point&gt;
&lt;/menow:located&gt;
&lt;menow:reading&gt;GWT in Action&lt;/menow:reading&gt;
&lt;menow:workingOn&gt;
&lt;foaf:Project&gt;
      </p>
      <p>&lt;dc:title&gt;X-Stream&lt;/dc:title&gt;
&lt;/foaf:Project&gt;
&lt;/menow:workingOn&gt;
&lt;/menow:Status&gt;
&lt;/menow:hasStatus&gt;
&lt;/foaf:Person&gt;</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Bohm,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Koolwaaij</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Luther</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Souville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Wagner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Wibbels</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Introducing IYOUIT</article-title>
          .
          <source>In: Proceedings of the International Semantic Web Conference (ISWC'08)</source>
          . Volume 5318 of LNCS., Springer Verlag (
          <year>2008</year>
          )
          <volume>804</volume>
          {
          <fpage>817</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Nurmi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koolwaaij</surname>
          </string-name>
          , J.:
          <article-title>Identifying meaningful locations</article-title>
          .
          <source>In: Proceedings of the 3rd International Conference on Mobile and Ubiquitous Systems (MobiQuitous'06)</source>
          , IEEE Computer Society (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          :
          <article-title>Data Mining: Practical machine learning tools and techniques</article-title>
          . Morgan Kaufmann (
          <year>2005</year>
          )
          <article-title>2nd Edition</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <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>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ives</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>DBpedia: A Nucleus for a Web of Open Data</article-title>
          .
          <source>In: Proceedings of the 6th International Semantic Web Conference (ISWC'07)</source>
          . Volume 4825 of LNCS., Springer Verlag (
          <year>2007</year>
          )
          <volume>722</volume>
          {
          <fpage>735</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Brickley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miller</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <source>FOAF Vocabulary Speci cation 0</source>
          .91. Available at http://xmlns.com/foaf/spec/ (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Bohm,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Luther</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Wagner</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          :
          <article-title>Smarter groups { reasoning on qualitative information from your desktop</article-title>
          .
          <source>In: Proceedings of the 1st Workshop on The Semantic Desktop at the ISWC'05. Volume 175 of CEUR Workshop Proceedings</source>
          .,
          <string-name>
            <surname>Galway</surname>
          </string-name>
          , Ireland, CEUR-WS.org (
          <year>2005</year>
          )
          <volume>276</volume>
          {
          <fpage>280</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Idehen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Linked Data on the Web</article-title>
          .
          <source>In: Proceedings of the WWW2008 Workshop on Linked Data on the Web. Volume 369 of CEUR Workshop Proceedings., CEUR-WS.org</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Golbeck</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rothstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Linking social networks on the Web with FOAF: A semantic web case study</article-title>
          .
          <source>In: Proceedings of the Twenty-Third AAAI Conference on Arti cial Intelligence (AAAI'08)</source>
          , AAAI Press (
          <year>2008</year>
          )
          <volume>1138</volume>
          {
          <fpage>1143</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rowe</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Interlinking distributed social graphs</article-title>
          .
          <source>In: Proceedings of WWW 2009 Workshop on Linked Data on the Web</source>
          .
          <article-title>(</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kaser</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lemire</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Tag-cloud drawing: Algorithms for cloud visualization</article-title>
          .
          <source>The Computing Research Repository</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Dubinko</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magnani</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Novak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tomkins</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Visualizing tags over time</article-title>
          .
          <source>ACM Transactions on the Web</source>
          <volume>1</volume>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sauermann</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
          </string-name>
          , R.:
          <article-title>Cool URIs for the semantic web</article-title>
          .
          <source>W3C Interest Group Note 03 December</source>
          <year>2008</year>
          , World Wide Web Consortium (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Avesani</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Massa</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tiella</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A trust-enhanced recommender system application: Moleskiing</article-title>
          .
          <source>In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC'05)</source>
          , ACM Press (
          <year>2004</year>
          )
          <volume>1589</volume>
          {
          <fpage>1593</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Ley</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The DBLP computer science bibliography: Evolution, research issues, perspectives</article-title>
          .
          <source>In: Proceedings of the 9th International Symposium on String Processing and Information Retrieval</source>
          , Springer Verlag (
          <year>2002</year>
          )
          <volume>1</volume>
          {
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Passant</surname>
          </string-name>
          , A.:
          <article-title>:me owl:sameas ickr:33669349@n00</article-title>
          .
          <source>In: Procceedings of the WWW 2008 Workshop on Linked Data on the Web (LDOW'08)</source>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>