Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups.

@incollection{mitzlaff2011community, author = {Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, title = {Community Assessment Using Evidence Networks}, editor = {Atzmueller, Martin and Hotho, Andreas and Strohmaier, Markus and Chin, Alvin}, booktitle = {Analysis of Social Media and Ubiquitous Data}, series = {Lecture Notes in Computer Science}, publisher = {Springer Berlin Heidelberg}, year = {2011}, volume = {6904}, pages = {79-98}, url = {http://dx.doi.org/10.1007/978-3-642-23599-3_5}, doi = {10.1007/978-3-642-23599-3_5}, isbn = {978-3-642-23598-6}, keywords = {tagging, networks, evidence, community, aboutBibSonomy}, abstract = {Community mining is a prominent approach for identifying (user) communities in social and ubiquitous contexts. While there are a variety of methods for community mining and detection, the effective evaluation and validation of the mined communities is usually non-trivial. Often there is no evaluation data at hand in order to validate the discovered groups.} }

%0 = incollection %A = Mitzlaff, Folke and Atzmueller, Martin and Benz, Dominik and Hotho, Andreas and Stumme, Gerd %B = Analysis of Social Media and Ubiquitous Data %D = 2011 %I = Springer Berlin Heidelberg %T = Community Assessment Using Evidence Networks %U = http://dx.doi.org/10.1007/978-3-642-23599-3_5

The ongoing spread of online social networking and sharing sites has reshaped the way how people interact with each other. Analyzing the relatedness of different users within the resulting large populations of these systems plays an important role for tasks like user recommendation or community detection. Algorithms in these fields typically face the problem that explicit user relationships (like friend lists) are often very sparse. Surprisingly, implicit evidences (like click logs) of user relations have hardly been considered to this end. Based on our long-time experience with running BibSonomy [4], we identify in this paper different evidence networks of user relationships in our system. We broadly classify each network based on whether the links are explicitly established by the users (e.g., friendship or group membership) or accrue implicitly in the running system (e.g., when user u copies an entry of user v). We systematically analyze structural properties of these networks and whether topological closeness (in terms of the length of shortest paths) coincides with semantic similarity between users.

@inproceedings{mitzlaff2010visit, author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas}, title = {Visit me, click me, be my friend: an analysis of evidence networks of user relationships in BibSonomy}, booktitle = {HT '10: Proceedings of the 21st ACM Conference on Hypertext and Hypermedia}, publisher = {ACM}, address = {New York, NY, USA}, year = {2010}, pages = {265--270}, url = {http://portal.acm.org/citation.cfm?id=1810617.1810664}, doi = {10.1145/1810617.1810664}, isbn = {978-1-4503-0041-4}, keywords = {detection, tagging, evidence, collaborative, folksonomy, community, network, bibsonomy}, 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 different users within the resulting large populations of these systems plays an important role for tasks like user recommendation or community detection. Algorithms in these fields typically face the problem that explicit user relationships (like friend lists) are often very sparse. Surprisingly, implicit evidences (like click logs) of user relations have hardly been considered to this end. Based on our long-time experience with running BibSonomy [4], we identify in this paper different evidence networks of user relationships in our system. We broadly classify each network based on whether the links are explicitly established by the users (e.g., friendship or group membership) or accrue implicitly in the running system (e.g., when user u copies an entry of user v). We systematically analyze structural properties of these networks and whether topological closeness (in terms of the length of shortest paths) coincides with semantic similarity between users.} }

%0 = inproceedings %A = Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas %B = HT '10: Proceedings of the 21st ACM Conference on Hypertext and Hypermedia %C = New York, NY, USA %D = 2010 %I = ACM %T = Visit me, click me, be my friend: an analysis of evidence networks of user relationships in BibSonomy %U = http://portal.acm.org/citation.cfm?id=1810617.1810664