<!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>Mining User Profiles to Support Structure and Explanation in Open Social Networking</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Avare´ Stewart</string-name>
          <email>stewart@L3S.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ernesto Diaz-Aviles</string-name>
          <email>diaz@L3S.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wolfgang Nejdl</string-name>
          <email>nejdl@L3S.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>L3S Research Center / Leibniz Universita ̈t Hannover Appelstr. 9a</institution>
          ,
          <addr-line>30167 Hannover</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <fpage>21</fpage>
      <lpage>30</lpage>
      <abstract>
        <p>The proliferation of media sharing and social networking websites has brought with it vast collections of site-specific user generated content. The result is a Social Networking Divide in which the concepts and structure common across different sites are hidden. The knowledge and structures from one social site are not adequately exploited to provide new information and resources to the same or different users in comparable social sites. For music bloggers, this latent structure, forces bloggers to select sub-optimal blogrolls. However, by integrating the social activities of music bloggers and listeners, we are able to overcome this limitation: improving the quality of the blogroll neighborhoods, in terms of similarity, by 85 percent when using tracks and by 120 percent when integrating tags from another site.</p>
      </abstract>
      <kwd-group>
        <kwd>Open Social Networking</kwd>
        <kwd>Cross Domain Discovery</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The increasingly growing collections of user generated content spread over
heterogeneous social networking and media sharing platforms, each supporting specific media
types. The content typically has a latent structure and latent, interrelated topics: this has
resulted in a Social Networking Divide.</p>
      <p>Recent advances toward a more Open Social Networking (OSN) paradigm are
focused on (de facto) standards, and only address part of the problem. Specifically,
current OSN efforts attempt to handle issues related to the portability of data, common
APIs (e.g., Google OpenSocial1), and social graphs, e.g., FOAF2, XHTML Friends
Network3.</p>
      <p>We posit that open social networking is more than an agreed upon “language” for
describing relationships and sharing data across systems. In addition, it is the
exploitation of social activities in one site, to support the discovery of new interrelationships
within a community. This is crucial, given that it is becoming increasingly difficult for
seekers to cope with the cognitive challenges of efficiently finding and effectively
analyzing relevant information, when inundated with its volume, variety and evolution.
1.1</p>
    </sec>
    <sec id="sec-2">
      <title>Scenario</title>
      <p>To motivate the aforementioned ideas, consider the following scenario in which there
are two social network sites. In one site, a Blogger.com4, music community, the main
activities are writing text about artists, tracks, albums or music videos. Bloggers create
explicit links to other participants to express their preferred blogs (via a blogroll). In the
other site: Last.fm5, the users listen to music tracks, tag these tracks and build friendship
relationships.</p>
      <p>Symbiotically, the social activities in one site can have an impact on the other site.
Blogger.com bloggers do not tag the entities about which they write. However, the
tagging activity can better help bloggers see the structure in their community and find new
information. Conversely, Last.fm users do not provide prose for the tracks they listen
to, but such prose can be a valuable source of metadata for audio tracks.</p>
      <p>In Figure 1, a navigation tool is depicted, in which the Blogger.com site has been
enriched with information from Last.fm. The graph represents the similarity between
(potentially unknown) bloggers on the set of tracks they have written about in their
blogs. By selecting a node in the graph, the list if tracks that blogger has mentioned
in their blogsite is presented, along with the overall popularity of these tracks. Also
depicted in the figure are the tags from Last.fm, which can be used to filter the nodes
and edges in the graph. The tool supports navigation and visualization of latent concepts
and relations within, and across the sites. One of the challenges in realizing such a
scenario is that the concepts and structure within —and across domains— are latent.
Specifically within blogs, the topics to which the blog site is devoted, are very often not
made explicit. Furthermore, the readership relationship is typically unobserved; and
the blogroll relationship, though observed, is often unexplained. Finally, standards may
support, but do not address, how the social practices in one domain may be exploited to
support bloggers in another similar social site; particularly when resources of different
types are being mapped.</p>
      <p>The contributions of this work are: 1) extension of the commonly held view to
open social networking: to infer new relationships and resources, and provide support
with navigation and visualization across comparable social networks; 2) integration
music bloggers with music listeners; bridging the gap between different types of social
networking systems; 3) examination of the blogroll relationship in the music domain
based an open social networking approach.</p>
      <p>In Section 2 we discuss related research in cross domain discovery. In Section 3
