HCC class lecture 23 comments John Canny 4/18/05.

Slides:



Advertisements
Similar presentations
Social Network Analysis (in 10 minutes) Nick Crossley.
Advertisements

Clustering Categorical Data The Case of Quran Verses
Graph Isomorphism Algorithms and networks. Graph Isomorphism 2 Today Graph isomorphism: definition Complexity: isomorphism completeness The refinement.
Five expository text structures
Copyright © Cengage Learning. All rights reserved.
Relationship Mining Network Analysis Week 5 Video 5.
Math 1241, Spring 2014 Section 3.1, Part One Introduction to Limits Finding Limits From a Graph One-sided and Infinite Limits.
Introduction to Bioinformatics
V4 Matrix algorithms and graph partitioning
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
HCC class lecture 6 comments John Canny 2/7/05. Administrivia.
Chapter 11 Section 1 Introduction to Difference Equations.
Fall 2006Costas Busch - RPI1 Regular Expressions.
Now, we use two methods to do the morphological dilation to image A with B: A: B: + +: the origin.
HCC class lecture 3 comments John Canny 1/26/05. Administrivia Access to swiki OK? Office hours this week: 3-4 pm Tuesday 4-5 pm Wednesday.
Social Position & Social Role Lei Tang 2009/02/13.
Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.
Recommendations via Collaborative Filtering. Recommendations Relevant for movies, restaurants, hotels…. Recommendation Systems is a very hot topic in.
HCC class lecture 11 comments John Canny 2/28/05.
Selected Topics in Data Networking Graph Representation.
Copyright © Cengage Learning. All rights reserved. 5 Integrals.
October 7, 2010Neural Networks Lecture 10: Setting Backpropagation Parameters 1 Creating Data Representations On the other hand, sets of orthogonal vectors.
HCC class lecture 22 comments John Canny 4/13/05.
Chapter 12 Network positions and social roles: The idea of equivalence 1.
Radial Basis Function Networks
Network Measures Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Network Measures Klout.
Clustering Unsupervised learning Generating “classes”
Models of Influence in Online Social Networks
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 20 By Herbert I. Gross and Richard A. Medeiros next.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Sequences Lesson: SEQ-L1 Sequences and Spreadsheets Sequences and Spreadsheets Learning Outcome.
Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.
TM CG Notes Latest: Outline Big Picture architecture Topic Maps – CG – Notio Notes – Amine Notes – CharGer Notes – Prolog – Analogy –
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 13 Oct 14, 2005 Nanjing University of Science & Technology.
HCC class lecture 27 comments John Canny 5/2/05. Administrivia.
Victor Lee.  What are Social Networks?  Role and Position Analysis  Equivalence Models for Roles  Block Modelling.
May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.
Copyright © Zeph Grunschlag, More on Graphs.
Integrals  In Chapter 2, we used the tangent and velocity problems to introduce the derivative—the central idea in differential calculus.  In much the.
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
Big Ideas Differentiation Frames with Icons. 1. Number Uses, Classification, and Representation- Numbers can be used for different purposes, and numbers.
Special Topics in Educational Data Mining HUDK5199 Spring 2013 March 25, 2012.
GRAPHS THEROY. 2 –Graphs Graph basics and definitions Vertices/nodes, edges, adjacency, incidence Degree, in-degree, out-degree Subgraphs, unions, isomorphism.
1 Cohesion + Coherence Lecture 9 MODULE 2 Meaning and discourse in English.
Networks Igor Segota Statistical physics presentation.
1 Topics Recursion sections 8.1 – Recursion A recursively defined sequence –First, certain initial values are specified –Later terms of the sequence.
Counting nCr = n!/r!(n-r)!=nC(n-r) This equation reflects the fact that selecting r items is same as selecting n-r items in forming a combination from.
Mining and Visualizing the Evolution of Subgroups in Social Networks Falkowsky, T., Bartelheimer, J. & Spiliopoulou, M. (2006) IEEE/WIC/ACM International.
HCC class lecture 17 comments John Canny 3/28/05.
Inequalities Section 10.6 Absolute Value of Products in Open Sentences.
Topics Paths and Circuits (11.2) A B C D E F G.
BUILDING BLOCKS OF SOCIAL STRUCTURE CHAPTER 4:1. BUILDING BLOCKS OF SOCIAL STRUCTURE Social structure- the network of interrelated statuses and roles.
Regular Expressions Costas Busch - LSU.
In Chapters 6 and 8, we will see how to use the integral to solve problems concerning:  Volumes  Lengths of curves  Population predictions  Cardiac.
HCC class lecture 21: Intro to Social Networks John Canny 4/11/05.
HCC class lecture 26 comments John Canny 4/27/05.
How to write an effective conclusion Also known as putting it all together.
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
A Introduction to Computing II Lecture 16: Dijkstra’s Algorithm Fall Session 2000.
Analyzing DNA Fragments AP Biology Fall DNA Fingerprint  DNA fingerprint: unique array of base sequences in each organism that is slightly different.
Computer Network Architecture Lecture 9: IP Addressing 13/1/
Unit 10: Sequences & Series By: Saranya Nistala. Unit Goal: I can find and analyze arithmetic and geometric sequences and series. Key Concepts:  Define.
Infinite Sequences and Series 8. Sequences Sequences A sequence can be thought of as a list of numbers written in a definite order: a 1, a 2, a.
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
HCC class lecture 25 comments John Canny 4/25/05.
Graph clustering to detect network modules
Geometric sequences.
Data Clustering Michael J. Watts
HCC class lecture 13 comments
HCC class lecture 16 comments
Write the recursive and explicit formula for the following sequence
Presentation transcript:

HCC class lecture 23 comments John Canny 4/18/05

Administrivia Reminder: Project presentations on May 9 and 11.

Role and Position Role is an intuitive idea: it is what the actor “does” in the network. People with similar roles should be interchangeable in the network, so role analysis is similar to paradigmatic analysis from semiotics.

Role and Position Position is an explicit set of similar actors. These actors share the same set of relations with others. Role is the pattern of relations between the actors. Therefore role is the more abstract, portable notion. E.g. Mother, child, manager, travel agent, can be defined by particular sets of relations between these actors and certain other. The position of father in a particular network is the set of actors who act as fathers to others in the network.

Equivalence Regular equivalence: Regular equivalence: Actors are equivalent if they have ties to others with the corresponding roles. e.g. A has the role of mother because of ties to B, C, D, who have the role of “son” or “daughter”.

Equivalence Regular equivalence: Regular equivalence: Actors are equivalent if they have ties to others with the corresponding roles. e.g. A has the role of mother because of ties to B, C, D, who have the role of “son” or “daughter”.

Equivalence Structural equivalence is an easy notion to deal with, since it depends on the actual identities of the neighbors. E.g. correlations or euclidean distance comparison can be used. Regular equivalence is a more useful idea, but is trickier because its definition is recursive: One must know the neighbors roles’ before assigning a new role. Regular equivalence is an active area of research, although some solutions exist.

Hierarchical clustering One natural way to build a regular equivalence relation is to hierarchically cluster the data: Actors are clustered together if they have the similar relations to other actors (structural equivalence). Then we repeat the clustering on the abstracted graph (actors are clusters from the previous step), etc… In this way, neighbors are labeled with “roles” from the previous step.

Discussion Topics T1: How do role and position relate to communities of practice? Are such communities actually “positions” in a network, or do they have internal roles, or both? T2: The readings argue that its often helpful to use “typed” ties (e.g. a tie that is explicitly labeled “mother”). By using example networks that you know, critique this idea. Can ties always be typed? Or are there ties whose type may not be known a priori?