@article{Atzmueller:12c, author = {Atzmueller, Martin}, interhash = {0b20c1d53d5df05326d594726273c2fb}, intrahash = {7b616e64994893a2aad95b5ad95db662}, journal = {WIREs: Data Mining and Knowledge Discovery}, title = {{Mining Social Media: Key Players, Sentiments, and Communities}}, volume = {In Press}, year = 2012 } @inproceedings{krause2008antisocial, abstract = {The annotation of web sites in social bookmarking systemshas become a popular way to manage and find informationon the web. The community structure of such systems attractsspammers: recent post pages, popular pages or specifictag pages can be manipulated easily. As a result, searchingor tracking recent posts does not deliver quality resultsannotated in the community, but rather unsolicited, oftencommercial, web sites. To retain the benefits of sharingone’s web content, spam-fighting mechanisms that can facethe flexible strategies of spammers need to be developed.}, address = {New York, NY, USA}, author = {Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd}, booktitle = {AIRWeb '08: Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web}, doi = {10.1145/1451983.1451998}, file = {krause2008antisocial.pdf:krause2008antisocial.pdf:PDF}, groups = {public}, interhash = {a45d40ac7776551301ad9dde5b25357f}, intrahash = {5b6b648fd25c15d594404ae26fcda6b4}, isbn = {978-1-60558-159-0}, location = {Beijing, China}, month = apr, pages = {61--68}, publisher = {ACM}, title = {The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems}, url = {http://airweb.cse.lehigh.edu/2008/submissions/krause_2008_anti_social_tagger.pdf}, username = {dbenz}, year = 2008 } @inproceedings{bullock2011privacyaware, abstract = {With the increased popularity of Web 2.0 services in the last years data privacy has become a major concern for users. The more personal data users reveal, the more difficult it becomes to control its disclosure in the web. However, for Web 2.0 service providers, the data provided by users is a valuable source for offering effective, personalised data mining services. One major application is the detection of spam in social bookmarking systems: in order to prevent a decrease of content quality, providers need to distinguish spammers and exclude them from the system. They thereby experience a conflict of interests: on the one hand, they need to identify spammers based on the information they collect about users, on the other hand, they need to respect privacy concerns and process as few personal data as possible. It would therefore be of tremendous help for system developers and users to know which personal data are needed for spam detection and which can be ignored. In this paper we address these questions by presenting a data privacy aware feature engineering approach. It consists of the design of features for spam classification which are evaluated according to both, performance and privacy conditions. Experiments using data from the social bookmarking system BibSonomy show that both conditions must not exclude each other.}, acmid = {2024306}, address = {New York, NY, USA}, articleno = {15}, author = {Bullock, Beate Navarro and Lerch, Hana and Ro\ssnagel, Alexander and Hotho, Andreas and Stumme, Gerd}, booktitle = {Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies}, doi = {10.1145/2024288.2024306}, interhash = {7a2d6a35c124ea0fe31c962f8f150916}, intrahash = {00a8f31185a34957eb16d500d7d51398}, isbn = {978-1-4503-0732-1}, location = {Graz, Austria}, numpages = {8}, pages = {15:1--15:8}, publisher = {ACM}, series = {i-KNOW '11}, title = {Privacy-aware spam detection in social bookmarking systems}, url = {http://doi.acm.org/10.1145/2024288.2024306}, year = 2011 } @inproceedings{FalBarSpi07, author = {Falkowski, Tanja and Barth, Anja and Spiliopoulou, Myra}, booktitle = {In Proc. of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence,}, interhash = {abd9653fc405547fd263c72c5bc5ae88}, intrahash = {c0f9b82222d0c9a0b1cb0a5fa41a735a}, pages = {112-115}, title = {DENGRAPH: A Density-based Community Detection Algorithm}, url = {http://wwwiti.cs.uni-magdeburg.de/~tfalkows/publ/2007/WI_FalBarSpi07.pdf}, year = 2007 } @article{kumar99trawling, author = {Kumar, Ravi and Raghavan, Prabhakar and Rajagopalan, Sridhar and Tomkins, Andrew}, interhash = {18f10df4843e07c2bcec1cd916aa5da0}, intrahash = {e1ce1b53c051efa1892dbc3b09643c31}, journal = {Computer Networks }, number = {11--16}, pages = {1481--1493}, title = {Trawling the {Web} for emerging cyber-communities}, url = {citeseer.ist.psu.edu/kumar99trawling.html}, volume = 31, year = 1999 } @inproceedings{jaeschke2006wege, abstract = {Ein wichtiger Baustein des neu entdeckten World Wide Web -- des "`Web 2.0"' -- stellen Folksonomies dar. In diesen Systemen können Benutzer gemeinsam Ressourcen verwalten und mit Schlagwörtern versehen. Die dadurch entstehenden begrifflichen Strukturen stellen ein interessantes Forschungsfeld dar. Dieser Artikel untersucht Ansätze und Wege zur Entdeckung und Strukturierung von Nutzergruppen ("Communities") in Folksonomies.}, address = {Halle-Wittenberg}, author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Stumme, Gerd}, booktitle = {Proc. 18. Workshop Grundlagen von Datenbanken}, editor = {Braß, Stefan and Hinneburg, Alexander}, interhash = {59224b5889a24108434a9b5ecc6b0887}, intrahash = {2b6be3bd5daee7119973fcf69909956f}, month = {June}, pages = {80-84}, publisher = {Martin-Luther-Universität }, title = {Wege zur Entdeckung von Communities in Folksonomies}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006wege.pdf}, year = 2006 } @inproceedings{hotho2006trend, abstract = {As the number of resources on the web exceeds by far the number of documents one can track, it becomes increasingly difficult to remain up to date on ones own areas of interest. The problem becomes more severe with the increasing fraction of multimedia data, from which it is difficult to extract some conceptual description of their contents. One way to overcome this problem are social bookmark tools, which are rapidly emerging on the web. In such systems, users are setting up lightweight conceptual structures called folksonomies, and overcome thus the knowledge acquisition bottleneck. As more and more people participate in the effort, the use of a common vocabulary becomes more and more stable. We present an approach for discovering topic-specific trends within folksonomies. It is based on a differential adaptation of the PageRank algorithm to the triadic hypergraph structure of a folksonomy. The approach allows for any kind of data, as it does not rely on the internal structure of the documents. In particular, this allows to consider different data types in the same analysis step. We run experiments on a large-scale real-world snapshot of a social bookmarking system.}, address = {Heidelberg}, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, booktitle = {Proc. First International Conference on Semantics And Digital Media Technology (SAMT) }, date = {2006-12-13}, editor = {Avrithis, Yannis S. and Kompatsiaris, Yiannis and Staab, Steffen and O'Connor, Noel E.}, ee = {http://dx.doi.org/10.1007/11930334_5}, interhash = {227be738c5cea57530d592463fd09abd}, intrahash = {42cda5911e901eadd0ac6a106a6aa1dc}, isbn = {3-540-49335-2}, month = dec, pages = {56-70}, publisher = {Springer}, series = {LNCS}, title = {Trend Detection in Folksonomies}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006trend.pdf}, vgwort = {27}, volume = 4306, year = 2006 }