HCC class lecture 22 comments John Canny 4/13/05.

Slides:



Advertisements
Similar presentations
Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale Network Theory: Computational Phenomena and Processes Social Network.
Advertisements

Analysis and Modeling of Social Networks Foudalis Ilias.
Graphs, Node importance, Link Analysis Ranking, Random walks
Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.
Relationship Mining Network Analysis Week 5 Video 5.
CS345 Data Mining Link Analysis Algorithms Page Rank Anand Rajaraman, Jeffrey D. Ullman.
Link Analysis: PageRank
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
More on Rankings. Query-independent LAR Have an a-priori ordering of the web pages Q: Set of pages that contain the keywords in the query q Present the.
DATA MINING LECTURE 12 Link Analysis Ranking Random walks.
CS 206 Introduction to Computer Science II 11 / 11 / Veterans Day Instructor: Michael Eckmann.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 3 March 23, 2005
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
1 CS 430 / INFO 430: Information Retrieval Lecture 16 Web Search 2.
Centrality and Prestige HCC Spring 2005 Wednesday, April 13, 2005 Aliseya Wright.
Pádraig Cunningham University College Dublin Matrix Tutorial Transition Matrices Graphs Random Walks.
Multimedia Databases SVD II. Optimality of SVD Def: The Frobenius norm of a n x m matrix M is (reminder) The rank of a matrix M is the number of independent.
Introduction to Information Retrieval Introduction to Information Retrieval Hinrich Schütze and Christina Lioma Lecture 21: Link Analysis.
Zdravko Markov and Daniel T. Larose, Data Mining the Web: Uncovering Patterns in Web Content, Structure, and Usage, Wiley, Slides for Chapter 1:
ICS 278: Data Mining Lecture 15: Mining Web Link Structure
Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.
HCC class lecture 23 comments John Canny 4/18/05.
CS 206 Introduction to Computer Science II 03 / 25 / 2009 Instructor: Michael Eckmann.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
CS345 Data Mining Link Analysis Algorithms Page Rank Anand Rajaraman, Jeffrey D. Ullman.
PageRank Identifying key users in social networks Student : Ivan Todorović, 3231/2014 Mentor : Prof. Dr Veljko Milutinović.
HCC class lecture 14 comments John Canny 3/9/05. Administrivia.
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
1 Random Walks on Graphs: An Overview Purnamrita Sarkar, CMU Shortened and modified by Longin Jan Latecki.
1 CS 430: Information Discovery Lecture 9 Term Weighting and Ranking.
Lectures 6 & 7 Centrality Measures Lectures 6 & 7 Centrality Measures February 2, 2009 Monojit Choudhury
Advanced Methods and Analysis for the Learning and Social Sciences PSY505 Spring term, 2012 April 25, 2012.
Centrality Spring 2012.
LexPageRank: Prestige in Multi- Document Text Summarization Gunes Erkan and Dragomir R. Radev Department of EECS, School of Information University of Michigan.
Lecture 13: Network centrality Slides are modified from Lada Adamic.
PageRank. s1s1 p 12 p 21 s2s2 s3s3 p 31 s4s4 p 41 p 34 p 42 p 13 x 1 = p 21 p 34 p 41 + p 34 p 42 p 21 + p 21 p 31 p 41 + p 31 p 42 p 21 / Σ x 2 = p 31.
Graph Algorithms. Graph Algorithms: Topics  Introduction to graph algorithms and graph represent ations  Single Source Shortest Path (SSSP) problem.
Complex Networks: Models Lecture 2 Slides by Panayiotis TsaparasPanayiotis Tsaparas.
Ranking Link-based Ranking (2° generation) Reading 21.
Slides are modified from Lada Adamic
Topic 12 Graphs 1. Graphs Definition: Two types:
HCC class lecture 21: Intro to Social Networks John Canny 4/11/05.
Link Analysis Algorithms Page Rank Slides from Stanford CS345, slightly modified.
Ljiljana Rajačić. Page Rank Web as a directed graph  Nodes: Web pages  Edges: Hyperlinks 2 / 25 Ljiljana Rajačić.
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
+ GRAPH Algorithm Dikompilasi dari banyak sumber.
“Important” Vertices and the PageRank Algorithm Networked Life NETS 112 Fall 2014 Prof. Michael Kearns.
Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Topics In Social Computing (67810) Module 1 (Structure) Centrality Measures, Graph Clustering Random Walks on Graphs.
1 CS 430 / INFO 430: Information Retrieval Lecture 20 Web Search 2.
Web Mining Link Analysis Algorithms Page Rank. Ranking web pages  Web pages are not equally “important” v  Inlinks.
Basic Concepts Graphs For more notes and topics visit:
Social Networks Analysis
Department of Computer and IT Engineering University of Kurdistan
Link-Based Ranking Seminar Social Media Mining University UC3M
Core Methods in Educational Data Mining
Network analysis.
Degree and Eigenvector Centrality
Centrality in Social Networks
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Prof. Paolo Ferragina, Algoritmi per "Information Retrieval"
Katz Centrality (directed graphs).
Graph and Link Mining.
Junghoo “John” Cho UCLA
GRAPHS Lecture 17 CS 2110 — Spring 2019.
Presented by Nick Janus
Presentation transcript:

HCC class lecture 22 comments John Canny 4/13/05

Administrivia I wont be here Monday, but class as usual.

Centrality, Prestige, Power Ways of articulating the importance of an actor in the network. Centrality is intuitively what the name implies. It matches the notion we have from communities of practice.

Centrality Three notions: Three notions: Degree: How many neighbors Degree: How many neighbors Closeness: How far to furthest actor Closeness: How far to furthest actor Betweeness: How many pairs of actors can be joined by a path through this actor Betweeness: How many pairs of actors can be joined by a path through this actor

Centrality – advanced measures Degree centrality can be applied iteratively (Bonacich). i.e. your centrality is proportional to the product of your neighbors and their centralities. Aka Bonacich or eigenvalue Centrality The actor weights come from the eigenvector of the largest eigenvalue of the adjacency matrix of the graph, or equivalently, the probability densities from a long random walk on the graph.

Centrality – Bonacich Bonacich centrality is generally acknowledged to be better than degree centrality for social networks. If you apply it to the web graph, you get Pagerank (Google’s page quality algorithm). If you apply it to sentences in a text, you get TextRank (a good summarization algorithm). Caveat: Many studies of web page quality have shown Pagerank to be equivalent to indegree.

Power – Bonacich Bonacich defined a notion of power which is different from centrality. It is based on the fact that if you are a neighbor of an actor with few neighbors, you have more power over them. Thus power is related to your own degree relative to your neighbors. There is a natural recursive definition similar to his Centrality measure.

Discussion Topics T1: Centrality is a concept usually applied to undirected graphs, while prestige or status relates to the indegree of a node in a directed graph. What could outdegree represent? Could it be a useful measure? T2: List some networks you know, what might be usefully represented with a centrality measure, and which centrality measure would be most appropriate.