Christoph Scholz; Martin Atzmueller; Alain Barrat; Ciro Cattuto & Gerd Stumme (2013), New Insights and Methods For Predicting Face-To-Face Contacts, in 'Proc. 7th Intl. AAAI Conference on Weblogs and Social Media' , AAAI Press, Palo Alto, CA, USA .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Mitzlaff, F.; Atzmueller, M.; Benz, D.; Hotho, A. & Stumme, G. (2013), 'User-Relatedness and Community Structure in Social Interaction Networks' , cite arxiv:1309.3888 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

With social media and the according social and ubiquitous applications finding their way into everyday life, there is a rapidly growing amount of user generated content yielding explicit and implicit network structures. We consider social activities and phenomena as proxies for user relatedness. Such activities are represented in so-called social interaction networks or evidence networks, with different degrees of explicitness. We focus on evidence networks containing relations on users, which are represented by connections between individual nodes. Explicit interaction networks are then created by specific user actions, for example, when building a friend network. On the other hand, more implicit networks capture user traces or evidences of user actions as observed in Web portals, blogs, resource sharing systems, and many other social services. These implicit networks can be applied for a broad range of analysis methods instead of using expensive gold-standard information. In this paper, we analyze different properties of a set of networks in social media. We show that there are dependencies and correlations between the networks. These allow for drawing reciprocal conclusions concerning pairs of networks, based on the assessment of structural correlations and ranking interchangeability. Additionally, we show how these inter-network correlations can be used for assessing the results of structural analysis techniques, e.g., community mining methods.

Scholz, C.; Atzmueller, M.; Kibanov, M. & Stumme, G. (2013), How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks, in 'Proc. ASONAM 2013' , ACM Press, New York, NY, USA .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2011

Mitzlaff, F.; Atzmueller, M.; Benz, D.; Hotho, A. & Stumme, G. (2011), Community Assessment Using Evidence Networks, in Martin Atzmueller; Andreas Hotho; Markus Strohmaier & Alvin Chin, ed., 'Analysis of Social Media and Ubiquitous Data' , Springer Berlin Heidelberg, , pp. 79-98 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2010

Mitzlaff, F.; Atzmüller, M.; Benz, D.; Hotho, A. & Stumme, G. (2010), Community Assessment using Evidence Networks, in 'Proceedings of the Workshop on Mining Ubiquitous and Social Environments (MUSE2010)' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

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. This paper proposes evidence networks using implicit information for the evaluation of communities. The presented evaluation approach is based on the idea of reconstructing existing social structures for the assessment and evaluation of a given clustering. We analyze and compare the presented evidence networks using user data from the real-world social bookmarking application BibSonomy. The results indicate that the evidence networks reflect the relative rating of the explicit ones very well.

Mitzlaff, F.; Benz, D.; Stumme, G. & Hotho, A. (2010), Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy, in 'Proceedings of the 21st ACM conference on Hypertext and hypermedia' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Mucha, P. J.; Richardson, T.; Macon, K.; Porter, M. A. & Onnela, J.-P. (2010), 'Community Structure in Time-Dependent, Multiscale, and Multiplex Networks', Science 328 (5980) , 876-878 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Network science is an interdisciplinary endeavor, with methods and applications drawn from across the natural, social, and information sciences. A prominent problem in network science is the algorithmic detection of tightly connected groups of nodes known as communities. We developed a generalized framework of network quality functions that allowed us to study the community structure of arbitrary multislice networks, which are combinations of individual networks coupled through links that connect each node in one network slice to itself in other slices. This framework allows studies of community structure in a general setting encompassing networks that evolve over time, have multiple types of links (multiplexity), and have multiple scales.

2009

Breslin, J. G.; Decker, S.; Hauswirth, M.; Hynes, G.; Phuoc, D. L.; Passant, A.; Polleres, A.; Rabsch, C. & Reynolds, V. (2009), Integrating Social Networks and Sensor Networks, in 'Proceedings on the W3C Workshop on the Future of Social Networking' .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Sensors have begun to infiltrate people's everyday lives. They can provide information about a car's condition, can enable smart buildings, and are being used in various mobile applications, to name a few. Generally, sensors provide information about various aspects of the real world. Online social networks, another emerging trend over the past six or seven years, can provide insights into the communication links and patterns between people. They have enabled novel developments in communications as well as transforming the Web from a technical infrastructure to a social platform, very much along the lines of the original Web as proposed by Tim Berners-Lee, which is now often referred to as the Social Web. In this position paper, we highlight some of the interesting research areas where sensors and social networks can fruitfully interface, from sensors providing contextual information in context-aware and personalized social applications, to using social networks as "storage infrastructures" for sensor information.

Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually project such networks unto simple graphs composed of entities of a single type. In the process, they conflate relations between entities of different types and loose important structural information. We develop a mathematical framework that can be used to compactly represent and analyze heterogeneous networks that combine multiple entity and link types. We generalize Bonacich centrality, which measures connectivity between nodes by the number of paths between them, to heterogeneous networks and use this measure to study network structure. Specifically, we extend the popular modularity-maximization method for community detection to use this centrality metric. We also rank nodes based on their connectivity to other nodes. One advantage of this centrality metric is that it has a tunable parameter we can use to set the length scale of interactions. By studying how rankings change with this parameter allows us to identify important nodes in the network. We apply the proposed method to analyze the structure of several heterogeneous networks. We show that exploiting additional sources of evidence corresponding to links between, as well as among, different entity types yields new insights into network structure.

