Social Position & Social Role Lei Tang 2009/02/13.

Slides:



Advertisements
Similar presentations
Community Detection and Graph-based Clustering
Advertisements

SEEM Tutorial 4 – Clustering. 2 What is Cluster Analysis?  Finding groups of objects such that the objects in a group will be similar (or.
Cluster Analysis: Basic Concepts and Algorithms
1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Clustering Basic Concepts and Algorithms
PARTITIONAL CLUSTERING
Block Modeling Overview Social life can be described (at least in part) through social roles. To the extent that roles can be characterized by regular.
Community Detection and Evaluation
CHAPTER 8: AFFILIATION AND OVERLAPPING SUBGROUPS SOCIAL NETWORK ANALYSIS BY WASSERMAN AND FAUST AFFILIATION NETWORKS Adapted from a presentation by Jody.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
(Social) Networks Analysis I
Feb 20, Definition of subgroups Definition of sub-groups: “Cohesive subgroups are subsets of actors among whom there are relatively strong, direct,
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
Lecture 8 Communities Slides modified from Huan Liu, Lei Tang, Nitin Agarwal.
Communities in Heterogeneous Networks Chapter 4 1 Chapter 4, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool,
Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.
Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Slide 1 EE3J2 Data Mining Lecture 16 Unsupervised Learning Ali Al-Shahib.
HCC class lecture 23 comments John Canny 4/18/05.
Cluster Analysis: Basic Concepts and Algorithms
Microarray analysis 2 Golan Yona. 2) Analysis of co-expression Search for similarly expressed genes experiment1 experiment2 experiment3 ……….. Gene i:
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Lecture 09 Clustering-based Learning
Slide 1 EE3J2 Data Mining EE3J2 Data Mining Lecture 11: Clustering Martin Russell.
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”
COMMUNITIES IN MULTI-MODE NETWORKS 1. Heterogeneous Network Heterogeneous kinds of objects in social media – YouTube Users, tags, videos, ads – Del.icio.us.
Lecture 18 Community structures Slides modified from Huan Liu, Lei Tang, Nitin Agarwal.
Victor Lee.  What are Social Networks?  Role and Position Analysis  Equivalence Models for Roles  Block Modelling.
CLUSTERING. Overview Definition of Clustering Existing clustering methods Clustering examples.
A genetic approach to the automatic clustering problem Author : Lin Yu Tseng Shiueng Bien Yang Graduate : Chien-Ming Hsiao.
Dimension reduction : PCA and Clustering Slides by Agnieszka Juncker and Chris Workman modified by Hanne Jarmer.
CSE5334 DATA MINING CSE4334/5334 Data Mining, Fall 2014 Department of Computer Science and Engineering, University of Texas at Arlington Chengkai Li (Slides.
Prepared by: Mahmoud Rafeek Al-Farra
Lecture 6 Spring 2010 Dr. Jianjun Hu CSCE883 Machine Learning.
Mining and Visualizing the Evolution of Subgroups in Social Networks Falkowsky, T., Bartelheimer, J. & Spiliopoulou, M. (2006) IEEE/WIC/ACM International.
By Timofey Shulepov Clustering Algorithms. Clustering - main features  Clustering – a data mining technique  Def.: Classification of objects into sets.
Hierarchy Overview Background: Hierarchy surrounds us: what is it? Micro foundations of social stratification Ivan Chase: Structure from process Action.
Graphs & Matrices Todd Cromedy & Bruce Nicometo March 30, 2004.
CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.
CHAPTER 1: Introduction. 2 Why “Learn”? Machine learning is programming computers to optimize a performance criterion using example data or past experience.
Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.
Université d’Ottawa / University of Ottawa 2001 Bio 8100s Applied Multivariate Biostatistics L10.1 Lecture 10: Cluster analysis l Uses of cluster analysis.
Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
Lecture 7 Communities Slides modified from Huan Liu, Lei Tang, Nitin Agarwal.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
Block modeling and equivalence Christopher McCarty October 23, 2012.
Scalable Learning of Collective Behavior Based on Sparse Social Dimensions Lei Tang, Huan Liu CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/02/01.
Paper Presentation Social influence based clustering of heterogeneous information networks Qiwei Bao & Siqi Huang.
Introduction to Data Mining Clustering & Classification Reference: Tan et al: Introduction to data mining. Some slides are adopted from Tan et al.
Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.
Clustering [Idea only, Chapter 10.1, 10.2, 10.4].
Data Mining and Text Mining. The Standard Data Mining process.
Graph clustering to detect network modules
Clustering CSC 600: Data Mining Class 21.
Hierarchical Clustering
Dimension reduction : PCA and Clustering by Agnieszka S. Juncker
John Nicholas Owen Sarah Smith
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John.
Revision (Part II) Ke Chen
Multivariate Statistical Methods
Text Categorization Berlin Chen 2003 Reference:
SEEM4630 Tutorial 3 – Clustering.
Hierarchical Clustering
Presentation transcript:

Social Position & Social Role Lei Tang 2009/02/13

Social Postion  Position: A collection of individuals who are similarly embedded in networks of relations.  Position is different from cluster (or cohesive subgroup)  Group is formed based on adjacency, proximity or reachability  This is typically adopted in current data mining.  Position is based on the similarity of ties among subsets of actors.  Actors occupying the same position need not be in direct, or even indirect contact with each other.

Social Role  Roles: the patterns of relations which obtain between actors of between positions  Position focuses on actors while roles focus on relations  E.g. Kinship role defined as combination of marriage and descent.  Can be modeled in three levels:  Actors  Subsets of actors  The whole network  Based on multiple relations and the combinations of these relations

Overview of Positional & Role Analysis Multirelational Data Usual Role Analysis Usual Positional Analysis Roles and Positions Group actors Group Relations Group actors (Individual level) (group level)

Structural Equivalence  Actor I and J are structurally equivalent:  For all the other actors k (!=I or J), actor I has tie to k iff actor J has tie to k.  Example: Sociamatrix The submatrices corresponding to the ties between and within positions are filled with either all 0’s or all 1’s.

Positional Analysis  Major objective: simplify the information in a network data set  Tasks:  A formal definition of equivalence  A measure of equivalence  A representation of equivalence  Density matrix  Image matrix  Reduced graph  Asses adequacy (Goodness of fit)

Structural equivalence to Valued Ties  For discrete ties, easy to define structural equivalence. (Very strict)  For valued ties  Euclidean distance  Correlation

Partition Actors (Clustering)  Consider each row as one data instance.  Agglomerative Hierarchical clustering  CONCOR (convergence of iterated correlations)  Based on multirelaitonal network A,  Calculate pairwise correlation matrix C1  Compute pairwise correlation matrix C2 based on C1.  Continue until we get the block of +1/-1  CONCOR is connected to PCA. (the top eigenvector)  Can only split into two positions, like divisive clustering +1 +1

Role Analysis  Consider different combination of relations  E.g. if aRb denotes a is mother of b, then  aRRb represent a new relation (grandmother)  They assume the relations between actors are already known.  But for us, this is seldom known.  The book is focusing more on analysis rather than methodology