Measuring scholarly impact: Methods and practice Link prediction with the linkpred tool

Size: px
Start display at page:

Download "Measuring scholarly impact: Methods and practice Link prediction with the linkpred tool"

Transcription

1 Measuring scholarly impact: Methods and practice Link prediction with the linkpred tool Raf Guns University of Antwerp

2 If you want to follow along Download and install Anaconda Python from Download the example data from

3 A pair of scientists who have five mutual previous collaborators, for instance, are about twice as likely to collaborate as a pair with only two, and about 200 times as likely as a pair with none. (Newman, 2001; emphasis mine)

4 Agenda What is link prediction? (and why?) Example data The linkpred tool Link prediction in practice Conclusion

5 What is link prediction?

6 Networks

7 Networks in informetrics Citation Papers Journals Authors Patents Collaboration Authors Institutions Countries Co citation Bibliographic coupling Web links And so on

8 Definitions A network G = (V, E) consists of: A set of nodes or vertices V A set of links or edges E Each link connects two nodes from V Neighbourhood N(v) of node v: all nodes connected to v Node degree N(v) of v: number of connected nodes = number of items in set N(v)

9 Change in networks Most networks are not static, e.g. in collaboration network: New authors appear Old authors disappear New collaborations are initiated Previous collaborators stop collaborating

10 Change in networks Some changes are more plausible than others

11 Change in networks Different mechanisms have been identified Assortativity: similar nodes are more likely to connect Preferential attachment: well connected nodes attract more new connections Cf. cumulative advantage, Matthew effect

12 The link prediction question Liben Nowell and Kleinberg (2003, 2007): Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future?

13 Link prediction steps 1. Data gathering 2. Preprocessing 3. Prediction 4. Evaluation

14 Steps

15 Why link prediction? You want to know which links will appear in the future Recommendation Finding missing links Finding anomalous links (correct or incorrect) Evaluating network formation and evolution models

16 Our example data

17 Data Guns and Rousseau (2013) Collaboration between cities in Africa and South Asia Topic: malaria In three consecutive time periods Available as three Pajek network files:

18

19

20

21 The linkpred tool

