Multidimensional Network Analysis Foundations of multidimensional Network Analysis, Berlingerio, Coscia, Giannotti, Monreale, Pedreschi. WWW Journal 2012.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Xiaowei Ying Xintao Wu Univ. of North Carolina at Charlotte 2009 SIAM Conference on Data Mining, May 1, Sparks, Nevada Graph Generation with Prescribed.
Inspection Planning for Sensor Coverage of 3d Marine Structures Brendan Englot and Franz Hover Presented by Arvind Pereira for the CS599 Class on Sequential.
Communities in Heterogeneous Networks Chapter 4 1 Chapter 4, Community Detection and Mining in Social Media. Lei Tang and Huan Liu, Morgan & Claypool,
Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.
CONTENT BASED FACE RECOGNITION Ankur Jain 01D05007 Pranshu Sharma Prashant Baronia 01D05005 Swapnil Zarekar 01D05001 Under the guidance of Prof.
Fitting models to data. Step 5) Express the relationships mathematically in equations Step 6)Get values of parameters Determine what type of model you.
Social Network Analysis: Tasks and Tools Steven Loscalzo and Lei Yu Department of Computer Science Watson School of Engineering and Applied Science State.
PageRank Identifying key users in social networks Student : Ivan Todorović, 3231/2014 Mentor : Prof. Dr Veljko Milutinović.
Graph Essentials Social Media Mining. 2 Measures and Metrics 2 Social Media Mining Graph Essentials Networks A network is a graph. – Elements of the network.
Social Media Mining Graph Essentials.
CHAMELEON : A Hierarchical Clustering Algorithm Using Dynamic Modeling
Research Meeting Seungseok Kang Center for E-Business Technology Seoul National University Seoul, Korea.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
«Tag-based Social Interest Discovery» Proceedings of the 17th International World Wide Web Conference (WWW2008) Xin Li, Lei Guo, Yihong Zhao Yahoo! Inc.,
Multi-dimensional Queries in P2P Systems. Applications Photo-sharing (photographs tagged with metadata) Multi-player online games (locate objects and.
DEMON A Local-first Discovery Method For Overlapping Communities Giulio Rossetti 2,1,Michele Coscia 3, Fosca Giannotti 2, Dino Pedreschi 2,1 1 Computer.
Anomalous Node Detection in Time Series of Mobile Communication Graphs Leman Akoglu January 28, 2010.
MapReduce and Graph Data Chapter 5 Based on slides from Jimmy Lin’s lecture slides ( (licensed.
Data Mining and Machine Learning Lab Network Denoising in Social Media Huiji Gao, Xufei Wang, Jiliang Tang, and Huan Liu Data Mining and Machine Learning.
Introduction to tensor, tensor factorization and its applications
Predicting Content Change On The Web BY : HITESH SONPURE GUIDED BY : PROF. M. WANJARI.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt,
A Scalable Self-organizing Map Algorithm for Textual Classification: A Neural Network Approach to Thesaurus Generation Dmitri G. Roussinov Department of.
Page 1 Ming Ji Department of Computer Science University of Illinois at Urbana-Champaign.
Special Topics in Educational Data Mining HUDK5199 Spring 2013 March 25, 2012.
Attributed Visualization of Collaborative Workspaces Mao Lin Huang, Quang Vinh Nguyen and Tom Hintz Faculty of Information Technology University of Technology,
Lecture 13: Network centrality Slides are modified from Lada Adamic.
Copyright © 2012, SAS Institute Inc. All rights reserved. ANALYTICS IN BIG DATA ERA ANALYTICS TECHNOLOGY AND ARCHITECTURE TO MANAGE VELOCITY AND VARIETY,
Semantic Wordfication of Document Collections Presenter: Yingyu Wu.
Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.
Social Networks. 2 A social network is a social structure made up of individuals or organizations (called "nodes“), which are tied (connected) by one.
CMU SCS KDD '09Faloutsos, Miller, Tsourakakis P5-1 Large Graph Mining: Power Tools and a Practitioner’s guide Task 5: Graphs over time & tensors Faloutsos,
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
COMMUNITY DISCOVERY PART 1: A (BRIEF) INTRODUCTION Giulio Rossetti WMA - 4 May 2015.
Comparison of Tarry’s Algorithm and Awerbuch’s Algorithm CS 6/73201 Advanced Operating System Presentation by: Sanjitkumar Patel.
Core Methods in Educational Data Mining HUDK4050 Fall 2015.
Recuperação de Informação B Cap. 02: Modeling (Latent Semantic Indexing & Neural Network Model) 2.7.2, September 27, 1999.
PhD Thesis Proposal Evolution in Social Networks Candidate Giulio Rossetti Supervisor Dino Pedreschi Supervisor Fosca Giannotti Pisa, Computer Science.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Multiplication Find the missing value x __ = 32.
 DM-Group Meeting Liangzhe Chen, Oct Papers to be present  RSC: Mining and Modeling Temporal Activity in Social Media  KDD’15  A. F. Costa,
Large Graph Mining: Power Tools and a Practitioner’s guide
Zhu Han University of Houston Thanks for Dr. Hung Nguyen’s Slides
Graphs.
CSE 2331/5331 Topic 9: Basic Graph Alg.
DEMON A Local-first Discovery Method For Overlapping Communities
Random walks on complex networks
Core Methods in Educational Data Mining
Edge Weight Prediction in Weighted Signed Networks
Latent Semantic Indexing
Associative Query Answering via Query Feature Similarity
Data Mining Cluster Analysis: Advanced Concepts and Algorithms
The Basic of Measurement
Analyzing and Securing Social Networks
#VisualHashtags Visual Summarization of Social Media Events using Mid-Level Visual Elements Sonal Goel (IIIT-Delhi), Sarthak Ahuja (IBM Research, India),
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Graphs.
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Asymmetric Transitivity Preserving Graph Embedding
Visualization of Content Information in Networks using GlyphNet
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
Graph and Link Mining.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Topological Signatures For Fast Mobility Analysis
Recuperação de Informação B
Discovering Important Nodes through Graph Entropy
HW 3 (Due Wednesday Feb 6) Create slide(s) for your 1 minute presentation on a graph theory application. Make sure your slide(s) include (1) Define the.
Sanguthevar Rajasekaran University of Connecticut
Presentation transcript:

Multidimensional Network Analysis Foundations of multidimensional Network Analysis, Berlingerio, Coscia, Giannotti, Monreale, Pedreschi. WWW Journal 2012

Classical Network Representation Only one kind of relation Different connections indistinguishable

Multidimensionality as different types (or different values)

Real world examples

Possible Models Tensors For each dimension we define a new matrix Complex in space and time, first framework are being studied Cfr. T. G. Kolda and B. W. Bader. Tensor Decompositions and Applications. SIAM Review 51(3): , September Multigraphs Multiple different relations among entities Misses some analytical powers of tensor decomposition Extension of some graph mining algorithms Cfr. Foundations of multidimensional Network Analysis, Berlingerio, Coscia, Giannotti, Monreale, Pedreschi. ASONAM 2011.

Extending the monodimensional settings Is it possible to generalize known measures (i.e. degree?) Are there novel measures meaningful only in the multidimensional setting?

Relevance of a dimension for a node Intuition: Twitter dimension for User5 should be low, Flickr dimension for User4 should be high

Generalizing the Degree Degree = 8 Neighbors = 4

Neighbor XOR XOR(4, Flickr) = 2 XOR(4, Faceb) = 0 XOR(4, Linkedin) = 0 XOR(7, Flickr) = 1 XOR(7, Faceb) = 0 XOR(7, Linkedin) = 0

Dimension Relevance DR(4, Flickr) = 1 DR(4, Faceb) = 0 DR(4, Linkedin) =.25 DR(7, Flickr) = 1 DR(7, Faceb) = 0 DR(7, Linkedin) =.5 DR(2,Flickr) =.5 DR(2,Faceb) = 1 DR(2, Linkedin) =.5

Weighted Dimension Relevance W(4, Flickr) =.6875 W(4, Faceb) = 0 W(4, Linkedin) =.0625 Captures number of neighbors reachable through D, weighted by the number of alternative connections.

Conclusions The extension of basic statistics in multidimensional network may lead to a novel analytical power We started to unveil this analytical power We show possible applications in more general research settings Other work on this topic: Link prediction Strength of the tie