%0 
%0 Conference Proceedings
%A Kibanov, Mark; Atzmueller, Martin; Scholz, Christoph & Stumme, Gerd
%D 2013
%T On the Evolution of Contacts and Communities in Networks of Face-to-Face Proximity
%E 
%B Proc. IEEE CPSCom 2013
%C Boston, MA, USA
%I IEEE Computer Society
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F kibanov2013evolution
%K 2013, community, conferator, face-to-face, iteg, itegpub, l3s, mining, myown, sna, social, venus
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Scholz, Christoph; Atzmueller, Martin; Kibanov, Mark & Stumme, Gerd
%D 2013
%T How Do People Link? Analysis of Contact Structures in Human Face-to-Face Proximity Networks
%E 
%B Proc. ASONAM 2013
%C New York, NY, USA
%I ACM Press
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F scholz2013people
%K 2013, analysis, face-to-face, iteg, itegpub, l3s, linkprediction, mining, myown, networks, sna
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Macek, Bjoern Elmar; Scholz, Christoph; Atzmueller, Martin & Stumme, Gerd
%D 2012
%T Anatomy of a Conference
%E 
%B 23rd ACM Conference on Hypertext and Social Media, HT '12
%C Milwaukee, WI, USA, June 25-28, 2012
%I ACM
%V 
%6
%N 
%P 245-254
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F MacekASS11
%K 2012, itegpub, l3s, myown, rfid, sna, venus
%X 
%Z Best Paper
%U http://dl.acm.org/citation.cfm?id=2309996
%+
%^

%0 
%0 Conference Proceedings
%A Mitzlaff, Folke; Benz, Dominik; Stumme, Gerd & Hotho, Andreas
%D 2010
%T Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy
%E 
%B Proceedings of the 21st ACM conference on Hypertext and hypermedia
%C Toronto, Canada
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F eisterlehner2010visit
%K 2010, analysis, bibsonomy, evidence, itegpub, l3s, links, myown, networks, semantic, sna, web
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Borchmann, Daniel & Ganter, Bernhard
%D 2009
%T Concept Lattice Orbifolds – First Steps
%E 
%B 
%C 
%I 
%V 
%6
%N 
%P 22--37
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F daniel2009concept
%K folding, lattice, orbifold, sna
%X Concept lattices with symmetries may be simplified by “folding” them along the orbits of their automorphism group. The resulting
diagram is often more intuitive than the full lattice diagram, but well defined annotations are required to make the foldeddiagram as informative as the original one. The folding procedure can be extended to formal contexts.
%Z 
%U http://dx.doi.org/10.1007/978-3-642-01815-2_2
%+
%^

%0 
%0 Conference Proceedings
%A Brandes, Ulrik; Kenis, Patrick; Lerner, J\"u,rgen & van Raaij, Denise
%D 2009
%T Network analysis of collaboration structure in Wikipedia
%E 
%B WWW '09: Proceedings of the 18th international conference on World wide web
%C New York, NY, USA
%I ACM
%V 
%6
%N 
%P 731--740
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 978-1-60558-487-4
%(
%)
%*
%L
%M
%1 
%2 Network analysis of collaboration structure in Wikipedia
%3 inproceedings
%4 
%# 
%$ 
%F 1526808
%K analysis, collaboration, network, seminar2009, sna, social, wikipedia
%X In this paper we give models and algorithms to describe and analyze the collaboration among authors of Wikipedia from a network analytical perspective. The edit network encodes who interacts how with whom when editing an article; it significantly extends previous network models that code author communities in Wikipedia. Several characteristics summarizing some aspects of the organization process and allowing the analyst to identify certain types of authors can be obtained from the edit network. Moreover, we propose several indicators characterizing the global network structure and methods to visualize edit networks. It is shown that the structural network indicators are correlated with quality labels of the associated Wikipedia articles.
%Z 
%U http://portal.acm.org/citation.cfm?id=1526808
%+
%^

%0 
%0 Generic
%A Ghosh, Rumi & Lerman, Kristina
%D 2009
%T Structure of Heterogeneous Networks
%E
%B 
%C
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 [0906.2212] Structure of Heterogeneous Networks
%3 misc
%4 
%# 
%$ 
%F Ghosh2009
%K graph, graphs, heterogenous, measures, multi-mode, networks, sna
%X   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.

%Z cite arxiv:0906.2212

%U http://arxiv.org/abs/0906.2212
%+
%^

%0 
%0 Conference Proceedings
%A Markines, Benjamin; Cattuto, Ciro; Menczer, Filippo; Benz, Dominik; Hotho, Andreas & Stumme, Gerd
%D 2009
%T Evaluating Similarity Measures for Emergent Semantics of Social Tagging
%E 
%B 18th International World Wide Web Conference
%C 
%I 
%V 
%6
%N 
%P 641--650
%& 
%Y 
%S 
%7
%8 April
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F markines2009evaluating
%K 2009, folksonomies, itegpub, l3s, measures, myown, similarity, sitc, sna, social_similarity, sota, tag, tagging, tagorapub, www2009
%X Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.
%Z 
%U http://www2009.eprints.org/65/
%+
%^

