Network Community Behavior to Infer Human Activities.

Slides:



Advertisements
Similar presentations
Semantic Contours from Inverse Detectors Bharath Hariharan et.al. (ICCV-11)
Advertisements

Fast algorithm for detecting community structure in networks M. E. J. Newman Department of Physics and Center for the Study of Complex Systems, University.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Social network partition Presenter: Xiaofei Cao Partick Berg.
Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.
Multi-label Relational Neighbor Classification using Social Context Features Xi Wang and Gita Sukthankar Department of EECS University of Central Florida.
Analysis and Modeling of Social Networks Foudalis Ilias.
Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,
Community Detection Algorithm and Community Quality Metric Mingming Chen & Boleslaw K. Szymanski Department of Computer Science Rensselaer Polytechnic.
Social Media Mining Chapter 5 1 Chapter 5, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool, September, 2010.
V4 Matrix algorithms and graph partitioning
Accelerometer-based Transportation Mode Detection on Smartphones
Multiple Criteria for Evaluating Land Cover Classification Algorithms Summary of a paper by R.S. DeFries and Jonathan Cheung-Wai Chan April, 2000 Remote.
Communities in Heterogeneous Networks Chapter 4 1 Chapter 4, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool,
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
Clustering… in General In vector space, clusters are vectors found within  of a cluster vector, with different techniques for determining the cluster.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
Predicting the Semantic Orientation of Adjective Vasileios Hatzivassiloglou and Kathleen R. McKeown Presented By Yash Satsangi.
Fast algorithm for detecting community structure in networks.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Imperial College LondonFebruary 2007 Bubble Rap: Forwarding in Small World DTNs in Ever Decreasing Circles Part 2 - People Are the Network Jon Crowcroft.
Computing Trust in Social Networks
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Hierarchical Subquery Evaluation for Active Learning on a Graph Oisin Mac Aodha, Neill Campbell, Jan Kautz, Gabriel Brostow CVPR 2014 University College.
The Relative Vertex-to-Vertex Clustering Value 1 A New Criterion for the Fast Detection of Functional Modules in Protein Interaction Networks Zina Mohamed.
Models of Influence in Online Social Networks
SoundSense: Scalable Sound Sensing for People-Centric Application on Mobile Phones Hon Lu, Wei Pan, Nocholas D. lane, Tanzeem Choudhury and Andrew T. Campbell.
CHAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling
© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.
Using Friendship Ties and Family Circles for Link Prediction Elena Zheleva, Lise Getoor, Jennifer Golbeck, Ugur Kuter (SNAKDD 2008)
A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
SoundSense by Andrius Andrijauskas. Introduction  Today’s mobile phones come with various embedded sensors such as GPS, WiFi, compass, etc.  Arguably,
Modeling Relationship Strength in Online Social Networks Rongjing Xiang: Purdue University Jennifer Neville: Purdue University Monica Rogati: LinkedIn.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
Community detection algorithms: a comparative analysis Santo Fortunato.
Vladyslav Kolbasin Stable Clustering. Clustering data Clustering is part of exploratory process Standard definition:  Clustering - grouping a set of.
Report on Intrusion Detection and Data Fusion By Ganesh Godavari.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Special Topics in Educational Data Mining HUDK5199 Spring 2013 March 25, 2012.
Mining Social Network for Personalized Prioritization Language Techonology Institute School of Computer Science Carnegie Mellon University Shinjae.
Mining Social Networks for Personalized Prioritization Shinjae Yoo, Yiming Yang, Frank Lin, II-Chul Moon [KDD ’09] 1 Advisor: Dr. Koh Jia-Ling Reporter:
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Chapter 3. Community Detection and Evaluation May 2013 Youn-Hee Han
Character Identification in Feature-Length Films Using Global Face-Name Matching IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 11, NO. 7, NOVEMBER 2009 Yi-Fan.
Communities. Questions 1.What is a community (intuitively)? Examples and fundamental hypothesis 2.What do we really mean by communities? Basic definitions.
SocialVoD: a Social Feature-based P2P System Wei Chang, and Jie Wu Presenter: En Wang Temple University, PA, USA IEEE ICPP, September, Beijing, China1.
COMMUNITY DISCOVERY PART 1: A (BRIEF) INTRODUCTION Giulio Rossetti WMA - 4 May 2015.
Community Discovery in Social Network Yunming Ye Department of Computer Science Shenzhen Graduate School Harbin Institute of Technology.
Mining information from social media
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Network Theory: Community Detection Dr. Henry Hexmoor Department of Computer Science Southern Illinois University Carbondale.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Enhanced hypertext categorization using hyperlinks Soumen Chakrabarti (IBM Almaden) Byron Dom (IBM Almaden) Piotr Indyk (Stanford)
James Hipp Senior, Clemson University.  Graph Representation G = (V, E) V = Set of Vertices E = Set of Edges  Adjacency Matrix  No Self-Inclusion (i.
Topical Analysis and Visualization of (Network) Data Using Sci2 Ted Polley Research & Editorial Assistant Cyberinfrastructure for Network Science Center.
1 Discovering Web Communities in the Blogspace Ying Zhou, Joseph Davis (HICSS 2007)
Pattern Recognition. What is Pattern Recognition? Pattern recognition is a sub-topic of machine learning. PR is the science that concerns the description.
Location-based Social Networks 6/11/20161 CENG 770.
Alan Mislove Bimal Viswanath Krishna P. Gummadi Peter Druschel.
GUILLOU Frederic. Outline Introduction Motivations The basic recommendation system First phase : semantic similarities Second phase : communities Application.
Department of Computer and IT Engineering University of Kurdistan Social Network Analysis Communities By: Dr. Alireza Abdollahpouri.
Graph clustering to detect network modules
Groups of vertices and Core-periphery structure
Jon Crowcroft Pan Hui Computer Laboratory University of Cambridge
Community detection in graphs
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
Finding modules on graphs
Presentation transcript:

Network Community Behavior to Infer Human Activities

Activity recognition – Unreliable in noisy environment – Relies on the user’s personal information – Isolated individual – models solely on the sensor data collected at personal scale Socially connected individuals have correlated activity patterns – Two people with strong social connection Share similar behaviour Food selection, transport, sleep pattern Community behaviour

Opportunity to improve the recognition of behaviour/activity – Improve the inference Capture the collective behaviour of the people in community Network community behaviour framework – Considers personal (acc, mic ) – and community scale information – Improve accuracy

Activity Recognition Conventional – At personal scale -Individual Sensing – Gather sensor data and classify – Assumes people operate in social vacuum/isolated Networked Community Behavior (NCB) – Community Sensing – Personal as well as community scale data – Identify communities with co-related behaviour – Improve accuracy by using hints

Behaviour Modelling

Community behaviour – Correlation among behavioural patterns are strongest With strong social tie – Sleep pattern, transportation habit Community Behaviour in Daily Life

Community behaviour Key idea: Within community, people respond similarly – Given similar context and situation – Adopt the behaviour of others – Both ways How group of (similar) people commute – Similar weather, traffic condition People exchange information – Change their previous behaviour – Homophily

Explore dataset Mobile sensing dataset Captures – sleep duration (4 duration categories) – and transportation mode (car, bus, subway, walk) Tests strongly connected people tend to have more correlated pattern Social links----participant co-location and trajectory similarity Compute correlation – Jaccard coefficient

Personal Sensing Linked with Community Behaviour Car, bus, subway, walk 21 days, 27 participant 51 participant, 90 days Co-location and trajectory similarity Bottom 20% Exploit the additional community scale information to recognize activities Specially when individual sensor data is noisy Observations from socially connected individual can provide signal

Personal Sensing as well as community-scale sensing Robust Two key phases Networked Community Behaviour Framework Hierarchical Network –connects personal and community Networked Community Behaviour Learning Trains classifiers and Performs collective inference

NCB Framework Personal scaleCommunity scale

Hierarchical network Personal scaleCommunity scale Common trajectories And locations

Collective inference Personal scaleCommunity scale Two types of classifier Make weak decisions

Hierarchical NCB Network Bottom layer: Personal Sensing Layer Node represents activities + feature (attribute) Links two layers Attribute : sensor data+ ground truth + soft decision Node+ node attribute Top layer: Community scale relationship

Hierarchical NCB Network Personal Sensing Layer=>conventional approach -Bottom Layer -Sensor data framed and features are extracted -Acc, audio, gps -Activity Node Representation -Each activity – one node -How to represent activities? -Sleep/mood -Frequent events (walk), count

Hierarchical NCB Network Community Behaviour Layer Three stage process -Mining Social Network Graph -Identify social ties -Discover Communities -Newman Girvan Algorithm -Edge-betweenness centrality -Community Feature Extraction

Mining social network Social ties – Co-location, user trajectories – GPS, Wifi data What is co-location? – 30 meters-10 mints Compute weight

Community Identification Algorithms Hierarchical Hierarchical Girvan-Newman Girvan-Newman Radicchi et al. Radicchi et al. Spectral Bisection Spectral Bisection Clique percolation Clique percolation Louvain Louvain ………?? ………?? How to measure the quality of a community partition?

Modularity Modularity measures the group interactions compared with the expected random connections in the group In a network with m edges, for two nodes with degree d i and d j, expected random connections between them are The interaction utility in a group: Modularity Expected Number of edges between 6 and 9 is 5*3/(2*17) = 15/34 Expected Number of edges between 6 and 9 is 5*3/(2*17) = 15/34 19

Community Detection Algorithm Divisive Method: Newman-Girvan – Calculate the edge betweenness for all edges in the network. – Remove the edge with the highest betweenness. – Recalculate betweennesses for all edges affected by the removal. – Repeat until no edges remain.

Divisive Method: Newman- Girvan – Edge betweenness – betweenness(e ij ) = number of times e ij appears in all shortest paths – High betweenness edges are more “central” Community Detection Algorithm

In Execution 0 cuts100 cuts 500 cuts120 cuts

Community Detection Illustration of community detection using dendrogram Modularity Modularity maximization

Networked Community Behaviour Learning Personal Sensing Classifier -Data observed from individual users (personal sensing layer) -Classifier trained with a different dataset – sensor data features are labelled by hand with ground truth -Classification based on the (unlabelled) data gathered from personal sensing Layer -Applied to new activity node – produces a vector of soft decision -Confidence value Two step process S-1: NCB trains two classifiers using personal and community scale Information Expose soft decisions S-2 Collective inference using Relaxation-Labeling Uses network weight and classifier output => final inference

Networked Community Behaviour Learning Community Behaviour Classifier Makes soft inference for activity nodes Classification is done based on aggregated feature Operates on combination User node attribute Soft decision vectors from the activity nodes of the network neighbourhood

Network neighbourhood Dictates which activity and user nodes will generate feature for Community Behaviour Classifier Determined by the user node – Who generates the data Neighbourhood : All adjacent nodes + active nodes

Networked Community Behaviour Learning Community Behaviour Classifier -Classification is done based on aggregated feature -Network neighbourhood -Aggregated neighbourhood feature vector -Community features (structural metrics) -Soft-decision vectors -Classification-user node=>activity classes of user’s activity nodes -Based on strong social ties -Belong to communities that have correlated behaviour between members for this activity

NCB Framework Personal scaleCommunity scale

Community Behaviour Collective Inference Relaxation-Labeling

Evaluation Datasets Benchmark – classifier – Single-classifier

Evaluation Classifier performance comparison Both uses same underlying feature, training data, classifier design. Gain is due to crowdsourcing Average accuracy

Evaluation Classifier performance comparison CDF of per person average classification accuracy X-axis=>fraction of users having accuracy < p Curves shifted bottom right Large fraction of population Experiences high accuracy

Evaluation Performance Gains Based on correlative pattern

Evaluation Performance Gains NCB performs better in the noisy env.