we present the conceptual approach to open social networking in the music domain. In
Section 4 experimental results are presented and in Section 5 we conclude and discuss
future work.
2</p>
      <sec id="sec-2-1">
        <title>Related Work</title>
        <p>
          In machine learning, cross domain discovery [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] or domain adaptation [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] is a body of
work in which multiple information sources from comparable, but different domains are
combined. Work done in this area has focused on classification tasks, in which labeled
data exists in abundance in one domain, but a statistical model that performs well on a
related domain is desired. Since hand-labeling in the new domain is costly, one often
wishes to leverage the original out-of-domain data when building a model of the new,
in-domain data [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
        </p>
        <p>
          Also in the area of machine learning, the method of View Completion [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], has
used collaborative tags to heuristically complete missing or inadequate feature sets (or
views). The basic premise underlying view completion, is that for many tasks,
combining multiple information sources yields significantly better results than using just a
single one alone. Views are used in this case, since that blogs are not typically available
on collaborative tagging websites, and as such the tags provided by bloggers suffer from
the vocabulary problem and cannot be adequately used as a shared index.
        </p>
        <p>
          Another related area is Cross-System Personalization [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] which enables
personalization information across different systems to be shared. In digital libraries, cross system
personalization is used to overcome the problem that information needed to support
a personalized user experience is not shared among different libraries. In other work,
the focus has been on adequate representations of [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ], and dependencies between [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]
the user’s profile, to support a unified representation in the different systems. These
approaches are ego-centric in that they assume the same user to exist across different
systems; and that the user is interested in an aggregated view of their profile or social
networking information. This is not the case in an open social networking environment,
where users are assumed to be similar (in some way), but have distinct digital identities.
Our view is a socio-centric one and focuses on common patterns in the community as a
whole.
        </p>
        <p>
          Work exists, in the area of association mining [
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]. In [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] the goal is to provide
a seamless navigation between tag spaces. The work presented in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] merges the areas
of formal concept analysis and association rule mining to discover shared
conceptualizations that are hidden in folksonomies. They present a formalism for folksonomies
that includes a set U of users, a set T of tags, and a set R of resources, represented by
the ternary relation, Y . In our work, it is the set, T , of tags in the ternary relation that
we propagate from one site to enrich another. Furthermore, we propose, that
“citizendefined” structuring (i.e. blogroll, friends, or comment networks) allow other types of
ternary relations to be inferred, that are not restricted to the user-tag-resource triple.
3
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Open Social Networking: the Music Domain</title>
        <p>Open social networking, has two-fold goal: 1)improve the structure of information
within a single site and 2)exploit the social activities in a different sites to enhance
the activities in comparable ones. Toward this end, two aspects are considered: a
representation for the activities within each social site; and mapping parts of the data and
structures from one social site to another, to augment the social activities therein.
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Terminology</title>
      <p>
        We adopt the definition of a folksonomy as described by Hotho et al. [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ], as a
four-tuple6, F := (U, T, R, Y ) , where:
• U ,T and R are finite sets, whose elements are called users, tags and resources,
respectively, and
• Y a ternary relation between them, i.e. Y ⊆ U × T × R, whose elements are called
tag assignments.
      </p>
      <p>For the music domain, the set of resources are considered to be artists, tracks and
albums. Additionally, we distinguish the different roles a site may have when describing
the mappings between them. A target site, or in-domain site, is the one onto which
data from another social site is mapped. The out-of-domain site is the social site from
which data is extracted to augment the comparable, target site. The roles of in- and
outof-domain may be interchanged depending upon integration goals, and there may be
multiple out-of-domain sites. For the purpose of this work, we consider Blogger.com
and Last.f m to be the in-domain site and out-of-domain site, respectively.
3.2</p>
    </sec>
    <sec id="sec-4">
      <title>Cross-Site Enrichment</title>
      <p>
        We represent the Blogger.com music community conceptually as tuples,