%0 
%0 Generic
%A Narayanan, Arvind & Shmatikov, Vitaly
%D 2009
%T De-anonymizing Social Networks
%E
%B 
%C
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 De-anonymizing Social Networks
%3 misc
%4 
%# 
%$ 
%F Narayanan2009
%K anonymizing, anonymous, de-anonymizing, networks, sna, social
%X   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.

%Z 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
%U http://arxiv.org/abs/0903.3276
%+
%^

%0 
%0 Conference Proceedings
%A Das, Gautam; Koudas, Nick; Papagelis, Manos & Puttaswamy, Sushruth
%D 2008
%T Efficient sampling of information in social networks
%E 
%B SSM '08: Proceeding of the 2008 ACM workshop on Search in social media
%C New York, NY, USA
%I ACM
%V 
%6
%N 
%P 67--74
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 978-1-60558-258-0
%(
%)
%*
%L
%M
%1 
%2 Efficient sampling of information in social networks
%3 inproceedings
%4 
%# 
%$ 
%F das2008efficient
%K analysis, network, networks, sampling, sna, social
%X 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.
%Z 
%U http://portal.acm.org/citation.cfm?id=1458583.1458594
%+
%^

%0 
%0 Conference Proceedings
%A Leskovec, Jure & Horvitz, Eric
%D 2008
%T Planetary-scale views on a large instant-messaging network
%E 
%B WWW '08: Proceeding of the 17th international conference on World Wide Web
%C New York, NY, USA
%I ACM
%V 
%6
%N 
%P 915--924
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 978-1-60558-085-2
%(
%)
%*
%L
%M
%1 
%2 Planetary-scale views on a large instant-messaging network
%3 inproceedings
%4 
%# 
%$ 
%F 1367620
%K analysis, messenger, msn, network, seminar2009, sna, social
%X We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft Messenger instant-messaging system. We examine characteristics and patterns that emerge from the collective dynamics of large numbers of people, rather than the actions and characteristics of individuals. The dataset contains summary properties of 30 billion conversations among 240 million people. From the data, we construct a communication graph with 180 million nodes and 1.3 billion undirected edges, creating the largest social network constructed and analyzed to date. We report on multiple aspects of the dataset and synthesized graph. We find that the graph is well-connected and robust to node removal. We investigate on a planetary-scale the oft-cited report that people are separated by "six degrees of separation" and find that the average path length among Messenger users is 6.6. We find that people tend to communicate more with each other when they have similar age, language, and location, and that cross-gender conversations are both more frequent and of longer duration than conversations with the same gender.
%Z 
%U http://portal.acm.org/citation.cfm?id=1367620
%+
%^