22 About Cross platform (written in Python) Open source: BSD license Command line tool! Alternative: LPmade (

23 How and where to get linkpred 1. Install Anaconda Python: 2. Open command line window 3. Run command: > pip install 4. Wait until installation is finished

24 Basic usage > linkpred Should display brief usage instructions > linkpred help Displays more complete help output

25 Basic usage > linkpred training network file predictors predictor output output type Read the network in training network file, predict using predictor and give output of output type > linkpred training network file test networkfile predictors predictor output outputtype Read the network in training network file, compare with testnetwork file, predict using predictor and give output of output type

26 Link prediction in practice

27 Preprocessing Nodes may also appear and disappear Restrict to intersection of node sets of training and test network Only where test network is available Restrict by degree (default: only discard isolate nodes) Directed networks: notsupported Convert to undirected first

28 Prediction: choosing predictors Local AdamicAdar AssociationStrength CommonNeighbours Cosine DegreeProduct Jaccard MaxOverlap MinOverlap NMeasure Pearson ResourceAllocation Global GraphDistance Katz RootedPageRank SimRank Other Community Copy Random

29 Local predictors Tendency towards triadic closure Number of common neighbours is a simple but powerful predictor.

30 Local predictors Common neighbours Normalizations of common neighbours Jaccard coefficient, cosine measure Adamic/Adar (Adamic & Adar, 2003), 1 log

31 Weighted networks In weighted networks, links have weights (e.g. number of joint papers, number of citations ) Link weights : often ignored!! Most predictors in linkpred can use link weights General idea: higher link weight (e.g., more common papers), stronger connection

32 Global predictors Graph distance: lowest number of links needed to travel from a to b problem: small world phenomenon

33 Global predictors Katz (1953): : 1 if i and j are linked, 0 otherwise : number of walks with length k from i to j : parameter, probability of effectiveness of a single link Longer walks: lower effectiveness

34 Global predictors Rooted PageRank

35 Global predictors Rooted PageRank

36 Global predictors SimRank (Jeh & Widom, 2002) Objects that link to similar objects are similar themselves.,, Starting point: a node is maximally similar to itself: W(v, v) = 1

37 Demo Predict Save predictions to file import in e.g. Excel

38 Evaluation Step 4: How well does it work? How? compare to known good test network Four groups: Link Non link Predicted True positive False positive Not predicted False negative True negative

39 Evaluation Simply save results to text file: output cache evaluations Create chart: Recall precision ROC

40 Evaluation: recall precision Precision: fraction of correct predictions Recall: fraction of correctly predicted links

41 Evaluation: ROC True positive rate: fraction of correctly predicted links (= recall) False positive rate: Fraction of incorrectly predicted links

42 Profiles A simple way to save and reuse the configuration of a complex prediction run (options, predictors, parameters ) Usage example: > linkpred network file profile profile.yml Format: YAML, see

43 Example profile predictors: name: AdamicAdar displayname: Adamic/Adar name: GraphDistance displayname: Graph distance parameters: weight: weight name: SimRank displayname: SimRank (c=0.4) parameters: c: 0.4 name: SimRank displayname: SimRank (c=0.8) parameters: c: 0.8 output: cache predictions recall precision

44 Conclusion

45 About link prediction Link prediction is possible because link formation is not a purely random process Limitations: Unaware of social and other circumstantial factors Which predictor is best for a concrete situation? Trade off between prediction accuracy and non triviality

46 About linkpred Relatively simple but powerful Limitations: Not suitable for very large and/or dense networks Does not incorporate more complex setups like predictor combinations, machine learning etc. All results can be exported for analysis in other software (cache *) Open source: contributions welcome!

The link prediction problem for social networks

The link prediction problem for social networks The link prediction problem for social networks Alexandra Chouldechova STATS 319, February 1, 2011 Motivation Recommending new friends in in online social networks. Suggesting interactions between the

More information

Link Prediction and Anomoly Detection

Link Prediction and Anomoly Detection Graphs and Networks Lecture 23 Link Prediction and Anomoly Detection Daniel A. Spielman November 19, 2013 23.1 Disclaimer These notes are not necessarily an accurate representation of what happened in

More information

Online Social Networks and Media

Online Social Networks and Media Online Social Networks and Media Absorbing Random Walks Link Prediction Why does the Power Method work? If a matrix R is real and symmetric, it has real eigenvalues and eigenvectors: λ, w, λ 2, w 2,, (λ

More information

CS 224W Final Report Group 37

CS 224W Final Report Group 37 1 Introduction CS 224W Final Report Group 37 Aaron B. Adcock Milinda Lakkam Justin Meyer Much of the current research is being done on social networks, where the cost of an edge is almost nothing; the

More information

CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks

CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks CS224W: Social and Information Network Analysis Project Report: Edge Detection in Review Networks Archana Sulebele, Usha Prabhu, William Yang (Group 29) Keywords: Link Prediction, Review Networks, Adamic/Adar,

More information

Using network evolution theory and singular value decomposition method to improve accuracy of link prediction in social networks

Using network evolution theory and singular value decomposition method to improve accuracy of link prediction in social networks Proceedings of the Tenth Australasian Data Mining Conference (AusDM 2012), Sydney, Australia Using network evolution theory and singular value decomposition method to improve accuracy of link prediction

More information

Mining Web Data. Lijun Zhang

Mining Web Data. Lijun Zhang Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems

More information

CSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks

CSE 258 Lecture 12. Web Mining and Recommender Systems. Social networks CSE 258 Lecture 12 Web Mining and Recommender Systems Social networks Social networks We ve already seen networks (a little bit) in week 3 i.e., we ve studied inference problems defined on graphs, and

More information

An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization

An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science

More information

Introduction to Complex Networks Analysis

Introduction to Complex Networks Analysis Introduction to Complex Networks Analysis Miloš Savić Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia Complex systems and networks System - a set of interrelated

More information

CSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks

CSE 158 Lecture 11. Web Mining and Recommender Systems. Social networks CSE 158 Lecture 11 Web Mining and Recommender Systems Social networks Assignment 1 Due 5pm next Monday! (Kaggle shows UTC time, but the due date is 5pm, Monday, PST) Assignment 1 Assignment 1 Social networks

More information

TELCOM2125: Network Science and Analysis

TELCOM2125: Network Science and Analysis School of Information Sciences University of Pittsburgh TELCOM2125: Network Science and Analysis Konstantinos Pelechrinis Spring 2015 Figures are taken from: M.E.J. Newman, Networks: An Introduction 2

More information

Link Prediction in a Semi-bipartite Network for Recommendation

Link Prediction in a Semi-bipartite Network for Recommendation Link Prediction in a Semi-bipartite Network for Recommendation Aastha Nigam 1 Nitesh V. Chawla 1,2(B) 1 University of Notre Dame, Notre Dame, IN 46556, USA {anigam,nchawla}@nd.edu 2 Wroclaw University

More information

Topic mash II: assortativity, resilience, link prediction CS224W

Topic mash II: assortativity, resilience, link prediction CS224W Topic mash II: assortativity, resilience, link prediction CS224W Outline Node vs. edge percolation Resilience of randomly vs. preferentially grown networks Resilience in real-world networks network resilience

More information

Capturing Missing Links in Social Networks Using Vertex Similarity

Capturing Missing Links in Social Networks Using Vertex Similarity Capturing Missing Links in Social Networks Using Vertex Similarity Hung-Hsuan Chen, Liang Gou, Xiaolong (Luke) Zhang, C. Lee Giles Computer Science and Engineering Information Sciences and Technology The

More information

Supervised Link Prediction with Path Scores

Supervised Link Prediction with Path Scores Supervised Link Prediction with Path Scores Wanzi Zhou Stanford University wanziz@stanford.edu Yangxin Zhong Stanford University yangxin@stanford.edu Yang Yuan Stanford University yyuan16@stanford.edu

More information

Mining Web Data. Lijun Zhang

Mining Web Data. Lijun Zhang Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems

More information

Link Prediction for Social Network

Link Prediction for Social Network Link Prediction for Social Network Ning Lin Computer Science and Engineering University of California, San Diego Email: nil016@eng.ucsd.edu Abstract Friendship recommendation has become an important issue

More information

CENTRALITIES. Carlo PICCARDI. DEIB - Department of Electronics, Information and Bioengineering Politecnico di Milano, Italy

CENTRALITIES. Carlo PICCARDI. DEIB - Department of Electronics, Information and Bioengineering Politecnico di Milano, Italy CENTRALITIES Carlo PICCARDI DEIB - Department of Electronics, Information and Bioengineering Politecnico di Milano, Italy email carlo.piccardi@polimi.it http://home.deib.polimi.it/piccardi Carlo Piccardi

More information

Link prediction in multiplex bibliographical networks

Link prediction in multiplex bibliographical networks Int. J. Complex Systems in Science vol. 3(1) (2013), pp. 77 82 Link prediction in multiplex bibliographical networks Manisha Pujari 1, and Rushed Kanawati 1 1 Laboratoire d Informatique de Paris Nord (LIPN),

More information

Link Prediction Benchmarks

Link Prediction Benchmarks Link Prediction Benchmarks Haifeng Qian IBM T. J. Watson Research Center Yorktown Heights, NY qianhaifeng@us.ibm.com October 13, 2016 This document describes two temporal link prediction benchmarks that

More information

Research Article Link Prediction in Directed Network and Its Application in Microblog

Research Article Link Prediction in Directed Network and Its Application in Microblog Mathematical Problems in Engineering, Article ID 509282, 8 pages http://dx.doi.org/10.1155/2014/509282 Research Article Link Prediction in Directed Network and Its Application in Microblog Yan Yu 1,2 and

More information

Econ 430 Lecture 3: Significance and Structural Properties of N

Econ 430 Lecture 3: Significance and Structural Properties of N Econ 430 Lecture 3: Significance and Structural Properties of Networks Alper Duman Izmir University Economics, March 8, 2013 Prevalence of Networks Networks are everywhere! Even in this class. We can classify

More information

Centralities (4) Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California Excellence Through Knowledge

Centralities (4) Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California Excellence Through Knowledge Centralities (4) Ralucca Gera, Applied Mathematics Dept. Naval Postgraduate School Monterey, California rgera@nps.edu Excellence Through Knowledge Different types of centralities: Betweenness Centrality

More information

International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7, No.3, May Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani

International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.7, No.3, May Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani LINK MINING PROCESS Dr.Zakea Il-Agure and Mr.Hicham Noureddine Itani Higher Colleges of Technology, United Arab Emirates ABSTRACT Many data mining and knowledge discovery methodologies and process models

More information

Link Prediction in Graph Streams

Link Prediction in Graph Streams Peixiang Zhao, Charu C. Aggarwal, and Gewen He Florida State University IBM T J Watson Research Center Link Prediction in Graph Streams ICDE Conference, 2016 Graph Streams Graph Streams arise in a wide

More information

Chapter 12 Telephone Call Network Data Mining: A Survey with Experiments

Chapter 12 Telephone Call Network Data Mining: A Survey with Experiments BOLYAI SOCIETY MATHEMATICAL STUDIES, 18 Handbook of Large-Scale Random Networks pp. 489 530. Chapter 12 Telephone Call Network Data Mining: A Survey with Experiments MIKLÓS KURUCZ, LÁSZLÓ LUKÁCS, DÁVID

More information

Generating Useful Network-based Features for Analyzing Social Networks

Generating Useful Network-based Features for Analyzing Social Networks Generating Useful Network-based Features for Analyzing Social Networks Abstract Recently, many Web services such as social networking services, blogs, and collaborative tagging have become widely popular.

More information

Fast Personalized PageRank On MapReduce Authors: Bahman Bahmani, Kaushik Chakrabart, Dong Xin In SIGMOD 2011 Presenter: Adams Wei Yu

Fast Personalized PageRank On MapReduce Authors: Bahman Bahmani, Kaushik Chakrabart, Dong Xin In SIGMOD 2011 Presenter: Adams Wei Yu Fast Personalized PageRank On MapReduce Authors: Bahman Bahmani, Kaushik Chakrabart, Dong Xin In SIGMOD 2011 Presenter: Adams Wei Yu March 2015, CMU Graph data is Ubiquitous Basic Problem in Graphs: How

More information

Summary: What We Have Learned So Far

Summary: What We Have Learned So Far Summary: What We Have Learned So Far small-world phenomenon Real-world networks: { Short path lengths High clustering Broad degree distributions, often power laws P (k) k γ Erdös-Renyi model: Short path

More information

Social & Information Network Analysis CS 224W

Social & Information Network Analysis CS 224W Social & Information Network Analysis CS 224W Final Report Alexandre Becker Jordane Giuly Sébastien Robaszkiewicz Stanford University December 2011 1 Introduction The microblogging service Twitter today

More information

Sample questions with solutions Ekaterina Kochmar

Sample questions with solutions Ekaterina Kochmar Sample questions with solutions Ekaterina Kochmar May 27, 2017 Question 1 Suppose there is a movie rating website where User 1, User 2 and User 3 post their reviews. User 1 has written 30 positive (5-star

More information

Link Prediction and Topological Feature Importance in Social Networks

Link Prediction and Topological Feature Importance in Social Networks Proceedings of the 13-th Australasian Data Mining Conference (AusDM 2015), Sydney, Australia Link Prediction and Topological Feature Importance in Social Networks Stephan A. Curiskis Thomas R. Osborn Paul

More information

Distribution-Free Models of Social and Information Networks

Distribution-Free Models of Social and Information Networks Distribution-Free Models of Social and Information Networks Tim Roughgarden (Stanford CS) joint work with Jacob Fox (Stanford Math), Rishi Gupta (Stanford CS), C. Seshadhri (UC Santa Cruz), Fan Wei (Stanford

More information

Community detection algorithms survey and overlapping communities. Presented by Sai Ravi Kiran Mallampati

Community detection algorithms survey and overlapping communities. Presented by Sai Ravi Kiran Mallampati Community detection algorithms survey and overlapping communities Presented by Sai Ravi Kiran Mallampati (sairavi5@vt.edu) 1 Outline Various community detection algorithms: Intuition * Evaluation of the

More information

Bipartite Editing Prediction in Wikipedia

Bipartite Editing Prediction in Wikipedia JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 30, 587-603 (2014) Bipartite Editing Prediction in Wikipedia Department of Computer Science and Information Engineering National Cheng Kung University Tainan,

More information

Recap! CMSC 498J: Social Media Computing. Department of Computer Science University of Maryland Spring Hadi Amiri

Recap! CMSC 498J: Social Media Computing. Department of Computer Science University of Maryland Spring Hadi Amiri Recap! CMSC 498J: Social Media Computing Department of Computer Science University of Maryland Spring 2015 Hadi Amiri hadi@umd.edu Announcement CourseEvalUM https://www.courseevalum.umd.edu/ 2 Announcement

More information

Trust-Based Recommendation Based on Graph Similarity

Trust-Based Recommendation Based on Graph Similarity Trust-Based Recommendation Based on Graph Similarity Chung-Wei Hang and Munindar P. Singh Department of Computer Science North Carolina State University Raleigh, NC 27695-8206, USA {chang,singh}@ncsu.edu

More information

Generating Useful Network-based Features for Analyzing Social Networks

Generating Useful Network-based Features for Analyzing Social Networks Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Generating Useful Network-based Features for Analyzing Social Networks Jun Karamon and Yutaka Matsuo and Mitsuru Ishizuka

More information

arxiv: v1 [cs.si] 8 Apr 2016

arxiv: v1 [cs.si] 8 Apr 2016 Leveraging Network Dynamics for Improved Link Prediction Alireza Hajibagheri 1, Gita Sukthankar 1, and Kiran Lakkaraju 2 1 University of Central Florida, Orlando, Florida 2 Sandia National Labs, Albuquerque,

More information

Structural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques

Structural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques Structural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques Kouhei Sugiyama, Hiroyuki Ohsaki and Makoto Imase Graduate School of Information Science and Technology,

More information

Department of Computer Science, Rensselaer Polytechnic Institute Troy, NY 12180

Department of Computer Science, Rensselaer Polytechnic Institute Troy, NY 12180 Chapter 9 A SURVEY OF LINK PREDICTION IN SOCIAL NETWORKS Mohammad Al Hasan Department of Computer and Information Science Indiana University- Purdue University Indianapolis, IN 46202 alhasan@cs.iupui.edu

More information

Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs

Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs Alessandro Epasto J. Feldman*, S. Lattanzi*, S. Leonardi, V. Mirrokni*. *Google Research Sapienza U. Rome Motivation Recommendation

More information

Newton s Gravitational Law for Link Prediction in Social Networks

Newton s Gravitational Law for Link Prediction in Social Networks Newton s Gravitational Law for Link Prediction in Social Networks Akanda Wahid -Ul- Ashraf, Marcin Budka, and Katarzyna Musial-Gabrys Abstract Link prediction is an important research area in network science

More information

The Explorer. chapter Getting started

The Explorer. chapter Getting started chapter 10 The Explorer Weka s main graphical user interface, the Explorer, gives access to all its facilities using menu selection and form filling. It is illustrated in Figure 10.1. There are six different

More information

Machine Learning and Modeling for Social Networks

Machine Learning and Modeling for Social Networks Machine Learning and Modeling for Social Networks Olivia Woolley Meza, Izabela Moise, Nino Antulov-Fatulin, Lloyd Sanders 1 Introduction to Networks Computational Social Science D-GESS Olivia Woolley Meza

More information

Complex-Network Modelling and Inference

Complex-Network Modelling and Inference Complex-Network Modelling and Inference Lecture 8: Graph features (2) Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/notes/ Network_Modelling/ School

More information

CSE 158 Lecture 11. Web Mining and Recommender Systems. Triadic closure; strong & weak ties

CSE 158 Lecture 11. Web Mining and Recommender Systems. Triadic closure; strong & weak ties CSE 158 Lecture 11 Web Mining and Recommender Systems Triadic closure; strong & weak ties Triangles So far we ve seen (a little about) how networks can be characterized by their connectivity patterns What

More information

Centralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge

Centralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge Centralities (4) By: Ralucca Gera, NPS Excellence Through Knowledge Some slide from last week that we didn t talk about in class: 2 PageRank algorithm Eigenvector centrality: i s Rank score is the sum

More information

An Efficient Link Prediction Technique in Social Networks based on Node Neighborhoods

An Efficient Link Prediction Technique in Social Networks based on Node Neighborhoods An Efficient Link Prediction Technique in Social Networks based on Node Neighborhoods Gypsy Nandi Assam Don Bosco University Guwahati, Assam, India Anjan Das St. Anthony s College Shillong, Meghalaya,

More information

Web 2.0 Social Data Analysis

Web 2.0 Social Data Analysis Web 2.0 Social Data Analysis Ing. Jaroslav Kuchař jaroslav.kuchar@fit.cvut.cz Structure (2) Czech Technical University in Prague, Faculty of Information Technologies Software and Web Engineering 2 Contents

More information

Supervised Random Walks on Homogeneous Projections of Heterogeneous Networks

Supervised Random Walks on Homogeneous Projections of Heterogeneous Networks Shalini Kurian Serene Kosaraju Zavain Dar Supervised Random Walks on Homogeneous Projections of Heterogeneous Networks Introduction: Most of the complex systems in the real world can be represented as

More information

Evaluation Measures. Sebastian Pölsterl. April 28, Computer Aided Medical Procedures Technische Universität München

Evaluation Measures. Sebastian Pölsterl. April 28, Computer Aided Medical Procedures Technische Universität München Evaluation Measures Sebastian Pölsterl Computer Aided Medical Procedures Technische Universität München April 28, 2015 Outline 1 Classification 1. Confusion Matrix 2. Receiver operating characteristics

More information

Link Prediction in Microblog Network Using Supervised Learning with Multiple Features

Link Prediction in Microblog Network Using Supervised Learning with Multiple Features Link Prediction in Microblog Network Using Supervised Learning with Multiple Features Siyao Han*, Yan Xu The Information Science Department, Beijing Language and Culture University, Beijing, China. * Corresponding

More information

Influence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report

Influence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report Influence Maximization in Location-Based Social Networks Ivan Suarez, Sudarshan Seshadri, Patrick Cho CS224W Final Project Report Abstract The goal of influence maximization has led to research into different

More information

CS-E5740. Complex Networks. Network analysis: key measures and characteristics

CS-E5740. Complex Networks. Network analysis: key measures and characteristics CS-E5740 Complex Networks Network analysis: key measures and characteristics Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3.

More information

Link Prediction in Fuzzy Social Networks using Distributed Learning Automata

Link Prediction in Fuzzy Social Networks using Distributed Learning Automata Link Prediction in Fuzzy Social Networks using Distributed Learning Automata Behnaz Moradabadi 1 and Mohammad Reza Meybodi 2 1,2 Department of Computer Engineering, Amirkabir University of Technology,

More information

Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University Infinite data. Filtering data streams

Mining of Massive Datasets Jure Leskovec, Anand Rajaraman, Jeff Ullman Stanford University  Infinite data. Filtering data streams /9/7 Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them

More information

Link prediction with sequences on an online social network

Link prediction with sequences on an online social network Link prediction with sequences on an online social network Benjamin Fasquelle 1 supervised by Renaud Lambiotte 2 1 École Normale Suprieure de Rennes, Campus de Ker lann, Avenue Robert Schuman, 35170 Bruz,

More information

Extracting Information from Complex Networks

Extracting Information from Complex Networks Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform

More information

Relational Retrieval Using a Combination of Path-Constrained Random Walks

Relational Retrieval Using a Combination of Path-Constrained Random Walks Relational Retrieval Using a Combination of Path-Constrained Random Walks Ni Lao, William W. Cohen University 2010.9.22 Outline Relational Retrieval Problems Path-constrained random walks The need for

More information

An Introduction to Search Engines and Web Navigation

An Introduction to Search Engines and Web Navigation An Introduction to Search Engines and Web Navigation MARK LEVENE ADDISON-WESLEY Ал imprint of Pearson Education Harlow, England London New York Boston San Francisco Toronto Sydney Tokyo Singapore Hong

More information

CSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties

CSE 255 Lecture 13. Data Mining and Predictive Analytics. Triadic closure; strong & weak ties CSE 255 Lecture 13 Data Mining and Predictive Analytics Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)

More information

SPM Users Guide. This guide elaborates on powerful ways to combine the TreeNet and GPS engines to achieve model compression and more.

SPM Users Guide. This guide elaborates on powerful ways to combine the TreeNet and GPS engines to achieve model compression and more. SPM Users Guide Model Compression via ISLE and RuleLearner This guide elaborates on powerful ways to combine the TreeNet and GPS engines to achieve model compression and more. Title: Model Compression

More information

CS 224W Final Project. An Analysis of GitHub s Collaborative Software Network

CS 224W Final Project. An Analysis of GitHub s Collaborative Software Network CS 224W Final Project An Analysis of GitHub s Collaborative Software Network Group 50: Nikhil Khadke (nkhadke), Ming Han Teh (minghan), Sharon Tan (sharonxh) December 10, 2012 1 Introduction Social coding

More information

1 Homophily and assortative mixing

1 Homophily and assortative mixing 1 Homophily and assortative mixing Networks, and particularly social networks, often exhibit a property called homophily or assortative mixing, which simply means that the attributes of vertices correlate

More information

CAIM: Cerca i Anàlisi d Informació Massiva

CAIM: Cerca i Anàlisi d Informació Massiva 1 / 72 CAIM: Cerca i Anàlisi d Informació Massiva FIB, Grau en Enginyeria Informàtica Slides by Marta Arias, José Balcázar, Ricard Gavaldá Department of Computer Science, UPC Fall 2016 http://www.cs.upc.edu/~caim

More information

A Survey of Link Recommendation for Social Networks: Methods, Theoretical Foundations, and Future Research Directions

A Survey of Link Recommendation for Social Networks: Methods, Theoretical Foundations, and Future Research Directions A Survey of Link Recommendation for Social Networks: Methods, Theoretical Foundations, and Future Research Directions Zhepeng Li, Schulich School of Business York University zli@ schulich.yorku.ca Xiao

More information

Nick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell

Nick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when

More information

Using Friendship Ties and Family Circles for Link Prediction

Using Friendship Ties and Family Circles for Link Prediction Using Friendship Ties and Family Circles for Link Prediction Elena Zheleva and Jennifer Golbeck Lise Getoor College of Information Studies Computer Science University of Maryland University of Maryland

More information

Authoritative Sources in a Hyperlinked Environment

Authoritative Sources in a Hyperlinked Environment Authoritative Sources in a Hyperlinked Environment Journal of the ACM 46(1999) Jon Kleinberg, Dept. of Computer Science, Cornell University Introduction Searching on the web is defined as the process of

More information

Scalable Graph Embedding for Asymmetric Proximity

Scalable Graph Embedding for Asymmetric Proximity Proceedings of the Thirty-First I onference on rtificial Intelligence (I-17) Scalable Graph Embedding for symmetric Proximity hang Zhou, 1 Yuqiong Liu, 1 Xiaofei Liu, 2 Zhongyi Liu, 2 Jun Gao 1 1 Key Laboratory

More information

V2: Measures and Metrics (II)

V2: Measures and Metrics (II) - Betweenness Centrality V2: Measures and Metrics (II) - Groups of Vertices - Transitivity - Reciprocity - Signed Edges and Structural Balance - Similarity - Homophily and Assortative Mixing 1 Betweenness

More information

CS-E5740. Complex Networks. Scale-free networks

CS-E5740. Complex Networks. Scale-free networks CS-E5740 Complex Networks Scale-free networks Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3. Growing network models: scale-free

More information

Information Retrieval

Information Retrieval Information Retrieval CSC 375, Fall 2016 An information retrieval system will tend not to be used whenever it is more painful and troublesome for a customer to have information than for him not to have

More information

End-to-End data mining feature integration, transformation and selection with Datameer Datameer, Inc. All rights reserved.

End-to-End data mining feature integration, transformation and selection with Datameer Datameer, Inc. All rights reserved. End-to-End data mining feature integration, transformation and selection with Datameer Fastest time to Insights Rapid Data Integration Zero coding data integration Wizard-led data integration & No ETL

More information

DRAFT. Can Network Analysis Techniques help to Predict Design Dependencies? An Initial Study. arxiv: v1 [cs.

DRAFT. Can Network Analysis Techniques help to Predict Design Dependencies? An Initial Study. arxiv: v1 [cs. Can Network Analysis Techniques help to Predict Design Dependencies? An Initial Study arxiv:1808.02776v1 [cs.se] 8 Aug 2018 J. Andrés Díaz-Pace, Antonela Tommasel, Daniela Godoy ISISTAN, CONICET-UNICEN.

More information

Statement by Mr. Vladimir Voronkov, Under-Secretary-General of the United Nations Office of Counter-Terrorism

Statement by Mr. Vladimir Voronkov, Under-Secretary-General of the United Nations Office of Counter-Terrorism Statement by Mr. Vladimir Voronkov, Under-Secretary-General of the United Nations Office of Counter-Terrorism Meeting of the United Nations Security Council Counter-Terrorism Committee Mr. Chairman, Excellencies,

More information

Who should catch (this Exception) {?}

Who should catch (this Exception) {?} Who should catch (this Exception) {?} Walaa ElDin M. Moustafa Department of Computer Science University of Maryland College Park, Maryland, USA walaa@cs.umd.edu ABSTRACT In this paper, we propose a software

More information

Alain Barrat CPT, Marseille, France ISI, Turin, Italy

Alain Barrat CPT, Marseille, France ISI, Turin, Italy Link creation and profile alignment in the anobii social network Alain Barrat CPT, Marseille, France ISI, Turin, Italy Social networks Huge field of research Data: mostly small samples, surveys Multiplexity

More information

SparklingGraph Documentation

SparklingGraph Documentation SparklingGraph Documentation Release 0.0.6 Roman Bartusiak Nov 12, 2017 Contents 1 How To 3 1.1 Release.................................................. 3 2 Loading graph data 5 2.1 Graph loading API............................................

More information

CSE 158. Web Mining and Recommender Systems. Midterm recap

CSE 158. Web Mining and Recommender Systems. Midterm recap CSE 158 Web Mining and Recommender Systems Midterm recap Midterm on Wednesday! 5:10 pm 6:10 pm Closed book but I ll provide a similar level of basic info as in the last page of previous midterms CSE 158

More information

Data can be in the form of numbers, words, measurements, observations or even just descriptions of things.

Data can be in the form of numbers, words, measurements, observations or even just descriptions of things. + What is Data? Data is a collection of facts. Data can be in the form of numbers, words, measurements, observations or even just descriptions of things. In most cases, data needs to be interpreted and

More information

Similarity Ranking in Large- Scale Bipartite Graphs

Similarity Ranking in Large- Scale Bipartite Graphs Similarity Ranking in Large- Scale Bipartite Graphs Alessandro Epasto Brown University - 20 th March 2014 1 Joint work with J. Feldman, S. Lattanzi, S. Leonardi, V. Mirrokni [WWW, 2014] 2 AdWords Ads Ads

More information

Link Prediction in a Modified Heterogeneous Bibliographic Network

Link Prediction in a Modified Heterogeneous Bibliographic Network Link Prediction in a Modified Heterogeneous Bibliographic Network John Boaz Lee, Henry Adorna Department of Information Systems and Computer Science, Ateneo de Manila University Algorithms and Complexity

More information

CSE 158 Lecture 13. Web Mining and Recommender Systems. Triadic closure; strong & weak ties

CSE 158 Lecture 13. Web Mining and Recommender Systems. Triadic closure; strong & weak ties CSE 158 Lecture 13 Web Mining and Recommender Systems Triadic closure; strong & weak ties Monday Random models of networks: Erdos Renyi random graphs (picture from Wikipedia http://en.wikipedia.org/wiki/erd%c5%91s%e2%80%93r%c3%a9nyi_model)

More information

Section A. 1. a) Explain the evolution of information systems into today s complex information ecosystems and its consequences.

Section A. 1. a) Explain the evolution of information systems into today s complex information ecosystems and its consequences. Section A 1. a) Explain the evolution of information systems into today s complex information ecosystems and its consequences. b) Discuss the reasons behind the phenomenon of data retention, its disadvantages,

More information

Part I: Data Mining Foundations

Part I: Data Mining Foundations Table of Contents 1. Introduction 1 1.1. What is the World Wide Web? 1 1.2. A Brief History of the Web and the Internet 2 1.3. Web Data Mining 4 1.3.1. What is Data Mining? 6 1.3.2. What is Web Mining?

More information

1 Starting around 1996, researchers began to work on. 2 In Feb, 1997, Yanhong Li (Scotch Plains, NJ) filed a

1 Starting around 1996, researchers began to work on. 2 In Feb, 1997, Yanhong Li (Scotch Plains, NJ) filed a !"#$ %#& ' Introduction ' Social network analysis ' Co-citation and bibliographic coupling ' PageRank ' HIS ' Summary ()*+,-/*,) Early search engines mainly compare content similarity of the query and

More information

DATA MINING AND MACHINE LEARNING. Lecture 6: Data preprocessing and model selection Lecturer: Simone Scardapane

DATA MINING AND MACHINE LEARNING. Lecture 6: Data preprocessing and model selection Lecturer: Simone Scardapane DATA MINING AND MACHINE LEARNING Lecture 6: Data preprocessing and model selection Lecturer: Simone Scardapane Academic Year 2016/2017 Table of contents Data preprocessing Feature normalization Missing

More information

The Strength of Social Coding Collaboration on GitHub

The Strength of Social Coding Collaboration on GitHub The Strength of Social Coding Collaboration on GitHub 2 Who?! Gabriela Brant Alves Graduate Student in Sistemas de Informação at UFMG gabrielabrant@dcc.ufmg.br 3 Team Michele A. Brandão Diogo M. Santana

More information

Big Data Analytics CSCI 4030

Big Data Analytics CSCI 4030 High dim. data Graph data Infinite data Machine learning Apps Locality sensitive hashing PageRank, SimRank Filtering data streams SVM Recommen der systems Clustering Community Detection Queries on streams

More information

Analysis of Co-Authorship Network of Scientists Working on Topic of Network Theory

Analysis of Co-Authorship Network of Scientists Working on Topic of Network Theory Analysis of Co-Authorship Network of Scientists Working on Topic of Network Theory Manu Kohli School of Informatics and Computing Indiana University Bloomington, USA kohlim@umail.iu.edu Saurabh Jain School

More information

Internal Link Prediction in Early Stage using External Network

Internal Link Prediction in Early Stage using External Network Internal Link Prediction in Early Stage using External Network Honghao Wei Stanford University weihh16 weihh16@stanford.edu Yiwei Zhao Stanford University ywzhao ywzhao@stanford.edu Junjie Ke Stanford

More information

CSE 158, Fall 2017: Midterm

CSE 158, Fall 2017: Midterm CSE 158, Fall 2017: Midterm Name: Student ID: Instructions The test will start at 5:10pm. Hand in your solution at or before 6:10pm. Answers should be written directly in the spaces provided. Do not open

More information

CS224W: Analysis of Networks Jure Leskovec, Stanford University

CS224W: Analysis of Networks Jure Leskovec, Stanford University CS224W: Analysis of Networks Jure Leskovec, Stanford University http://cs224w.stanford.edu 11/13/17 Jure Leskovec, Stanford CS224W: Analysis of Networks, http://cs224w.stanford.edu 2 Observations Models

More information

Information Networks and Semantics. Srinath Srinivasa IIIT Bangalore

Information Networks and Semantics. Srinath Srinivasa IIIT Bangalore Information Networks and Semantics Srinath Srinivasa IIIT Bangalore sri@iiitb.ac.in Outline Information versus Material Networks Semantics in Information Networks Knowledge Networks Triadic Closure Entrenchment

More information

Lecture 9: I: Web Retrieval II: Webology. Johan Bollen Old Dominion University Department of Computer Science

Lecture 9: I: Web Retrieval II: Webology. Johan Bollen Old Dominion University Department of Computer Science Lecture 9: I: Web Retrieval II: Webology Johan Bollen Old Dominion University Department of Computer Science jbollen@cs.odu.edu http://www.cs.odu.edu/ jbollen April 10, 2003 Page 1 WWW retrieval Two approaches

More information

Latent Distance Models and. Graph Feature Models Dr. Asja Fischer, Prof. Jens Lehmann

Latent Distance Models and. Graph Feature Models Dr. Asja Fischer, Prof. Jens Lehmann Latent Distance Models and Graph Feature Models 2016-02-09 Dr. Asja Fischer, Prof. Jens Lehmann Overview Last lecture we saw how neural networks/multi-layer perceptrons (MLPs) can be applied to SRL. After

More information

Bibliometrics: Citation Analysis

Bibliometrics: Citation Analysis Bibliometrics: Citation Analysis Many standard documents include bibliographies (or references), explicit citations to other previously published documents. Now, if you consider citations as links, academic

More information