B := {(ub, rb) | (ub, rb) ∈ UBlogger.com × RBlogger.com}, since Blogger.com bloggers
6 In the original definition [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ], it is additionally introduced a subtag/supertag relation, which
we omit for the purpose of this paper.
do not tag the entities about which they write. On the other hand, the Last.fm social site
is ripe with tag data of the form L := {(ul, tl, rl) | (ul, tl, rl) ∈ ULast.fm ×TLast.fm ×
RLast.fm}, representing the tag a given user has applied to a track within Last.fm. Then
the mapping of tags onto Blogger.com is computed as follows:
      </p>
      <p>Y := {(u, t, r) | (u, t, r) ∈ πub,tl,rb (σrb=rl (B × L))}
(1)
were σ and π are the relational algebra operators for selection and projection,
respectively.</p>
      <p>First, from the cartesian product B × L, the tuples with equal resources in both sites
are selected, and then the projection is taken over the Blogger.com users, the Last.fm
tags, and the common resource elements. In general, the user sets are considered to be
disjoint, i.e., UBlogger.com ∩ ULast.fm = ∅.
3.3</p>
    </sec>
    <sec id="sec-5">
      <title>Site-Specific Enrichment</title>
      <p>The (hidden) relationships between blogs and/or bloggers can be exploited to infer
relationships between the entities within the blog site. However, even within a single blog
community, the relationships between resources, may not be well understood. For this
reason, we undertake an exploratory analysis of the blogroll relationship.
4</p>
      <sec id="sec-5-1">
        <title>Experiments</title>
        <p>The experimental goals are to first examine the explicit blogroll structure; laying the
foundation for further analysis of an ideal or “optimal” resource-specific blogrolls.
Resource specific blogrolls are those in which the nature of the blogroll is assumed to be
explained in terms similarity in tastes for a given type of resource, i.e., track, or artist.
Then, to investigate the extent to which these optimal resource-specific blogrolls:
overlap with the explicit blogrolls; and with each other. In the remainder of this discussion
”‘optimal”’ resource-specific blogrolls is referred to as optimal blogrolls.
4.1</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Data Set</title>
      <p>For Cross System Music Blog Mining, we used two data sets: one data set consisted of
personal music blogs from Blogger.com, one of the most popular blogsites, whereas
the second data set consisted of tagged tracks from Last.f m, a radio and music
community website and one of the largest social music platforms. The details of each data
set are presented in this section.</p>
      <p>Blogger.com Community: The blogroll relationship induces a network representing a
preferential reading of others people’s blogs. The network data was collected by
experimentally selecting seed bloggers using several music directories7 and limiting the</p>
      <sec id="sec-6-1">
        <title>7 http://www.musicblogscatalog.com/</title>
        <p>http://yocheckthisjam.com/music-blog-directory/
http://www.blogged.com/directory/entertainment/music/rock
http://www.blogcatalog.com/directory/music/rock
bloggers selected to the genre of pop and rock music in the Blogger.com domain. The
blogroll for each seed was traversed, fanning out in a breath-first order, yielding a total
number of bloggers equal to |UBlogger.com| = 976.</p>
        <p>Summary statistics for the overall structure and topological statistics for the largest
five weak components are given in Table 1, from there it can be seen that the
components exhibit varying structural properties and that the structural view provided by the
blogroll is a disjointed one.</p>
        <p>In addition to the community data, profiles were built by parsing the tracks in the
user’s blog and relying upon a dictionary of tracks gathered from MusicBrainz.org8. A
total of 2196 unique tracks were collected; and for these tracks, a total 147801 Last.fm
tags were obtained, which allowed us to construct the triples.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Blogroll Quality Based on Tracks and Tags We investigate the extent to which the</title>
      <p>explicit blogroll relationship, within the in-domain site, can be described by the
similarity between track and tag profiles. For each user u ∈ U , i.e. blogger, a track-based
vector profile (track profile ) u is constructed such that u := {0, 1}|R|, with the ith
dimension ui set to 1 if the track ri ∈ Ru, appears in the user’s blog, and 0 otherwise.
Alternatively, after including the tag information from the out-of-domain site, we
constructed a profile based on tag annotations, which corresponds to thetag profile for the
user, i.e., u := {0, 1}|T |, with the ith dimension ui set to 1 if the tag ti ∈ Tu, and 0
otherwise9.</p>
      <sec id="sec-7-1">
        <title>8 http://www.musicbrainz.org</title>
        <p>9 The 20000 most popular tags were used to build the profiles, i.e.|T | = 20000