%0 
%0 Conference Proceedings
%A Zhu, Feida; Chen, Chen; Yan, Xifeng; Han, Jiawei & Yu, Philip S
%D 2008
%T Graph OLAP: Towards Online Analytical Processing on Graphs
%E 
%B Proc. 2008 Int. Conf. on Data Mining (ICDM'08), Pisa, Italy, Dec. 2008.
%C 
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 December
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Resource: Graph OLAP: Towards Online Analytical Processing on Graphs
%3 inproceedings
%4 
%# 
%$ 
%F zhu2008graph
%K graph, graphs, olap, sna
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Backstrom, Lars; Dwork, Cynthia & Kleinberg, Jon
%D 2007
%T Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
%E 
%B Proceedings of the 16th international conference on World Wide Web
%C New York, NY, USA
%I ACM
%V 
%6
%N 
%P 181--190
%& 
%Y 
%S WWW '07
%7
%8 
%9
%? 
%! 
%Z 
%@ 978-1-59593-654-7
%(
%)
%*
%L
%M
%1 
%2 Wherefore art thou r3579x?
%3 inproceedings
%4 
%# 
%$ 
%F Backstrom:2007:WAT:1242572.1242598
%K anonymizing, anonymous, de-anonymizing, networks, sna, social
%X 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.
%Z 
%U http://doi.acm.org/10.1145/1242572.1242598
%+
%^

%0 
%0 Conference Proceedings
%A Koutrika, Georgia; Effendi, Frans Adjie; Gy\"o,ngyi, Zolt\'a,n; Heymann, Paul & Garcia-Molina, Hector
%D 2007
%T Combating spam in tagging systems
%E 
%B AIRWeb '07: Proc. of the 3rd int. workshop on Adversarial inf. retrieval on the web
%C 
%I 
%V 
%6
%N 
%P 57--64
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F Koutrika2007
%K bookmarking, folksonomy, sna, spam, tagging, web
%X 
%Z 
%U 
%+
%^

%0 
%0 Conference Proceedings
%A Schmitz, Christoph; Grahl, Miranda; Hotho, Andreas; Stumme, Gerd; Catutto, Ciro; Baldassarri, Andrea; Loreto, Vittorio & Servedio, Vito D. P.
%D 2007
%T Network Properties of Folksonomies
%E 
%B Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''
%C Banff
%I 
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 May
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inproceedings
%4 
%# 
%$ 
%F schmitz07network
%K 2007, emergent, fca, folksonomy, folksononomies, itegpub, l3s, myown, semantics, smallworld, sna, socialnetwork
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Faust, Katherine; Wassermann & Contractor, Noshir
%D 2006
%T Testing multitheoretical, multilevel hypotheses about organizational networks: An analytic framework and empirical example
%E 
%B 
%C 
%I 
%V 31
%6
%N 
%P 681-703
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Testing multitheoretical, multilevel hypotheses about organizational networks: An analytic framework and empirical example | Mendeley
%3 inproceedings
%4 
%# 
%$ 
%F default
%K sna, theorien
%X 
%Z 
%U http://www.mendeley.com/research/testing-multitheoretical-multilevel-hypotheses-about-organizational-networks-an-analytic-framework-and-empirical-example/
%+
%^

%0 
%0 Conference Proceedings
%A Hoser, Bettina; Hotho, Andreas; Jäschke, Robert; Schmitz, Christoph & Stumme, Gerd
%D 2006
%T Semantic Network Analysis of Ontologies
%E Sure, York & Domingue, John
%B The Semantic Web: Research and Applications
%C Heidelberg
%I Springer
%V 4011
%6
%N 
%P 514-529
%& 
%Y 
%S LNAI
%7
%8 June
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F hoser2006semantic
%K 2006, l3s, myown, nepomuk, ontology, semantic, sna, socialnetworkanalysis, sota, web
%X A key argument for modeling knowledge in ontologies is the easy
re-use and re-engineering of the knowledge. However, beside
consistency checking, current ontology engineering tools provide
only basic functionalities for analyzing ontologies. Since
ontologies can be considered as (labeled, directed) graphs, graph
analysis techniques are a suitable answer for this need. Graph
analysis has been performed by sociologists for over 60 years, and
resulted in the vivid research area of Social Network Analysis
(SNA). While social network structures in general currently receive
high attention in the Semantic Web community, there are only very
few SNA applications up to now, and virtually none for analyzing the
structure of ontologies.

We illustrate in this paper the benefits of applying SNA to
ontologies and the Semantic Web, and discuss which research topics
arise on the edge between the two areas. In particular, we discuss
how different notions of centrality describe the core content and
structure of an ontology. From the rather simple notion of degree
centrality over betweenness centrality to the more complex
eigenvector centrality based on Hermitian matrices, we illustrate
the insights these measures provide on two ontologies, which are
different in purpose, scope, and size.
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hoser2006semantic.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Sen, Shilad; Lam, Shyong K.; Rashid, Al M.; Cosley, Dan; Frankowski, Dan; Osterhouse, Jeremy; Harper, Maxwell F. & Riedl, John
%D 2006
%T tagging, communities, vocabulary, evolution
%E 
%B CSCW '06: Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work
%C New York, NY, USA
%I ACM Press
%V 
%6
%N 
%P 181--190
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 1595932496
%(
%)
%*
%L
%M
%1 
%2 
%3 inproceedings
%4 
%# 
%$ 
%F citeulike:965334
%K 2006, communities, evolution, sna, tagging
%X 
%Z 
%U http://dx.doi.org/10.1145/1180875.1180904
%+
%^

%0 
%0 Conference Proceedings
%A 
%D 2005
%T Proceedings of the First Workshop on Semantic Network Analysis 
%E Stumme, Gerd; Hoser, Bettina; Schmitz, Christoph & Alani, Harith
%B 
%C Aachen
%I CEUR Proceedings
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 proceedings
%4 
%# 
%$ 
%F stumme05semanticnetworkanalysis
%K 2005, analysis, iswc, itegpub, l3s, myown, nepomuk, network, proceedings, semantic, semna, sna, workshop
%X 
%Z 
%U http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-171/
%+
%^

%0 
%0 Conference Proceedings
%A Brandes, U. & Willhalm, T.
%D 2002
%T Visualization of bibliographic networks with a reshaped landscape metaphor
%E 
%B Proceedings of the symposium on Data Visualisation 2002
%C Aire-la-Ville, Switzerland, Switzerland
%I Eurographics Association
%V 
%6
%N 
%P 159--ff
%& 
%Y 
%S VISSYM '02
%7
%8 
%9
%? 
%! 
%Z 
%@ 1-58113-536-X
%(
%)
%*
%L
%M
%1 
%2 Visualization of bibliographic networks with a reshaped landscape metaphor
%3 inproceedings
%4 
%# 
%$ 
%F Brandes:2002:VBN:509740.509765
%K bibliographic, bibliography, citation, graph, networks, sna
%X 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.
%Z 
%U http://portal.acm.org/citation.cfm?id=509740.509765
%+
%^