Narayanan, A. & Shmatikov, V. (2009), 'De-anonymizing Social Networks' , cite arxiv:0903.3276 Comment: Published in the 30th IEEE Symposium on Security and Privacy, 2009. The definitive version is available at: http://www.cs.utexas.edu/~shmat/shmat_oak09.pdf Frequently Asked Questions are answered at: http://www.cs.utexas.edu/~shmat/socialnetworks-faq.html .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and data-mining researchers. Privacy is typically protected by anonymization, i.e., removing names, addresses, etc. We present a framework for analyzing privacy and anonymity in social networks and develop a new re-identification algorithm targeting anonymized social-network graphs. To demonstrate its effectiveness on real-world networks, we show that a third of the users who can be verified to have accounts on both Twitter, a popular microblogging service, and Flickr, an online photo-sharing site, can be re-identified in the anonymous Twitter graph with only a 12% error rate. Our de-anonymization algorithm is based purely on the network topology, does not require creation of a large number of dummy "sybil" nodes, is robust to noise and all existing defenses, and works even when the overlap between the target network and the adversary's auxiliary information is small.

2008

Das, G.; Koudas, N.; Papagelis, M. & Puttaswamy, S. (2008), Efficient sampling of information in social networks, in 'SSM '08: Proceeding of the 2008 ACM workshop on Search in social media' , ACM, New York, NY, USA , pp. 67--74 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In this paper, we focus on improving the performance of information collection from the neighborhood of a user in a dynamic social network. To this end, we introduce sampling based algorithms to quickly approximate quantities of interest from the vicinity of a user's social graph. We then introduce and analyze variants of this basic scheme exploring correlations across our samples. Models of centralized and distributed social networks are considered. We show that our algorithms can be utilized to rank items in the neighborhood of a user, assuming that information for each user in the network is available. Using real and synthetic data sets, we validate the results of our analysis and demonstrate the efficiency of our algorithms in approximating quantities of interest. The methods we describe are general and can probably be easily adopted in a variety of strategies aiming to efficiently collect information from a social graph.

2007

Backstrom, L.; Dwork, C. & Kleinberg, J. (2007), Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography, in 'Proceedings of the 16th international conference on World Wide Web' , ACM, New York, NY, USA , pp. 181--190 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

In a social network, nodes correspond topeople or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a single anonymized copy of a social network, it is possible for an adversary to learn whether edges exist or not between specific targeted pairs of nodes.

Falkowski, T. & Barth, A. (2007), 'Density-based Temporal Graph Clustering for Subgroup Detection in Social Networks' , Presented at The 4th conference on Applications of Social Network Analysis (ASNA) .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

2006

Dall'Asta, L.; Baronchelli, A.; Barrat, A. & Loreto, V. (2006), 'Agreement dynamics on small-world networks', Europhysics Letters 73 , 969 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Lambiotte, R. & Ausloos, M. (2006), Collaborative Tagging as a Tripartite Network, in 'Computational Science – ICCS 2006' , Springer Berlin / Heidelberg, , pp. 1114-1117 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We describe online collaborative communities by tripartite networks, the nodes being persons, items and tags. We introduce projection methods in order to uncover the structures of the networks, i.e. communities of users, genre families... The structuring of the network is visualised by using a tree representation. The notion of diversity in the system is also discussed.

2003

2002

Albert, R. & Barabasi, A.-L. (2002), 'Statistical mechanics of complex networks', Reviews of Modern Physics 74 (1) , 47 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Brandes, U. & Willhalm, T. (2002), Visualization of bibliographic networks with a reshaped landscape metaphor, in 'Proceedings of the symposium on Data Visualisation 2002' , Eurographics Association, Aire-la-Ville, Switzerland, Switzerland , pp. 159--ff .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

We describe a novel approach to visualize bibliographic networks that facilitates the simultaneous identification of clusters (e.g., topic areas) and prominent entities (e.g., surveys or landmark papers). While employing the landscape metaphor proposed in several earlier works, we introduce new means to determine relevant parameters of the landscape. Moreover, we are able to compute prominent entities, clustering of entities, and the landscape's surface in a surprisingly simple and uniform way. The effectiveness of our network visualizations is illustrated on data from the graph drawing literature.