To evaluate the quality of the explicit blogroll Bu of user u, we computed an
average similarity score between a user and all the persons in his blogroll. We perform the
similarity computation using the cosine-based measure:
sim(u, v) := cos(u, v) := hu, vi (2)
||u|| · ||v||
where u and v denote either the track or tag profiles of usersu and v, respectively.</p>
        <p>For the optimal blogroll B∗ computation, we constructed a user-track (resp.,
usertag) profile matrix and proceeded as follows:
(i) Compute the user similarity matrix S|U|×|U| := (sim(u, v))
(ii) Keep the highest k entries in each column of S.
(iii) Set the optimal blogroll based on track profile (resp., tag profiles) for useru, i.e.,
Bu∗ R (resp., Bu∗ T ), to be the users in the non-zero columns of the corresponding
u’s row.</p>
        <p>In our experiments we set the value of parameter k = 10. Table 2 summarizes the
results.</p>
        <p>BR∗ and BT∗ Overlap measures the extent to which optimal blogrolls, computed with
track and tag profiles, agree on his members. We found that 77.66% of the time they
agree on at least one member, and the average of the overlap in these cases is Avg(|BR∗∩
BT∗ |) = 4.64 ≈ 5 bloggers out of 10 (the fixed size of the optimal blogrolls). The
distribution of the intersection size for the optimal blogrolls is presented in Fig. 4.
4.3</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Discussion</title>
      <p>From Table 2, it can be observed that the improvement, in terms of similarity, when
computing B∗ based on tracks is 85%, and 120% when tag profiles are used. The table
also shows that the overlap between the explicit and optimal blogrolls, computed either
with track or tag profiles, occurs only9% of the time, corresponding to an average of a
single blogger in those cases.</p>
      <p>Furthermore, the optimal blogroll similarity distributions are better than the one
produced by the explicit relationships, as shown in Fig. 3, which corresponds to the
absolute frequencies of the explicit and optimal blogrols, for different values of similarity.
The frequencies of optimal blogrolls, for similarity values over 0.5, are higher than the
ones for explicit blogrolls.
(0.5,83.56)
(0.5,35.68)</p>
      <p>B
B*
B
B*
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1</p>
      <p>Similarity based on Track Profiles
(a)
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1</p>
      <p>Similarity based on Tag Profiles
(b)</p>
      <p>The cumulative frequency of blogrolls over discrete similarity bins is presented in
Fig. 2, which shows that both the track-based (49.27%) and tag-based (64.32%) optimal
blogrolls exhibit good similarity quality, i.e., over 0.50, in contrast to the respective
explicit blogrolls, where just less than 11% of them in the case of track-based profiles
(resp., 16.44% for tag-based) fall in bins corresponding to similarity values over 0.5.
Tag based computations perform better than using tracks, i.e., builds optimal blogrolls
with higher values of similarity, this can be explained by the fact that tags capture some
structure of the domain, e.g., genre, improving the overlap between user profiles when
computing the similarity measure.</p>
      <p>10.35
2.71</p>
      <p>5.65
1
2
3
Intersection between B*tracks and B*tags
4</p>
      <p>5 6
Intersection Size
7
8
9
10
In this paper, we explored to what extent the knowledge and structures from one
social site (out-of-domain) can be adequately exploited to provide new information and
resources to the users in a comparable social site (in-domain), in particular for a
music blog community within the Blogger.com social network. An examination of the
explicit blogroll structure, which is assumed to express a preferential reading of others
people’s blogs, has revealed that bloggers tend to produce sub-optimal blogrolls when
measuring the similarity between users based on track, as well as tags. The implication
for this is that if users are interested in learning about tracks, tags or other bloggers,
some assistance to guide them is needed. On the other hand, neither tracks nor tags
comes close to fully “explaining” the nature of the blogroll.</p>
      <p>However, by integrating the social activities of music bloggers and listeners, we were
