DOCSLIB.ORG

Modeling the Homophily Effect Between Links and Communities for Overlapping Community Detection Hongyi Zhang, Tong Zhao, Irwin King, Michael R

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modeling the Homophily Effect Between Links and Communities for Overlapping Community Detection Hongyi Zhang, Tong Zhao, Irwin King, Michael R Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) Modeling the Homophily Effect between Links and Communities for Overlapping Community Detection Hongyi Zhang, Tong Zhao, Irwin King, Michael R. Lyu Shenzhen Key Laboratory of Rich Media Big Data Analytics and Applications, Shenzhen Research Institute, The Chinese University of Hong Kong, Shenzhen, China Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong hyzhang, tzhao, king, lyu @cse.cuhk.edu.hk { } Abstract ing it will be to identify such communities. It is mainly due to the infeasibility of visualization and the variety of com- Overlapping community detection has drawn much munity structure. Classic graph-partition-based community attention recently since it allows nodes in a detection approaches assume that a node belongs to one and network to have multiple community member- only one community, which contradicts with the fact that a ships. A standard framework to deal with over- node often appears with multiple memberships. To relax this lapping community detection is Matrix Factoriza- unrealistic constraint, several new algorithms for overlapping tion (MF). Although all existing MF-based ap- community detection have been proposed in recent years. proaches use links as input to identify communities, the relationship between links and communities is A majority of existing methods for overlapping commu- still under-investigated. Most of the approaches nity detection is based on Matrix Factorization (MF) [Pso- only view links as consequences of communities rakis et al., 2011; Wang et al., 2011; Zhang and Yeung, 2012; (community-to-link) but fail to explore how nodes’ Zhang et al., 2015], which has been a standard technique in community memberships can be represented by other areas such as recommender systems and natural lan- their linked neighbors (link-to-community). In guage processing. The basic idea of MF here is to use this paper, we propose a Homophily-based Non- low-dimensional latent vectors to represent nodes’ features negative Matrix Factorization (HNMF) to model in networks. MF naturally fits into overlapping community both-sided relationships between links and com- detection since the dimensions of factorized latent vectors munities. From the community-to-link perspec- of nodes can be interpreted as their community member- tive, we apply a preference-based pairwise func- ship and hence are no longer latent. The MF-based over- tion by assuming that nodes with common com- lapping community detection can be summarized into three munities have a higher probability to build links steps: (1) assign the number of communities, (2) compute than those without common communities. From the node-community weight matrix F through a learning the link-to-community perspective, we propose a objective, and (3) obtain the final community set accord- new community representation learning with net- ing to F . Here the most important part is the selection of work embedding by assuming that linked nodes learning objective. The simplest way is to recover the ad- have similar community representations. We con- jacency matrix of original network A by F with minimum error, i.e., to minimize A FFT [Psorakis et al., 2011; duct experiments on several real-world networks || − || and the results show that our HNMF model is able Wang et al., 2011]. However, an entry in A is a label (ei- to find communities with better quality compared ther 0 or 1) whereas an entry in F is a real value. The with state-of-the-art baselines. mismatch between label and entry does not make sense. To fix it, recent approaches such as [Yang and Leskovec, 2013; Zhang et al., 2015] adopt generative objectives, which are 1 Introduction based on the intuition that a node is more likely to build a Network is an abstraction representing relationships among link with another node inside its community than outside. real-world objects. A typical pattern of a network is that When we look into this intuition, it implicitly reveals that there are groups of nodes closely connected within the group links are the consequence of communities (community-to- but rarely making connections with nodes outside the group. link), i.e., if two nodes share common communities, they Such groups are defined as communities [Girvan and New- will have a higher probability to be linked. However, the man, 2002]. The task of finding such communities from com- investigation in reverse perspective (link-to-community) is plex networks is referred as community detection, an impor- largely ignored, i.e., whether a node’s community member- tant research topic in web mining for more than a decade. ship can be represented by its neighbors’ community mem- Usually, the more complex a network is, the more challeng- bership. Taking MF as an example, the link-to-community 3938 Dataset V E S MA perspective can be interpreted as to learn a node’s commu- | ||||| nity representation via the community representations of its Amazon 335k 926k 49k 100.0 14.83 neighbors. Here we use the word homophily, the tendency DBLP 317k 1.0M 2.5k 429.8 2.57 of an individual node to associate with similar others [Tang et al., 2013], to recapitulate both perspectives. Table 1: Data statistics. V : number of nodes, E : number In this paper, we propose a Homophily-based Non-negative of links, S : number of ground-truth| | communities,| |M: aver- MF (HNMF) to explicitly model the effect of homophily from age number| | of nodes per community, A: average community both perspectives. From the community-to-link perspective, memberships per node. we apply a pairwise objective function in the Preference- based Non-negative MF (PNMF) model [Zhang et al., 2015]. From the link-to-community perspective, we develop a novel Thus, new approaches are proposed to tackle this problem generative objective function based on unsupervised repre- in recent years. In this paper, we mainly focus on matrix- sentation learning and network embedding. We combine factorization-based approaches for overlapping community both objective functions into a joint learning objective, in detection. which parameter learning can be easily parallelized using Definition 2.2 (Overlapping Community Detection via asynchronous stochastic gradient descent. Through exper- MF). Overlapping community detection via MF is a process V V iments on various real-world datasets, we demonstrate that that takes the adjacency matrix A 0, 1 | |⇥| | of a net- our model can identify communities with better quality com- work G as input and produces a node-community2{ } weight ma- V S pared with state-of-the-art baselines and can be applied to trix F R| |⇥| | whose entry Fu,c represents the weight of large datasets. node u2 V in community c S to minimize a particular Contributions. We summarize our main contribution of this loss function2 l, i.e., 2 paper as follows, arg min l(A, F F T ), (2) 1. Our work is the first to explore the link-to-community F side of homophily effect between links and communi- ties in overlapping community detection. We justify it where S is the set of communities. In the end, we obtain S via observation on real-world datasets with ground-truth according to F . communities; As we mentioned, the simplest l is in the form of A FFT . The main target of this paper is to seek for a better|| −l 2. We propose a new learning objective to model both || perspectives of homophily within the non-negative MF that can capture the nature of communities more precisely. framework. Experiments show that our HNMF model can detect overlapping communities with better quality. 2.2 Data Observation In order to validate the link-to-community perspective, we 2 Problem Definition and Data Observation observe two large network datasets with ground-truth com- munities1 [Yang and Leskovec, 2012] to see whether linked In this section, we first provide several definitions about com- node pairs have more similar community representations than munity and community detection. Then we conduct a data non-linked ones. These two datasets are: observation on two large real-world networks to strengthen our motivation. Amazon: a products co-purchasing network based on • Customers Who Bought This Item Also Bought feature 2.1 Problem Definition of the Amazon website. Suppose we have a network G(V,E), where V and E are DBLP: a collaboration network of research paper au- node and edge sets respectively. A community in G is usu- • thors in computer science; ally considered as a group of densely connected nodes with a A simple statistics can be found in Table 1. common feature, e.g., students from a university, employees We exploit average number of shared communities (SC) from a company, etc. The task of community detection can and average Jaccard similarity of community memberships be defined as follows. (JS) for all linked node pairs as our measurements. They are Definition 2.1 (Community Detection). Community detec- calculated by tion is a process that takes a network G as input and produce a set of communities S as output to maximize a particular 1 SC = Ci Cj , (3) objective function f, i.e., 2 E | \ | i V j N +(i) | | X2 2X arg max f(G, S), (1) S and 1 Ci Cj where S = Ci Ci = ,Ci = Cj, 1 i, j S . JS = | \ |, (4) { | 6 ; 6 | |} 2 E Ci Cj i V j N +(i) While classic community detection requires that Ci = Cj | | X2 2X | [ | if i = j, overlapping community detection does not set6 any + 6 respectively, where N (i) is the set of i’ neighbors and Ci constraints on S. This relaxation matches the nature of real- represents the set of communities containing i. We also draw world networks better but brings big challenges since clas- sic garph-partition-based algorithms are no longer feasible.
Load more

Recommended publications
  • Detecting Statistically Significant Communities
    1 Detecting Statistically Significant Communities Zengyou He, Hao Liang, Zheng Chen, Can Zhao, Yan Liu Abstract—Community detection is a key data analysis problem across different fields. During the past decades, numerous algorithms have been proposed to address this issue. However, most work on community detection does not address the issue of statistical significance. Although some research efforts have been made towards mining statistically significant communities, deriving an analytical solution of p-value for one community under the configuration model is still a challenging mission that remains unsolved. The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. To partially fulfill this void, we present a tight upper bound on the p-value of a single community under the configuration model, which can be used for quantifying the statistical significance of each community analytically. Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. Experimental results demonstrate that our method is comparable with the competing methods on detecting statistically significant communities. Index Terms—Community Detection, Random Graphs, Configuration Model, Statistical Significance. F 1 INTRODUCTION ETWORKS are widely used for modeling the structure function that is able to always achieve the best performance N of complex systems in many fields, such as biology, in all possible scenarios. engineering, and social science. Within the networks, some However, most of these objective functions (metrics) do vertices with similar properties will form communities that not address the issue of statistical significance of commu- have more internal connections and less external links.
    [Show full text]
  • Networks in Nature: Dynamics, Evolution, and Modularity
    Networks in Nature: Dynamics, Evolution, and Modularity Sumeet Agarwal Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Hilary 2012 2 To my entire social network; for no man is an island Acknowledgements Primary thanks go to my supervisors, Nick Jones, Charlotte Deane, and Mason Porter, whose ideas and guidance have of course played a major role in shaping this thesis. I would also like to acknowledge the very useful sug- gestions of my examiners, Mark Fricker and Jukka-Pekka Onnela, which have helped improve this work. I am very grateful to all the members of the three Oxford groups I have had the fortune to be associated with: Sys- tems and Signals, Protein Informatics, and the Systems Biology Doctoral Training Centre. Their companionship has served greatly to educate and motivate me during the course of my time in Oxford. In particular, Anna Lewis and Ben Fulcher, both working on closely related D.Phil. projects, have been invaluable throughout, and have assisted and inspired my work in many different ways. Gabriel Villar and Samuel Johnson have been col- laborators and co-authors who have helped me to develop some of the ideas and methods used here. There are several other people who have gener- ously provided data, code, or information that has been directly useful for my work: Waqar Ali, Binh-Minh Bui-Xuan, Pao-Yang Chen, Dan Fenn, Katherine Huang, Patrick Kemmeren, Max Little, Aur´elienMazurie, Aziz Mithani, Peter Mucha, George Nicholson, Eli Owens, Stephen Reid, Nico- las Simonis, Dave Smith, Ian Taylor, Amanda Traud, and Jeffrey Wrana.
    [Show full text]
  • Modularity in Static and Dynamic Networks
    Modularity in static and dynamic networks Sarah F. Muldoon University at Buffalo, SUNY OHBM – Brain Graphs Workshop June 25, 2017 Outline 1. Introduction: What is modularity? 2. Determining community structure (static networks) 3. Comparing community structure 4. Multilayer networks: Constructing multitask and temporal multilayer dynamic networks 5. Dynamic community structure 6. Useful references OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Introduction: What is Modularity? OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon What is Modularity? Modularity (Community Structure) • A module (community) is a subset of vertices in a graph that have more connections to each other than to the rest of the network • Example social networks: groups of friends Modularity in the brain: • Structural networks: communities are groups of brain areas that are more highly connected to each other than the rest of the brain • Functional networks: communities are groups of brain areas with synchronous activity that is not synchronous with other brain activity OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular Structural networks: cortical thickness correlations sensorimotor/spatial strategic/executive mnemonic/emotion olfactocentric auditory/language visual processing Chen et al. (2008) Cereb Cortex OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular • Functional networks: resting state fMRI He et al. (2009) PLOS One OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The
    [Show full text]
  • Multidimensional Network Analysis
    Universita` degli Studi di Pisa Dipartimento di Informatica Dottorato di Ricerca in Informatica Ph.D. Thesis Multidimensional Network Analysis Michele Coscia Supervisor Supervisor Fosca Giannotti Dino Pedreschi May 9, 2012 Abstract This thesis is focused on the study of multidimensional networks. A multidimensional network is a network in which among the nodes there may be multiple different qualitative and quantitative relations. Traditionally, complex network analysis has focused on networks with only one kind of relation. Even with this constraint, monodimensional networks posed many analytic challenges, being representations of ubiquitous complex systems in nature. However, it is a matter of common experience that the constraint of considering only one single relation at a time limits the set of real world phenomena that can be represented with complex networks. When multiple different relations act at the same time, traditional complex network analysis cannot provide suitable an- alytic tools. To provide the suitable tools for this scenario is exactly the aim of this thesis: the creation and study of a Multidimensional Network Analysis, to extend the toolbox of complex network analysis and grasp the complexity of real world phenomena. The urgency and need for a multidimensional network analysis is here presented, along with an empirical proof of the ubiquity of this multifaceted reality in different complex networks, and some related works that in the last two years were proposed in this novel setting, yet to be systematically defined. Then, we tackle the foundations of the multidimensional setting at different levels, both by looking at the basic exten- sions of the known model and by developing novel algorithms and frameworks for well-understood and useful problems, such as community discovery (our main case study), temporal analysis, link prediction and more.
    [Show full text]
  • Centrality in Modular Networks
    Ghalmane et al. EPJ Data Science (2019)8:15 https://doi.org/10.1140/epjds/s13688-019-0195-7 REGULAR ARTICLE OpenAccess Centrality in modular networks Zakariya Ghalmane1,3, Mohammed El Hassouni1, Chantal Cherifi2 and Hocine Cherifi3* *Correspondence: hocine.cherifi@u-bourgogne.fr Abstract 3LE2I, UMR6306 CNRS, University of Burgundy, Dijon, France Identifying influential nodes in a network is a fundamental issue due to its wide Full list of author information is applications, such as accelerating information diffusion or halting virus spreading. available at the end of the article Many measures based on the network topology have emerged over the years to identify influential nodes such as Betweenness, Closeness, and Eigenvalue centrality. However, although most real-world networks are made of groups of tightly connected nodes which are sparsely connected with the rest of the network in a so-called modular structure, few measures exploit this property. Recent works have shown that it has a significant effect on the dynamics of networks. In a modular network, a node has two types of influence: a local influence (on the nodes of its community) through its intra-community links and a global influence (on the nodes in other communities) through its inter-community links. Depending on the strength of the community structure, these two components are more or less influential. Based on this idea, we propose to extend all the standard centrality measures defined for networks with no community structure to modular networks. The so-called “Modular centrality” is a two-dimensional vector. Its first component quantifies the local influence of a node in its community while the second component quantifies its global influence on the other communities of the network.
    [Show full text]
  • A Network Approach to Define Modularity of Components In
    A Network Approach to Define Modularity of Components Manuel E. Sosa1 Technology and Operations Management Area, in Complex Products INSEAD, 77305 Fontainebleau, France Modularity has been defined at the product and system levels. However, little effort has e-mail: [email protected] gone into defining and quantifying modularity at the component level. We consider com- plex products as a network of components that share technical interfaces (or connections) Steven D. Eppinger in order to function as a whole and define component modularity based on the lack of Sloan School of Management, connectivity among them. Building upon previous work in graph theory and social net- Massachusetts Institute of Technology, work analysis, we define three measures of component modularity based on the notion of Cambridge, Massachusetts 02139 centrality. Our measures consider how components share direct interfaces with adjacent components, how design interfaces may propagate to nonadjacent components in the Craig M. Rowles product, and how components may act as bridges among other components through their Pratt & Whitney Aircraft, interfaces. We calculate and interpret all three measures of component modularity by East Hartford, Connecticut 06108 studying the product architecture of a large commercial aircraft engine. We illustrate the use of these measures to test the impact of modularity on component redesign. Our results show that the relationship between component modularity and component redesign de- pends on the type of interfaces connecting product components. We also discuss direc- tions for future work. ͓DOI: 10.1115/1.2771182͔ 1 Introduction The need to measure modularity has been highlighted implicitly by Saleh ͓12͔ in his recent invitation “to contribute to the growing Previous research on product architecture has defined modular- field of flexibility in system design” ͑p.
    [Show full text]
  • Task-Dependent Evolution of Modularity in Neural Networks1
    Task-dependent evolution of modularity in neural networks1 Michael Husk¨ en, Christian Igel, and Marc Toussaint Institut fur¨ Neuroinformatik, Ruhr-Universit¨at Bochum, 44780 Bochum, Germany Telephone: +49 234 32 25558, Fax: +49 234 32 14209 fhuesken,igel,[email protected] Connection Science Vol 14, No 3, 2002, p. 219-229 Abstract. There exist many ideas and assumptions about the development and meaning of modu- larity in biological and technical neural systems. We empirically study the evolution of connectionist models in the context of modular problems. For this purpose, we define quantitative measures for the degree of modularity and monitor them during evolutionary processes under different constraints. It turns out that the modularity of the problem is reflected by the architecture of adapted systems, although learning can counterbalance some imperfection of the architecture. The demand for fast learning systems increases the selective pressure towards modularity. 1 Introduction The performance of biological as well as technical neural systems crucially depends on their ar- chitectures. In case of a feed-forward neural network (NN), architecture may be defined as the underlying graph constituting the number of neurons and the way these neurons are connected. Particularly one property of architectures, modularity, has raised a lot of interest among researchers dealing with biological and technical aspects of neural computation. It appears to be obvious to emphasise modularity in neural systems because the vertebrate brain is highly modular both in an anatomical and in a functional sense. It is important to stress that there are different concepts of modules. `When a neuroscientist uses the word \module", s/he is usually referring to the fact that brains are structured, with cells, columns, layers, and regions which divide up the labour of information processing in various ways' 1This paper is a revised and extended version of the GECCO 2001 Late-Breaking Paper by Husk¨ en, Igel, & Toussaint (2001).
    [Show full text]
  • Analyzing Social Media Network for Students in Presidential Election 2019 with Nodexl
    ANALYZING SOCIAL MEDIA NETWORK FOR STUDENTS IN PRESIDENTIAL ELECTION 2019 WITH NODEXL Irwan Dwi Arianto Doctoral Candidate of Communication Sciences, Airlangga University Corresponding Authors: [email protected] Abstract. Twitter is widely used in digital political campaigns. Twitter as a social media that is useful for building networks and even connecting political participants with the community. Indonesia will get a demographic bonus starting next year until 2030. The number of productive ages that will become a demographic bonus if not recognized correctly can be a problem. The election organizer must seize this opportunity for the benefit of voter participation. This study aims to describe the network structure of students in the 2019 presidential election. The first debate was held on January 17, 2019 as a starting point for data retrieval on Twitter social media. This study uses data sources derived from Twitter talks from 17 January 2019 to 20 August 2019 with keywords “#pilpres2019 OR #mahasiswa since: 2019-01-17”. The data obtained were analyzed by the communication network analysis method using NodeXL software. Our Analysis found that Top Influencer is @jokowi, as well as Top, Mentioned also @jokowi while Top Tweeters @okezonenews and Top Replied-To @hasmi_bakhtiar. Jokowi is incumbent running for re-election with Ma’ruf Amin (Senior Muslim Cleric) as his running mate against Prabowo Subianto (a former general) and Sandiaga Uno as his running mate (former vice governor). This shows that the more concentrated in the millennial generation in this case students are presidential candidates @jokowi. @okezonenews, the official twitter account of okezone.com (MNC Media Group).
    [Show full text]
  • Incorporating Network Structure with Node Contents for Community Detection on Large Networks Using Deep Learning
    Neurocomputing 297 (2018) 71–81 Contents lists available at ScienceDirect Neurocomputing journal homepage: www.elsevier.com/locate/neucom Incorporating network structure with node contents for community detection on large networks using deep learning ∗ Jinxin Cao a, Di Jin a, , Liang Yang c, Jianwu Dang a,b a School of Computer Science and Technology, Tianjin University, Tianjin 300350, China b School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan c School of Computer Science and Engineering, Hebei University of Technology, Tianjin 300401, China a r t i c l e i n f o a b s t r a c t Article history: Community detection is an important task in social network analysis. In community detection, in gen- Received 3 June 2017 eral, there exist two types of the models that utilize either network topology or node contents. Some Revised 19 December 2017 studies endeavor to incorporate these two types of models under the framework of spectral clustering Accepted 28 January 2018 for a better community detection. However, it was not successful to obtain a big achievement since they Available online 2 February 2018 used a simple way for the combination. To reach a better community detection, it requires to realize a Communicated by Prof. FangXiang Wu seamless combination of these two methods. For this purpose, we re-examine the properties of the mod- ularity maximization and normalized-cut models and fund out a certain approach to realize a seamless Keywords: Community detection combination of these two models. These two models seek for a low-rank embedding to represent of the Deep learning community structure and reconstruct the network topology and node contents, respectively.
    [Show full text]
  • Review of Community Detection Over Social Media: Graph Prospective
    (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 10, No. 2, 2019 Review of Community Detection over Social Media: Graph Prospective Pranita Jain1, Deepak Singh Tomar2 Department of Computer Science Maulana Azad National Institute of Technology Bhopal, India 462001 Abstract—Community over the social media is the group of globally distributed end users having similar attitude towards a particular topic or product. Community detection algorithm is used to identify the social atoms that are more densely interconnected relatively to the rest over the social media platform. Recently researchers focused on group-based algorithm and member-based algorithm for community detection over social media. This paper presents comprehensive overview of community detection technique based on recent research and subsequently explores graphical prospective of social media mining and social theory (Balance theory, status theory, correlation theory) over community detection. Along with that this paper presents a comparative analysis of three different state of art community detection algorithm available on I-Graph package on python i.e. walk trap, edge betweenness and fast greedy over six different social media data set. That yield intersecting facts about the capabilities and deficiency of community analysis methods. Fig 1. Social Media Network. Keywords—Community detection; social media; social media Aim of Community detection is to form group of mining; homophily; influence; confounding; social theory; homogenous nodes and figure out a strongly linked subgraphs community detection algorithm from heterogeneous network. In strongly linked sub- graphs (Community structure) nodes have more internal links than I. INTRODUCTION external. Detecting communities in heterogeneous networks is The Emergence of Social networking Site (SNS) like Face- same as, the graph partition problem in modern graph theory book, Twitter, LinkedIn, MySpace, etc.
    [Show full text]
  • Closeness Centrality for Networks with Overlapping Community Structure
    Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) Closeness Centrality for Networks with Overlapping Community Structure Mateusz K. Tarkowski1 and Piotr Szczepanski´ 2 Talal Rahwan3 and Tomasz P. Michalak1,4 and Michael Wooldridge1 2Department of Computer Science, University of Oxford, United Kingdom 2 Warsaw University of Technology, Poland 3Masdar Institute of Science and Technology, United Arab Emirates 4Institute of Informatics, University of Warsaw, Poland Abstract One aspect of networks that has been largely ignored in the literature on centrality is the fact that certain real-life Certain real-life networks have a community structure in which communities overlap. For example, a typical bus net- networks have a predefined community structure. In public work includes bus stops (nodes), which belong to one or more transportation networks, for example, bus stops are typically bus lines (communities) that often overlap. Clearly, it is im- grouped by the bus lines (or routes) that visit them. In coau- portant to take this information into account when measur- thorship networks, the various venues where authors pub- ing the centrality of a bus stop—how important it is to the lish can be interpreted as communities (Szczepanski,´ Micha- functioning of the network. For example, if a certain stop be- lak, and Wooldridge 2014). In social networks, individuals comes inaccessible, the impact will depend in part on the bus grouped by similar interests can be thought of as members lines that visit it. However, existing centrality measures do not of a community. Clearly for such networks, it is desirable take such information into account. Our aim is to bridge this to have a centrality measure that accounts for the prede- gap.
    [Show full text]
  • A Centrality Measure for Networks with Community Structure Based on a Generalization of the Owen Value
    ECAI 2014 867 T. Schaub et al. (Eds.) © 2014 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial License. doi:10.3233/978-1-61499-419-0-867 A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value Piotr L. Szczepanski´ 1 and Tomasz P. Michalak2 ,3 and Michael Wooldridge2 Abstract. There is currently much interest in the problem of mea- cated — approaches have been considered in the literature. Recently, suring the centrality of nodes in networks/graphs; such measures various methods for the analysis of cooperative games have been ad- have a range of applications, from social network analysis, to chem- vocated as measures of centrality [16, 10]. The key idea behind this istry and biology. In this paper we propose the first measure of node approach is to consider groups (or coalitions) of nodes instead of only centrality that takes into account the community structure of the un- considering individual nodes. By doing so this approach accounts for derlying network. Our measure builds upon the recent literature on potential synergies between groups of nodes that become visible only game-theoretic centralities, where solution concepts from coopera- if the value of nodes are analysed jointly [18]. Next, given all poten- tive game theory are used to reason about importance of nodes in the tial groups of nodes, game-theoretic solution concepts can be used to network. To allow for flexible modelling of community structures, reason about players (i.e., nodes) in such a coalitional game.
    [Show full text]