DOCSLIB.ORG

Nodexl Pro Tutorial: Social Network and Content Analysis with Twitter Network Data – Step by Step

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Nodexl Pro Tutorial: Social Network and Content Analysis with Twitter Network Data – Step by Step NodeXL Pro Tutorial: Social network and content analysis with Twitter network data – step by step Last updated: Februrary 12th, 2019 About this Tutorial About this Tutorial 1. Getting Started 2. Data import 3. Prepare data This tutorial shows you how you can 4. Group by cluster run a full social network and 5. Calculate metrics 6. Time series analysis content analysis with NodeXL Pro. 7. Text/sentiment analysis While we will use Twitter network 8. Network Top Items 9. Autofill columns data as an example, this approach 10. Customize graph can be applied to any network 11. Save the network map dataset of your choice (depending 12. Automation on the available metadata). Literature/Links 2 If you have any questions, please send us an email: [email protected] More NodeXL Pro Tutorials can be found here: https://www.smrfoundation.org/nodexl/tutorials 1. Getting Started About this Tutorial 1. Before downloading network data, save the file to your machine. It 1. Getting Started is helpful to add the data source and date to the name file e.g.: 2. Data import 3. Prepare data Social Network Analysis Twitter 2019-01-25.xlsx 4. Group by cluster 2. Open the Import Data Options window to select basic options 5. Calculate metrics related to the data import: Data > Import > Import Options 6. Time series analysis 7. Text/sentiment analysis 3. Select the options shown below and click OK. 8. Network Top Items 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 3. 3 2. 2. Data Import 2. About this Tutorial 3. 1. Getting Started 1. Open the Twitter Search Network importer: 2. Data import Data > Import > From Twitter Search Network… 3. Prepare data 2. Enter a search query of your choice. 4. Group by cluster 4. 5. Calculate metrics 3. Select Basic network. 6. Time series analysis 7. Text/sentiment analysis 4. Limit # of tweets to 1.000. 8. Network Top Items 5. Click OK. 5. 9. Autofill columns 10. Customize graph 6. Wait for approx. 3-5 minutes. 11. Save the network map 12. Automation 7. Save the file after the data download is finished. The Edges and Vertices spreadsheets now contains Literature/Links network data and additional metadata. Take a look at the worksheets and explore the data. 4 2. Data Import You can build advanced search queries with Twitter Standard Search Operators: About this Tutorial https://developer.twitter.com/en/docs/tweets/rules-and-filtering/overview/standard-operators 1. Getting Started 2. Data import 3. Prepare data Standard search: Tesla 4. Group by cluster 5. Calculate metrics Exact phrase: “Tesla Autopilot“ 6. Time series analysis 7. Text/sentiment analysis Exclude term: Tesla –Nikola 8. Network Top Items Boolean query: electric (car OR vehicle) 9. Autofill columns 10. Customize graph User search: @Tesla 11. Save the network map 12. Automation Search by language: Tesla lang:en (fr/de/nl/…) Search by date: Tesla from:2019-02-05 Literature/Links Tesla until:2018-02-12 (!) Test your query before downloading data: https://twitter.com/search-home 5 2. Data Import When you click on Show Graph/Refresh Graph at the top of the graph window, you can already About this Tutorial observe the connected structure of the downloaded raw data. 1. Getting Started 2. Data import 3. Prepare data 4. Group by cluster 5. Calculate metrics 6. Time series analysis 7. Text/sentiment analysis 8. Network Top Items 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 6 3. Prepare Data 1. Click on Data > Prepare Data > Count and Merge Duplicate Edges. About this Tutorial 2. Check the box Count duplicate edges and insert the counts into an Edge Weight column and click OK. 1. Getting Started 3. Navigate to column BA Edge Weight that has just been created in the Edges worksheet. This column will 2. Data import be used later to visulize the strength of connections between the vertices. 3. Prepare data 4. Group by cluster 5. Calculate metrics 6. Time series analysis 7. Text/sentiment analysis 8. Network Top Items 1. 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 2. 3. 7 4. Group by Cluster 1. 1. Open the Group by cluster window: Analysis > Groups > About this Tutorial Group by Cluster… 2. Select Clauset-Newman-Moore. 1. Getting Started 2. Data import 3. Select Put all neighborless vertices into one group. 3. Prepare data 4. Group by cluster 4. Click OK and wait. 5. Calculate metrics 5. Take a look the Group Vertices and Group Edges 6. Time series analysis worksheets which have just been created. Further, group 7. Text/sentiment analysis related columns have been added to the Edges and Vertices 8. Network Top Items worksheets. 9. Autofill columns 10. Customize graph 6. Click Refresh Graph. Vertex colors and shapes have been 11. Save the network map added automatically. 12. Automation Literature/Links 2. 3. 4. 8 Learn more about the Clauset-Newman-Moore clustering algorithm: A. Clauset, M. E. J. Newman, and C. Moore (2004): Finding community structure in very large networks. In: Phys. Rev. E 70. 5. Calculate Metrics 1. 1. Open the Graph Metrics window: Analysis > Graph Metrics > Graph Metrics About this Tutorial 2. Check the boxes as seen on the right. 1. Getting Started 2. 2. Data import 3. Click Calculate Metrics and wait. 3. Prepare data 4. Have a look at the newly created worksheet Overall 4. Group by cluster Metrics to analyze the composition of the network. 5. Calculate metrics Also take a look at the Vertices and Groups 6. Time series analysis worksheets where the metrics have been added. 7. Text/sentiment analysis 8. Network Top Items 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 3. 9 4. 1. 6. Time Series Analysis 1. Open the Graph Metrics window: Analysis > Graph Metrics > Graph Metrics 3. About this Tutorial 2. Deselect everything but Time Series. 2. 1. Getting Started 2. Data import 3. Click on Options to open the Time Series window. 3. Prepare data 4. Select the options as seen on the right. 4. Group by cluster 5. Calculate metrics 5. Click OK and then Calculate Metrics to create the new 6. Time series analysis spreadsheet Time Series. 4. 7. Text/sentiment analysis 8. Network Top Items 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 5. 10 1. 7. Text / Sentiment Analysis NodeXL Pro is shipped with a skip word list as well as a 3. positive and a negative sentiment words list in English About this Tutorial language. These lists can be modified to your needs. 2. 1. Getting Started This feature counts the frequency of words and word 2. Data import pairs in a text column. At the same time any word is 3. Prepare data checked for occurence in one of the sentiment lists. 4. Group by cluster 5. Calculate metrics 1. Open the Graph Metrics window: Analysis > Graph 6. Time series analysis Metrics > Graph Metrics 4. 7. Text/sentiment analysis 2. Deselect everything but Words and Word Pairs. 8. Network Top Items 9. Autofill columns 3. Click on Options to open the Word and Word Pair 10. Customize graph Metrics window. 11. Save the network map 12. Automation 4. Choose column Tweet. 5. Optional: Enter your own list of keywords into List 3. Literature/Links 6. Click OK and then Calculate Metrics. 5. 7. Take a look at the two new spreadsheets Words and Word Pairs that have just been created. Further, sentiment related columns have been added to the 6. 11 Edges and Vertices spreadsheets. 1. 8. Network Top Items This feature summarizes the top contents of the network data by collecting the most frequently occuring URLs, domains, hashtags, 3. About this Tutorial words and word pairs from the Edges worksheet. 1. Getting Started 1. Open the Graph Metrics window: Analysis > Graph Metrics > 2. Data import Graph Metrics 3. Prepare data 4. Group by cluster 2. Deselect everything but Network Top Items. 2. 5. Calculate metrics 3. Click on Options to open the Network Top Items window. 6. Time series analysis 7. Text/sentiment analysis 4. Select Tweet to collect top words and word pairs from the 8. Network Top Items Edges worksheet). 9. Autofill columns 10. Customize graph 5. Click on Add… to open the window below. 5. 11. Save the network map 6. Select the column URLs in Tweet, choose the number of items 12. Automation to get and set the column delimiter to Space. Click OK. Literature/Links 4. 6. 12 8. Network Top Items 7. Repeat step six from the previous page for columns Domains in Tweet and Hashtags in Tweet. About this Tutorial 8. When the Network Top Items window looks like the one on the right, 1. Getting Started click OK and then Calculate Metrics. This step may take a few 2. Data import minutes. 3. Prepare data 4. Group by cluster 9. Have a look at the new worksheet Network Top items. 5. Calculate metrics 6. Time series analysis 7. Text/sentiment analysis 8. 8. Network Top Items 9. Autofill columns 10. Customize graph 11. Save the network map 12. Automation Literature/Links 13 9. 9. Autofill Columns About this Tutorial 1. Getting Started 2. Data import Based on the previous calculations, we will now start 3. Prepare data with the visualization. The Autofill Columns feature 4. Group by cluster helps to fill a number of columns with a few clicks. 5. Calculate metrics 6.
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]
  • 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]
  • Facing the Future: European Research Infrastructures for the Humanities and Social Sciences
    Facing the Future: European Research Infrastructures for the Humanities and Social Sciences Adrian Duşa, Dietrich Nelle, Günter Stock, and Gert G. Wagner (Eds.) Facing the Future: European Research Infrastructures for the Humanities and Social Sciences E d i t o r s : Adrian Duşa (SCI-SWG), Dietrich Nelle (BMBF), Günter Stock (ALLEA), and Gert. G. Wagner (RatSWD) ISBN 978-3-944417-03-5 1st edition © 2014 SCIVERO Verlag, Berlin SCIVERO is a trademark of GWI Verwaltungsgesellschaft für Wissenschaftspoli- tik und Infrastrukturentwicklung Berlin UG (haftungsbeschränkt). This book documents the results of the conference Facing the Future: European Research Infrastructure for Humanities and Social Sciences (November 21/22 2013, Berlin), initiated by the Social and Cultural Innovation Strategy Work- ing Group of ESFRI (SCI-SWG) and the German Federal Ministry of Education and Research (BMBF), and hosted by the European Federation of Academies of Sciences and Humanities (ALLEA) and the German Data Forum (RatSWD). Thanks and appreciation are due to all authors, speakers and participants of the conference, and all involved institutions, in particular the German Federal Ministry of Education and Research (BMBF). The ministry funded the conference and this subsequent publication as part of the Union of the German Academies of Sciences and Humanities’ project “Survey and Analysis of Basic Humanities and Social Science Research at the Science Academies Related Research Insti- tutes of Europe”. The views expressed in this publication are exclusively the opinions of the authors and not those of the German Federal Ministry of Education and Research. Editing: Dominik Adrian, Camilla Leathem, Thomas Runge, Simon Wolff Layout and graphic design: Thomas Runge Contents Preface .
    [Show full text]
  • Extracting Insights from Differences: Analyzing Node-Aligned Social
    Extracting Insights from Differences: Analyzing Node-aligned Social Graphs by Srayan Datta A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Science and Engineering) in The University of Michigan 2019 Doctoral Committee: Associate Professor Eytan Adar, Chair Associate Professor Mike Cafarella Assistant Professor Danai Koutra Associate Professor Clifford Lampe Srayan Datta [email protected] ORCID iD: 0000-0002-5800-830X c Srayan Datta 2019 To my family and friends ii ACKNOWLEDGEMENTS There are several people who made this dissertation possible, first among this long list is my adviser, Eytan Adar. Pursuing a doctoral program after just finishing un- dergraduate studies can be a daunting task but Eytan made it easy with his patience, kindness, and guidance. I learned a lot from our collaborations and idle conversations and I am very grateful for that. I would like to extend my thanks to the rest of my thesis committee, Mike Ca- farella, Danai Koutra and Cliff Lampe for their suggestions and constructive feed- back. I would also like to thank the following faculty members, Daniel Romero, Ceren Budak, Eric Gilbert and David Jurgens for their long insightful conversations and suggestions about some of my projects. I would like to thank all of friends and colleagues who helped (as a co-author or through critique) or supported me through this process. This is an enormous list but I am especially thankful to Chanda Phelan, Eshwar Chandrasekharan, Sam Carton, Cristina Garbacea, Shiyan Yan, Hari Subramonyam, Bikash Kanungo, and Ram Srivatasa. I would like to thank my parents for their unwavering support and faith in me.
    [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]
  • Network Analysis with Nodexl
    Social data: Advanced Methods – Social (Media) Network Analysis with NodeXL A project from the Social Media Research Foundation: http://www.smrfoundation.org About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group [email protected] http://www.connectedaction.net http://www.codeplex.com/nodexl http://www.twitter.com/marc_smith http://delicious.com/marc_smith/Paper http://www.flickr.com/photos/marc_smith http://www.facebook.com/marc.smith.sociologist http://www.linkedin.com/in/marcasmith http://www.slideshare.net/Marc_A_Smith http://www.smrfoundation.org http://www.flickr.com/photos/library_of_congress/3295494976/sizes/o/in/photostream/ http://www.flickr.com/photos/amycgx/3119640267/ Collaboration networks are social networks SNA 101 • Node A – “actor” on which relationships act; 1-mode versus 2-mode networks • Edge B – Relationship connecting nodes; can be directional C • Cohesive Sub-Group – Well-connected group; clique; cluster A B D E • Key Metrics – Centrality (group or individual measure) D • Number of direct connections that individuals have with others in the group (usually look at incoming connections only) E • Measure at the individual node or group level – Cohesion (group measure) • Ease with which a network can connect • Aggregate measure of shortest path between each node pair at network level reflects average distance – Density (group measure) • Robustness of the network • Number of connections that exist in the group out of 100% possible – Betweenness (individual measure) F G •
    [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]
  • Quick Notes on Nodexl
    Quick notes on NodeXL Programme organisation, 3 components: • NodeXL command ‘ribbon’ – access with menu-like item at top of the screen, contains all network data functions • Data sheets – 5 separate sheets for edges, vertices, metrics etc, switching between them using tabs on the bottom. NB because the screen gets quite crowded the sheet titles sometimes disappear off to one side so use the small arrows (bottom left) to scroll across the tabs if something seems to have gone missing. • Graph viewer – separate window pane labelled ‘Document Actions’ with graphical layout functions. Can be closed while working with data – to open it again click the ‘Show Graph’ button near the left-hand side of the ribbon. Working with data, basic process: 1. Start in ‘Edges’ data sheet (leftmost tab at the bottom); each row represents one connection of the form A links to B (directed graph) OR A and B are linked (undirected). (Directed/Undirected changed in ‘Type’ option on ribbon. In directed graph this sheet might include one row for A->B and one for B->A; in an undirected graph this would be tautologous.) No other data in this sheet is required, although optionally: • Could include text under ‘label’ if the visible label on graphs should be different from the name used in columns A or B. NB These might be overwritten when using ‘autofill columns’. • Could add an extra column at column L to identify weight of links if (as is the case with IssueCrawler data) each connection might represent more than 1 actually existing link between two vertices, hence inclusion of ‘Edge Weight’ in blogs data.
    [Show full text]
  • Structural Diversity and Homophily: a Study Across More Than One Hundred Big Networks
    KDD 2017 Research Paper KDD’17, August 13–17, 2017, Halifax, NS, Canada Structural Diversity and Homophily: A Study Across More Than One Hundred Big Networks Yuxiao Dong∗ Reid A. Johnson Microso Research University of Notre Dame Redmond, WA 98052 Notre Dame, IN 46556 [email protected] [email protected] Jian Xu Nitesh V. Chawla University of Notre Dame University of Notre Dame Notre Dame, IN 46556 Notre Dame, IN 46556 [email protected] [email protected] ABSTRACT ACM Reference format: A widely recognized organizing principle of networks is structural Yuxiao Dong, Reid A. Johnson, Jian Xu, and Nitesh V. Chawla. 2017. Struc- tural Diversity and Homophily: A Study Across More an One Hundred homophily, which suggests that people with more common neigh- Big Networks. In Proceedings of KDD ’17, August 13–17, 2017, Halifax, NS, bors are more likely to connect with each other. However, what in- Canada., , 10 pages. uence the diverse structures embedded in common neighbors (e.g., DOI: hp://dx.doi.org/10.1145/3097983.3098116 and ) have on link formation is much less well-understood. To explore this problem, we begin by characterizing the structural diversity of common neighborhoods. Using a collection of 120 large- 1 INTRODUCTION scale networks, we demonstrate that the impact of the common neighborhood diversity on link existence can vary substantially Since the time of Aristotle, it has been observed that people “love across networks. We nd that its positive eect on Facebook and those who are like themselves” [2]. We now know this as the negative eect on LinkedIn suggest dierent underlying network- principle of homophily, which asserts that people’s propensity to ing needs in these networks.
    [Show full text]
  • Livro De Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE
    Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos EDITORA DA UNIVERSIDADE FEDERAL DE SERGIPE COORDENADORA DO PROGRAMA EDITORIAL Messiluce da Rocha Hansen COORDENADOR GRÁFICO DA EDITORA UFS Germana Gonçalves de Araújo PROJETO GRÁFICO E EDITORAÇÃO ELETRÔNICA Alisson Vitório de Lima FOTOGRAFIAS Disponibilizadas sob licença Creative Commons, ou de domínio público. Adilson Andrade - Foto da página X; FICHA CATALOGRÁFICA ELABORADA PELA BIBLIOTECA CENTRAL UNIVERSIDADE FEDERAL DE SERGIPE Encontro de Pós-Graduação (8. : 2016 : São Cristóvão, SE) Livro de resumos [recurso eletrônico] : VIII Encontro de Pós-Graduação / organizadores: Carlos Alexandre Borges Garcia, Marcus Eugênio Oliveira Lima. – São Cristóvão : Editora UFS : Universidade E56l Federal de Sergipe, Programa de Pós-Graduação, 2016. 353 p. ISBN 978-85-7822-550-6 1. Pós-graduação – Congresso. I. Universidade Federal de Sergipe. II. Garcia, Carlos Alexandre Borges. III. Lima, Marcus Eugênio Oliveira. CDU 378.046-021.68 Cidade Universitária “Prof. José Aloísio de Campos” CEP 49.100-000 – São Cristóvão - SE. Telefone: 3194 - 6922/6923. e-mail: [email protected] http://livraria.ufs.br/ Este portfólio, ou parte dele, não pode ser reproduzido por qualquer meio sem autorização escrita da Editora. Organizadores: Carlos Alexandre Borges Garcia Marcus Eugênio Oliveira Lima Livro de Resumos UFS São Cristóvão/SE - 2016 Ciências Agrárias A (des)realização da estratégia democrático-popular: Uma análise a partir da realidade do movimento dos trabalhadores rurais sem terra (MST) e do Partido dos Trabalhadores (PT) Autor: SOUSA, Ronilson Barboza de. Orientador: RAMOS FILHO, Eraldo da Silva. A referente tese de doutorado, que vem sendo desenvolvida, tem como objetivo analisar o processo de realização da estratégia democrático-popular, adotada pelo Movimento dos Trabalhadores Rurais Sem Terra (MST) e pelo Partido dos Trabalhadores (PT), especial- mente na luta pela terra e pela reforma agrária.
    [Show full text]