Multi-label Relational Neighbor Classification using Social Context Features Xi Wang and Gita Sukthankar Department of EECS University of Central Florida.

Slides:



Advertisements
Similar presentations
Prof. Carolina Ruiz Department of Computer Science Worcester Polytechnic Institute INTRODUCTION TO KNOWLEDGE DISCOVERY IN DATABASES AND DATA MINING.
Advertisements

Sparsification and Sampling of Networks for Collective Classification
BiG-Align: Fast Bipartite Graph Alignment
ICDE 2014 LinkSCAN*: Overlapping Community Detection Using the Link-Space Transformation Sungsu Lim †, Seungwoo Ryu ‡, Sejeong Kwon§, Kyomin Jung ¶, and.
Recognizing Human Actions by Attributes CVPR2011 Jingen Liu, Benjamin Kuipers, Silvio Savarese Dept. of Electrical Engineering and Computer Science University.
+ Multi-label Classification using Adaptive Neighborhoods Tanwistha Saha, Huzefa Rangwala and Carlotta Domeniconi Department of Computer Science George.
Image classification Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing them?
Active Learning for Streaming Networked Data Zhilin Yang, Jie Tang, Yutao Zhang Computer Science Department, Tsinghua University.
1 Machine Learning: Lecture 10 Unsupervised Learning (Based on Chapter 9 of Nilsson, N., Introduction to Machine Learning, 1996)
Social Media Mining Chapter 5 1 Chapter 5, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool, September, 2010.
Patch to the Future: Unsupervised Visual Prediction
INTRODUCTION Heesoo Myeong, Ju Yong Chang, and Kyoung Mu Lee Department of EECS, ASRI, Seoul National University, Seoul, Korea Learning.
Intelligent Systems Lab. Recognizing Human actions from Still Images with Latent Poses Authors: Weilong Yang, Yang Wang, and Greg Mori Simon Fraser University,
Christine Preisach, Steffen Rendle and Lars Schmidt- Thieme Information Systems and Machine Learning Lab (ISMLL) University of Hildesheim Germany Relational.
Lei Tang May.04,  Typical Classification task: IID assumption  Relational Learning: instances are interrelated.  Some Examples: ◦ Hypertext Classification.
IJCAI Wei Zhang, 1 Xiangyang Xue, 2 Jianping Fan, 1 Xiaojing Huang, 1 Bin Wu, 1 Mingjie Liu 1 Fudan University, China; 2 UNCC, USA {weizh,
1 1 Chenhao Tan, 1 Jie Tang, 2 Jimeng Sun, 3 Quan Lin, 4 Fengjiao Wang 1 Department of Computer Science and Technology, Tsinghua University, China 2 IBM.
Data Mining and Machine Learning Lab Document Clustering via Matrix Representation Xufei Wang, Jiliang Tang and Huan Liu Arizona State University.
Communities in Heterogeneous Networks Chapter 4 1 Chapter 4, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool,
Graph Based Semi- Supervised Learning Fei Wang Department of Statistical Science Cornell University.
Discovering Overlapping Groups in Social Media Xufei Wang, Lei Tang, Huiji Gao, and Huan Liu Arizona State University.
On Community Outliers and their Efficient Detection in Information Networks Jing Gao 1, Feng Liang 1, Wei Fan 2, Chi Wang 1, Yizhou Sun 1, Jiawei Han 1.
Heterogeneous Consensus Learning via Decision Propagation and Negotiation Jing Gao† Wei Fan‡ Yizhou Sun†Jiawei Han† †University of Illinois at Urbana-Champaign.
Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University
Example Data Sets Prior Research Join related objects to form independent compound objects, cluster normally (Yin et al., 2005). Use attribute-based distance.
CS Instance Based Learning1 Instance Based Learning.
Introduction to machine learning
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Transfer Learning From Multiple Source Domains via Consensus Regularization Ping Luo, Fuzhen Zhuang, Hui Xiong, Yuhong Xiong, Qing He.
Presented By Wanchen Lu 2/25/2013
Cao et al. ICML 2010 Presented by Danushka Bollegala.
Intrusion Detection Jie Lin. Outline Introduction A Frame for Intrusion Detection System Intrusion Detection Techniques Ideas for Improving Intrusion.
Data mining and machine learning A brief introduction.
1 Formal Models for Expert Finding on DBLP Bibliography Data Presented by: Hongbo Deng Co-worked with: Irwin King and Michael R. Lyu Department of Computer.
2015/10/111 DBconnect: Mining Research Community on DBLP Data Osmar R. Zaïane, Jiyang Chen, Randy Goebel Web Mining and Social Network Analysis Workshop.
Collective Classification A brief overview and possible connections to -acts classification Vitor R. Carvalho Text Learning Group Meetings, Carnegie.
On Node Classification in Dynamic Content-based Networks.
Today Ensemble Methods. Recap of the course. Classifier Fusion
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Xiangnan Kong,Philip S. Yu Multi-Label Feature Selection for Graph Classification Department of Computer Science University of Illinois at Chicago.
Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks.
Graph-based Text Classification: Learn from Your Neighbors Ralitsa Angelova , Gerhard Weikum : Max Planck Institute for Informatics Stuhlsatzenhausweg.
Guided Learning for Role Discovery (GLRD) Presented by Rui Liu Gilpin, Sean, Tina Eliassi-Rad, and Ian Davidson. "Guided learning for role discovery (glrd):
Bing LiuCS Department, UIC1 Chapter 8: Semi-supervised learning.
Automatic Video Tagging using Content Redundancy Stefan Siersdorfer 1, Jose San Pedro 2, Mark Sanderson 2 1 L3S Research Center, Germany 2 University of.
Network Community Behavior to Infer Human Activities.
Measuring Behavioral Trust in Social Networks
Radial Basis Function ANN, an alternative to back propagation, uses clustering of examples in the training set.
Consensus Group Stable Feature Selection
Relation Strength-Aware Clustering of Heterogeneous Information Networks with Incomplete Attributes ∗ Source: VLDB.
Unsupervised Streaming Feature Selection in Social Media
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Mining Advisor-Advisee Relationships from Research Publication.
Scalable Learning of Collective Behavior Based on Sparse Social Dimensions Lei Tang, Huan Liu CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/02/01.
CIS750 – Seminar in Advanced Topics in Computer Science Advanced topics in databases – Multimedia Databases V. Megalooikonomou Link mining ( based on slides.
Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation By: Xiaozhong Liu, Yingying Yu, Chun Guo, Yizhou.
Linear Models & Clustering Presented by Kwak, Nam-ju 1.
Term Project Proposal By J. H. Wang Apr. 7, 2017.
Finding Dense and Connected Subgraphs in Dual Networks
Semi-Supervised Clustering
Greedy & Heuristic algorithms in Influence Maximization
Sofus A. Macskassy Fetch Technologies
Machine Learning Basics
Community Distribution Outliers in Heterogeneous Information Networks
The Importance of Communities for Learning to Influence
Adaptive entity resolution with human computation
Jiawei Han Department of Computer Science
Prepared by: Mahmoud Rafeek Al-Farra
GANG: Detecting Fraudulent Users in OSNs
CSSE463: Image Recognition Day 18
Modeling Topic Diffusion in Scientific Collaboration Networks
Presentation transcript:

Multi-label Relational Neighbor Classification using Social Context Features Xi Wang and Gita Sukthankar Department of EECS University of Central Florida

Motivation  The conventional relational classification model focuses on the single-label classification problem.  Real-world relational datasets contain instances associated with multiple labels.  Connections between instances in multi-label networks are driven by various casual reasons. Example: Scientific collaboration network Machine Learning Data Mining Artificial Intelligence 1

Problem Formulation  Node classification in multi-relational networks  Input:  Network structure (i.e., connectivity information)  Labels of some actors in the network  Output:  Labels of the other actors 2

Classification in Networked Data  Homophily: nodes with similar labels are more likely to be connected  Markov assumption:  The label of one node depends on that of its immediate neighbors in the graph  Relational models are built based on the labels of neighbors.  Predictions are made using collective inference. 3

Contribution  A new multi-label iterative relational neighbor classifier (SCRN)  Extract social context features using edge clustering to represent a node’s potential group membership  Use of social features boosts classification performance over benchmarks on several real-world collaborative networked datasets 4

Relational Neighbor Classifier  The Relational Neighbor (RN) classifier proposed by Macskassy et al. (MRDM’03), is a simple relational probabilistic model that makes predictions for a given node based solely on the class labels of its neighbors. Iteration 1 Iteration 2 Training Graph 5

Relational Neighbor Classifier  Weighted-vote relational neighbor classifier (wvRN) estimates prediction probability as: Here is the usual normalization factor, and is the weight of the link between node and 6

Apply RN in Multi-relational Network Ground truth : nodes with both labels (red, green) : nodes with green label only : nodes with red label only 7

Edge-Based Social Feature Extraction  Connections in human networks are mainly affiliation- driven.  Since each connection can often be regarded as principally resulting from one affiliation, links possess a strong correlation with a single affiliation class.  The edge class information is not readily available in most social media datasets, but an unsupervised clustering algorithm can be applied to partition the edges into disjoint sets (KDD’09,CIKM’09). 8

Cluster edges using K-Means  Scalable edge clustering method proposed by Tang et al. (CIKM’09).  Each edge is represented in a feature-based format, where each edge is characterized by its adjacent nodes.  K-means clustering is used to separate the edges into groups, and the social feature (SF) vector is constructed based on edge cluster IDs. Original network Step1 : Edge representations Step2: Construct social features 9

Edge-Clustering Visualization Figure: A subset of DBLP with 95 instances. Edges are clustered into 10 groups, with each shown in a different color. 10

Proposed Method: SCRN  The initial set of reference features for class c can be defined as the weighted sum of social feature vectors for nodes known to be in class c:  Then node ’s class propagation probability for class c conditioned on its social features: 11

SCRN  SCRN estimates the class-membership probability of node belonging to class c using the following equation: class propagation probability similarity between connected nodes (link weight) class probability of its neighbors 12

SCRN Overview Input:, Max_Iter Output: for nodes in 1.Construct nodes’ social feature space 2.Initialize the class reference vectors for each class 3.Calculate the class-propagation probability for each test node 4.Repeat until # of iterations > Max_Iter or predictions converge  Estimate test node’s class probability  Update the test node’s class probability in collective inference  Update the class reference vectors  Re-calculate each node’s class-propagation probability 13

SCRN Visualization Figure: SCRN on synthetic multi-label network with 1000 nodes and 32 classes (15 iterations). 14

Datasets  DBLP  We construct a weighted collaboration network for authors who have published at least 2 papers during the 2000 to 2010 time- frame.  We selected 15 representative conferences in 6 research areas: DataBase: ICDE,VLDB, PODS, EDBT Data Mining: KDD, ICDM, SDM, PAKDD Artificial Intelligence: IJCAI, AAAI Information Retrieval: SIGIR, ECIR Computer Vision: CVPR Machine Learning: ICML, ECML 15

Datasets  IMDb  We extract movies and TV shows released between 2000 and 2010, and those directed by the same director are linked together.  We only retain movies and TV programs with greater than 5 links.  Each movie can be assigned to a subset of 27 different candidate movie genres in the database such as “Drama", “Comedy", “Documentary" and “Action”. 16

Datasets  YouTube  A subset of data (15000 nodes) from the original YouTube dataset [1] using snowball sampling.  Each user in YouTube can subscribe to different interest groups and add other users as his/her contacts.  Class labels are 47 interest groups. [1] dimension.html 17

Comparative Methods  Edge (EdgeCluster)  wvRN  Prior  Random 18

Experiment Setting  Size of social feature space :  1000 for DBLP and YouTube; for IMDb  Class propagation probability is calculated with the Generalized Histogram Intersection Kernel.  Relaxation Labeling is used in the collective inference framework for SCRN and wvRN.  We assume the number of labels for testing nodes is known. 19

Experiment Setting  We employ the network cross-validation (NCV) method (KAIS’11) to reduce the overlap between test samples.  Classification performance is evaluated based on Micro-F1, Macro-F1 and Hamming Loss. 20

Results (Micro-F1)  DBLP 21

Results (Macro-F1)  DBLP 22

Results (Hamming Loss)  DBLP 23

Results (Hamming Loss)  IMDb 24

Results (Hamming Loss)  YouTube 25

Conclusion  Links in multi-relational networks are heterogeneous.  SCRN exploits label homophily while simultaneously leveraging social feature similarity through the introduction of class propagation probabilities.  Significantly boosts classification performance on multi- label collaboration networks.  Our open-source implementation of SCRN is available at: 26

Reference  MACSKASSY, S. A., AND PROVOST, F. A simple relational classifier. In Proceedings of the Second Workshop on Multi-Relational Data Mining (MRDM) at KDD, 2003, pp. 64–76.  TANG, L., AND LIU, H. Relational learning via latent social dimensions. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2009, pp. 817–826.  TANG, L., AND LIU, H. Scalable learning of collective behavior based on sparse social dimensions. In Proceedings of International Conference on Information and Knowledge Management (CIKM), 2009, pp  NEVILLE, J., GALLAGHER, B., ELIASSI-RAD, T., AND WANG, T. Correcting evaluation bias of relational classifiers with network cross validation. Knowledge and Information Systems (KAIS), 2011, pp. 1–25. 27

Thank you! 28