able to overcome this limitation. We have shown the improvement that Open Social
Networking can have on the quality of blogrolls: Last.fm offers better optimal blogrolls,
than the tracks alone, from Blogger.com, improving the quality of the blogroll
neighborhoods, in terms of similarity, by 85% when using tracks and by 120% percent when
integrating tags from the site. The higher value of similarities computed based on tags
can be explained by the fact that tags capture some structure of the domain, e.g., genre,
increasing the overlap probability and size on the user profiles. Though this do not
necessarily mean that tags are better predictor of similarity than tracks, it strongly suggests
that the kind of information captured by tags can be exploited effectively,
complementing tasks or models where tracks are used alone.</p>
      <p>Although our investigation has provided promising results, we believe that our
contribution is an initial step in the study of Open Social Networking, future work is required to
evaluate the usefulness of optimal blogrolls, e.g., in providing recommendations.
Furthermore, we plan to investigate the extent to which the explicit community bonds and
“citizen-defined” structuring (i.e. blogroll, friends, or comment networks) can be
described by mining and inferring associations between the profiles of users across social
sites, towards a more general model, that considers new dimensions beyond the ternary
relation between users, tags and resources.</p>
      <p>Acknowledgements. This work was funded in part by the European Project PHAROS
(IST Contract No. 045035), and by the Programme AlBan, the European Union
Programme of High Level Scholarships for Latin America, scholarship no. E07D400591SV.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Swarup</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ray</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          :
          <article-title>Cross-domain knowledge transfer using structured representations</article-title>
          .
          <source>In: AAAI</source>
          , AAAI Press (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. III,
          <string-name>
            <surname>H.D.</surname>
          </string-name>
          ,
          <string-name>
            <surname>Marcu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Domain adaptation for statistical classifiers</article-title>
          .
          <source>J. Artif. Intell. Res. (JAIR) 26</source>
          (
          <year>2006</year>
          )
          <fpage>101</fpage>
          -
          <lpage>126</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dai</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xue</surname>
            ,
            <given-names>G.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Co-clustering based classification for out-of-domain documents</article-title>
          .
          <source>In: KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          , New York, NY, USA, ACM (
          <year>2007</year>
          )
          <fpage>210</fpage>
          -
          <lpage>219</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Shankara</given-names>
            <surname>Bhargava</surname>
          </string-name>
          <article-title>Subramanya: View Completation And Collaborative Tagging In Blogosphere</article-title>
          .
          <source>Master's thesis</source>
          , Arizona State University (
          <year>July 2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bhaskar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Cross system personalization by learning manifold alignments</article-title>
          . 4314/
          <year>2007</year>
          (
          <year>2006</year>
          )
          <fpage>244</fpage>
          -
          <lpage>259</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Niedere</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stewart</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehta</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hemmje</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>A multi-dimensional, unified user model for cross-system personalization</article-title>
          .
          <source>In: Proceedings of Workshop On Environments For Personalized Information Access at Advanced Visual Interfaces</source>
          . (May
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , F.:
          <article-title>User modeling for cross system personalization in digital libraries</article-title>
          .
          <source>Information Technologies and Applications in Education</source>
          ,
          <year>2007</year>
          .
          <source>ISITAE '07. First IEEE International Symposium on (Nov</source>
          .
          <year>2007</year>
          )
          <fpage>238</fpage>
          -
          <lpage>243</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Bhaskar</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Cross system personalization by factor analysis</article-title>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Oldenburg</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Comparative studies of social classification systems using rss feeds</article-title>
          . In Cordeiro, J.,
          <string-name>
            <surname>Filipe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hammoudi</surname>
          </string-name>
          , S., eds.:
          <source>WEBIST (2)</source>
          , INSTICC Press (
          <year>2008</year>
          )
          <fpage>394</fpage>
          -
          <lpage>403</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Ja¨schke, R.,
          <string-name>
            <surname>Hotho</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmitz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganter</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
          </string-name>
          , G.:
          <article-title>Discovering shared conceptualizations in folksonomies</article-title>
          .
          <source>Web Semant</source>
          .
          <volume>6</volume>
          (
          <issue>1</issue>
          ) (
          <year>2008</year>
          )
          <fpage>38</fpage>
          -
          <lpage>53</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hotho</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jschke</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmitz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stumme</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>In: Information Retrieval in Folksonomies: Search and Ranking</article-title>
          . Volume
          <volume>4011</volume>
          of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg (
          <year>2006</year>
          )
          <fpage>411</fpage>
          -
          <lpage>426</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>