%0 Conference Paper
%1 neubauer2009hyperincident
%A Neubauer, Nicolas
%A Obermayer, Klaus
%B HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia
%C New York, NY, USA
%D 2009
%I ACM
%K analysis component connected folksonomy graph ht09 tagging
%T Hyperincident Connected Components of Tagging Networks
%X Data created by social bookmarking systems can be described as
3-partite 3-uniform hypergraphs connecting documents, users, and
tags (tagging networks),
such that the toolbox of complex network analysis can be applied to
examine their properties. One of the most basic tools, the
analysis of connected components, however cannot be applied
meaningfully: Tagging networks
tend to be almost entirely connected. We therefore propose a
generalization of connected components, m-hyperincident
connected components.
We show that decomposing tagging networks into 2-hyperincident
connected components yields a characteristic component
distribution with a salient giant component that can be found
across various datasets.
This pattern changes if the underlying formation process
changes, for example, if the hypergraph is constructed from
search logs, or if the tagging data is contaminated by spam: It
turns out that the second- to 129th largest components of the
spam-labeled Bibsonomy dataset are inhabited exclusively by spam
users. Based on these findings, we propose and unsupervised
method for spam detection.