The ongoing spread of online social networking and sharing
sites has reshaped the way how people interact with each
other. Analyzing the relatedness of dierent users within the
resulting large populations of these systems plays an impor-
tant role for tasks like user recommendation or community
detection. Algorithms in these elds typically face the pro-
blem that explicit user relationships (like friend lists) are
often very sparse. Surprisingly, implicit evidences (like click
logs) of user relations have hardly been considered.
Based on our long-time experience with running the social
bookmark and publication sharing platform BibSonomy 4,
we identify in this paper dierent evidence networks of user
relationships in our system. We broadly classify each net-
work based on whether the links are explicitly established
by the users (e. g., friendship or group membership) or ac-
crue implicitly in the running system (e. g., when user u
copies an entry of user v). We systematically analyze struc-
tural properties of these networks and whether topological
closeness (in terms of the length of shortest paths) coincides
with semantic similarity between users.
Our results exhibit dierent characteristics and provide
preparatory work for the inclusion of new (and less spar-
se) information into the process of optimizing community
detection or user recommendation algorithms
%0 Conference Paper
%1 tagging-mitzlaff
%A Mitzlaff, Folke
%A Benz, Dominik
%A Stumme, Gerd
%A Hotho, Andreas
%B Proceedings of the 21st ACM conference on Hypertext and hypermedia
%C Toronto, Canada
%D 2010
%K network-analysis qual tagging
%T Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy
%X The ongoing spread of online social networking and sharing
sites has reshaped the way how people interact with each
other. Analyzing the relatedness of dierent users within the
resulting large populations of these systems plays an impor-
tant role for tasks like user recommendation or community
detection. Algorithms in these elds typically face the pro-
blem that explicit user relationships (like friend lists) are
often very sparse. Surprisingly, implicit evidences (like click
logs) of user relations have hardly been considered.
Based on our long-time experience with running the social
bookmark and publication sharing platform BibSonomy 4,
we identify in this paper dierent evidence networks of user
relationships in our system. We broadly classify each net-
work based on whether the links are explicitly established
by the users (e. g., friendship or group membership) or ac-
crue implicitly in the running system (e. g., when user u
copies an entry of user v). We systematically analyze struc-
tural properties of these networks and whether topological
closeness (in terms of the length of shortest paths) coincides
with semantic similarity between users.
Our results exhibit dierent characteristics and provide
preparatory work for the inclusion of new (and less spar-
se) information into the process of optimizing community
detection or user recommendation algorithms
@inproceedings{tagging-mitzlaff,
abstract = {{The ongoing spread of online social networking and sharing
sites has reshaped the way how people interact with each
other. Analyzing the relatedness of dierent users within the
resulting large populations of these systems plays an impor-
tant role for tasks like user recommendation or community
detection. Algorithms in these elds typically face the pro-
blem that explicit user relationships (like friend lists) are
often very sparse. Surprisingly, implicit evidences (like click
logs) of user relations have hardly been considered.
Based on our long-time experience with running the social
bookmark and publication sharing platform BibSonomy [4],
we identify in this paper dierent evidence networks of user
relationships in our system. We broadly classify each net-
work based on whether the links are explicitly established
by the users (e. g., friendship or group membership) or ac-
crue implicitly in the running system (e. g., when user u
copies an entry of user v). We systematically analyze struc-
tural properties of these networks and whether topological
closeness (in terms of the length of shortest paths) coincides
with semantic similarity between users.
Our results exhibit dierent characteristics and provide
preparatory work for the inclusion of new (and less spar-
se) information into the process of optimizing community
detection or user recommendation algorithms}},
added-at = {2011-09-28T23:59:32.000+0200},
address = {Toronto, Canada},
author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas},
biburl = {https://www.bibsonomy.org/bibtex/2a97c4f7e80dcb666450acf697002155e/dimitargn},
booktitle = {Proceedings of the 21st ACM conference on Hypertext and hypermedia},
citeulike-article-id = {9755515},
interhash = {5584c4c57fcd8eb4663df8b114bcf09c},
intrahash = {a97c4f7e80dcb666450acf697002155e},
keywords = {network-analysis qual tagging},
posted-at = {2011-09-09 20:12:02},
priority = {3},
timestamp = {2011-10-13T18:20:03.000+0200},
title = {{Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy}},
year = 2010
}