Latent Space Model for Road Networks to Predict Time-Varying Traffic. Presented by: Rob Fitzgerald Spring 2017
|
|
- Jasmine Ross
- 5 years ago
- Views:
Transcription
1 Latent Space Model for Road Networks to Predict Time-Varying Traffic Presented by: Rob Fitzgerald Spring 2017
2
3 Definition of Latent
4 Latent Space Model? Is this what they were referring to?
5 Introduction The traffic prediction problem aims to find the future link flows based on historical flow data and some observations of the current network state Applications include traffic warning systems, route guidance systems, emergency planning systems, and network design Online applications require fast and correct solutions
6 Introduction Traffic prediction solutions require many iterations over massive networks Flows are not independent Driver behavior is very difficult to model
7 Introduction 1. Can we take a predictive technique which has been successfully applied to social media, and apply it to the traffic prediction problem? 2. Can we produce a solution to traffic prediction which is less computationally demanding than leading techniques such as HMM and SGD?
8 Latent Space Model Latent Models find emergent topics that associate observations Social networks Find consumer trends Track disease transmission Sentiment analysis
9 Latent Space Model Paper proposes Latent Space Modeling for Road Networks (LSM-RN) Group vertices of a road network graph Match pairs of vertices which are similar Traffic behavior Road network topology Embed matched pair in a latent space Use these latent spaces to make traffic prediction
10 Latent Space Model Differences between social networks and road networks Spatial and temporal correlations between neighbors on road networks are not present in social networks Road networks are fast to evolve as traffic conditions vary on a short time scale; people in social networks tend to evolve smoothly Road networks require dynamic updates to the network links, whereas social network links are relatively static We have relatively instantaneous validation of our prediction in road networks - short time between prediction and the ground truth
11 Latent Space Model LSM-RN avoids pure global learning Iterative multiplicative methods for model convergence Not practical for real-time traffic prediction LSM-RN has incremental online learning approach Feedback-based Instead of a single vertex update per round, multiple vertices can be predicted and leverages both global and incremental Balance between accuracy and efficiency Long-term global learning batches Short-term incremental learning
12 Latent Space Model Road Networks have Sparse data Strongly correlated vertices - temporal and spatial The need to model time variance LSM-RN uses Non-negative Matrix Factorization (NMF) for latent space learning Traditional global multiplicative algorithm Topology-aware incremental algorithm Updates vertices with topology constraints Based on adjacency matrix graph representation
13 Latent Space Model
14 Latent Space Model Loss function only defined on edges with observed readings Sparse network data results in missing values LSM-RN applies a graph Laplacian constraint for smoothing Defined as L = D - W where W is a graph proximity matrix D is a diagonal matrix Traffic model with Laplacian constraint:
15 Latent Space Model
16 Latent Space Model
17 Latent Space Model
18 Latent Space Model
19 Latent Space Model
20 Experimental Results
21 Experimental Results Experiments on loop sensor network (15,000 sensors, 3420 miles) From March and April million records LARGE and SMALL subgraphs of Los Angeles SMALL LARGE Vertices Edges Sensors
22 Experimental Results
23 Experimental Results
24 Experimental Results
25 Experimental Results Scalability
26 Experimental Results Additional Experiments Effect of varying algorithm parameters and discussion Convergence rate
Latent Space Model for Road Networks to Predict Time-Varying Traffic
Latent Space Model for Road Networks to Predict Time-Varying Traffic Dingxiong Deng 1, Cyrus Shahabi 1, Ugur Demiryurek 1, Linhong Zhu 2,RoseYu 1, Yan Liu 1 Department of Computer Science, University of
More informationDiffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting
Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting Yaguang Li Joint work with Rose Yu, Cyrus Shahabi, Yan Liu Page 1 Introduction Traffic congesting is wasteful of time,
More informationDatabase and Knowledge-Base Systems: Data Mining. Martin Ester
Database and Knowledge-Base Systems: Data Mining Martin Ester Simon Fraser University School of Computing Science Graduate Course Spring 2006 CMPT 843, SFU, Martin Ester, 1-06 1 Introduction [Fayyad, Piatetsky-Shapiro
More informationSocial Network Analysis
Social Network Analysis Mathematics of Networks Manar Mohaisen Department of EEC Engineering Adjacency matrix Network types Edge list Adjacency list Graph representation 2 Adjacency matrix Adjacency matrix
More informationTriRank: Review-aware Explainable Recommendation by Modeling Aspects
TriRank: Review-aware Explainable Recommendation by Modeling Aspects Xiangnan He, Tao Chen, Min-Yen Kan, Xiao Chen National University of Singapore Presented by Xiangnan He CIKM 15, Melbourne, Australia
More informationCommunity Detection. Community
Community Detection Community In social sciences: Community is formed by individuals such that those within a group interact with each other more frequently than with those outside the group a.k.a. group,
More informationDocument Information
Horizon 2020 Framework Programme Grant Agreement: 732328 FashionBrain Document Information Deliverable number: D5.3 Deliverable title: Early Demo for Trend Prediction Deliverable description: This early
More informationCommunity Preserving Network Embedding
Community Preserving Network Embedding Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, Shiqiang Yang Presented by: Ben, Ashwati, SK What is Network Embedding 1. Representation of a node in an m-dimensional
More informationAnalysis and Mapping of Sparse Matrix Computations
Analysis and Mapping of Sparse Matrix Computations Nadya Bliss & Sanjeev Mohindra Varun Aggarwal & Una-May O Reilly MIT Computer Science and AI Laboratory September 19th, 2007 HPEC2007-1 This work is sponsored
More informationHarp-DAAL for High Performance Big Data Computing
Harp-DAAL for High Performance Big Data Computing Large-scale data analytics is revolutionizing many business and scientific domains. Easy-touse scalable parallel techniques are necessary to process big
More informationComputational Design. Stelian Coros
Computational Design Stelian Coros Schedule for presentations February 3 5 10 12 17 19 24 26 March 3 5 10 12 17 19 24 26 30 April 2 7 9 14 16 21 23 28 30 Send me: ASAP: 3 choices for dates + approximate
More informationMeta-path based Multi-Network Collective Link Prediction
Meta-path based Multi-Network Collective Link Prediction Jiawei Zhang 1,2, Philip S. Yu 1, Zhi-Hua Zhou 2 University of Illinois at Chicago 2, Nanjing University 2 Traditional social link prediction in
More information08 An Introduction to Dense Continuous Robotic Mapping
NAVARCH/EECS 568, ROB 530 - Winter 2018 08 An Introduction to Dense Continuous Robotic Mapping Maani Ghaffari March 14, 2018 Previously: Occupancy Grid Maps Pose SLAM graph and its associated dense occupancy
More informationContext-Aware Vehicular Cyber-Physical Systems with Cloud Support: Architecture, Challenges, and Solutions
Context-Aware Vehicular Cyber-Physical Systems with Cloud Support: Architecture, Challenges, and Solutions Siran Pavankumar(149344152) siranpavankumar@gmail.com Computer Science Department Seoul National
More informationSampling Large Graphs for Anticipatory Analysis
Sampling Large Graphs for Anticipatory Analysis Lauren Edwards*, Luke Johnson, Maja Milosavljevic, Vijay Gadepally, Benjamin A. Miller IEEE High Performance Extreme Computing Conference September 16, 2015
More informationSTREAMING RANKING BASED RECOMMENDER SYSTEMS
STREAMING RANKING BASED RECOMMENDER SYSTEMS Weiqing Wang, Hongzhi Yin, Zi Huang, Qinyong Wang, Xingzhong Du, Quoc Viet Hung Nguyen University of Queensland, Australia & Griffith University, Australia July
More informationChallenges in large-scale graph processing on HPC platforms and the Graph500 benchmark. by Nkemdirim Dockery
Challenges in large-scale graph processing on HPC platforms and the Graph500 benchmark by Nkemdirim Dockery High Performance Computing Workloads Core-memory sized Floating point intensive Well-structured
More informationTemporal Graphs KRISHNAN PANAMALAI MURALI
Temporal Graphs KRISHNAN PANAMALAI MURALI METRICFORENSICS: A Multi-Level Approach for Mining Volatile Graphs Authors: Henderson, Eliassi-Rad, Faloutsos, Akoglu, Li, Maruhashi, Prakash and Tong. Published:
More informationNetwork visualization techniques and evaluation
Network visualization techniques and evaluation The Charlotte Visualization Center University of North Carolina, Charlotte March 15th 2007 Outline 1 Definition and motivation of Infovis 2 3 4 Outline 1
More informationExtracting Information from Complex Networks
Extracting Information from Complex Networks 1 Complex Networks Networks that arise from modeling complex systems: relationships Social networks Biological networks Distinguish from random networks uniform
More informationDistributed Agent-Based Intrusion Detection for the Smart Grid
Distributed Agent-Based Intrusion Detection for the Smart Grid Presenter: Esther M. Amullen January 19, 2018 Introduction The smart-grid can be viewed as a Large-Scale Networked Control System (LSNCS).
More informationScalable Object Classification using Range Images
Scalable Object Classification using Range Images Eunyoung Kim and Gerard Medioni Institute for Robotics and Intelligent Systems University of Southern California 1 What is a Range Image? Depth measurement
More informationClusters and Communities
Clusters and Communities Lecture 7 CSCI 4974/6971 22 Sep 2016 1 / 14 Today s Biz 1. Reminders 2. Review 3. Communities 4. Betweenness and Graph Partitioning 5. Label Propagation 2 / 14 Today s Biz 1. Reminders
More informationNonparametric Importance Sampling for Big Data
Nonparametric Importance Sampling for Big Data Abigael C. Nachtsheim Research Training Group Spring 2018 Advisor: Dr. Stufken SCHOOL OF MATHEMATICAL AND STATISTICAL SCIENCES Motivation Goal: build a model
More informationCSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Graphs Origins Definition Spectral Properties Type of
More informationBruno Martins. 1 st Semester 2012/2013
Link Analysis Departamento de Engenharia Informática Instituto Superior Técnico 1 st Semester 2012/2013 Slides baseados nos slides oficiais do livro Mining the Web c Soumen Chakrabarti. Outline 1 2 3 4
More informationAutomatic Scaling Iterative Computations. Aug. 7 th, 2012
Automatic Scaling Iterative Computations Guozhang Wang Cornell University Aug. 7 th, 2012 1 What are Non-Iterative Computations? Non-iterative computation flow Directed Acyclic Examples Batch style analytics
More informationRecommender Systems New Approaches with Netflix Dataset
Recommender Systems New Approaches with Netflix Dataset Robert Bell Yehuda Koren AT&T Labs ICDM 2007 Presented by Matt Rodriguez Outline Overview of Recommender System Approaches which are Content based
More informationCitizen Sensing: Opportunities and Challenges in Mining Social Signals and Perceptions
Wright State University CORE Scholar Kno.e.sis Publications The Ohio Center of Excellence in Knowledge- Enabled Computing (Kno.e.sis) 7-19-2011 Citizen Sensing: Opportunities and Challenges in Mining Social
More informationReddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011
Reddit Recommendation System Daniel Poon, Yu Wu, David (Qifan) Zhang CS229, Stanford University December 11 th, 2011 1. Introduction Reddit is one of the most popular online social news websites with millions
More informationProblem Definition. Clustering nonlinearly separable data:
Outlines Weighted Graph Cuts without Eigenvectors: A Multilevel Approach (PAMI 2007) User-Guided Large Attributed Graph Clustering with Multiple Sparse Annotations (PAKDD 2016) Problem Definition Clustering
More informationLatent Variable Models for Structured Prediction and Content-Based Retrieval
Latent Variable Models for Structured Prediction and Content-Based Retrieval Ariadna Quattoni Universitat Politècnica de Catalunya Joint work with Borja Balle, Xavier Carreras, Adrià Recasens, Antonio
More informationCS249: ADVANCED DATA MINING
CS249: ADVANCED DATA MINING Recommender Systems II Instructor: Yizhou Sun yzsun@cs.ucla.edu May 31, 2017 Recommender Systems Recommendation via Information Network Analysis Hybrid Collaborative Filtering
More informationDistributed Consensus in Multivehicle Cooperative Control: Theory and Applications
Distributed Consensus in Multivehicle Cooperative Control: Theory and Applications Wei Ren and Randal W. Beard Springer ISBN: 978-1-84800-014-8 Tutorial Slides Prepared by Wei Ren Department of Electrical
More informationTrajStore: an Adaptive Storage System for Very Large Trajectory Data Sets
TrajStore: an Adaptive Storage System for Very Large Trajectory Data Sets Philippe Cudré-Mauroux Eugene Wu Samuel Madden Computer Science and Artificial Intelligence Laboratory Massachusetts Institute
More informationInf 496/596 Topics in Informatics: Analysis of Social Network Data
Inf 496/596 Topics in Informatics: Analysis of Social Network Data Jagdish S. Gangolly Department of Informatics College of Computing & Information State University of New York at Albany Lecture 1B (Graphs)
More informationGraphs. Tessema M. Mengistu Department of Computer Science Southern Illinois University Carbondale Room - Faner 3131
Graphs Tessema M. Mengistu Department of Computer Science Southern Illinois University Carbondale tessema.mengistu@siu.edu Room - Faner 3131 1 Outline Introduction to Graphs Graph Traversals Finding a
More informationParallel Greedy Matching Algorithms
Parallel Greedy Matching Algorithms Fredrik Manne Department of Informatics University of Bergen, Norway Rob Bisseling, University of Utrecht Md. Mostofa Patwary, University of Bergen 1 Outline Background
More informationApplying Supervised Learning
Applying Supervised Learning When to Consider Supervised Learning A supervised learning algorithm takes a known set of input data (the training set) and known responses to the data (output), and trains
More informationTelling Experts from Spammers Expertise Ranking in Folksonomies
32 nd Annual ACM SIGIR 09 Boston, USA, Jul 19-23 2009 Telling Experts from Spammers Expertise Ranking in Folksonomies Michael G. Noll (Albert) Ching-Man Au Yeung Christoph Meinel Nicholas Gibbins Nigel
More informationg2o: A General Framework for Graph Optimization Rainer Kümmerle Giorgio Grisetti Hauke Strasdat Kurt Konolige Wolfram Burgard
g2o: A General Framework for Graph Optimization Rainer Kümmerle Giorgio Grisetti Hauke Strasdat Kurt Konolige Wolfram Burgard Graph-Based SLAM Constraints connect the poses of the robot while it is moving
More informationICRA 2016 Tutorial on SLAM. Graph-Based SLAM and Sparsity. Cyrill Stachniss
ICRA 2016 Tutorial on SLAM Graph-Based SLAM and Sparsity Cyrill Stachniss 1 Graph-Based SLAM?? 2 Graph-Based SLAM?? SLAM = simultaneous localization and mapping 3 Graph-Based SLAM?? SLAM = simultaneous
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationRandomized Algorithms
Randomized Algorithms Last time Network topologies Intro to MPI Matrix-matrix multiplication Today MPI I/O Randomized Algorithms Parallel k-select Graph coloring Assignment 2 Parallel I/O Goal of Parallel
More informationGraph Exploitation Testbed
Graph Exploitation Testbed Peter Jones and Eric Robinson Graph Exploitation Symposium April 18, 2012 This work was sponsored by the Office of Naval Research under Air Force Contract FA8721-05-C-0002. Opinions,
More informationA POWER CHARACTERIZATION AND MANAGEMENT OF GPU GRAPH TRAVERSAL
A POWER CHARACTERIZATION AND MANAGEMENT OF GPU GRAPH TRAVERSAL ADAM MCLAUGHLIN *, INDRANI PAUL, JOSEPH GREATHOUSE, SRILATHA MANNE, AND SUDHKAHAR YALAMANCHILI * * GEORGIA INSTITUTE OF TECHNOLOGY AMD RESEARCH
More informationCSCI5070 Advanced Topics in Social Computing
CSCI5070 Advanced Topics in Social Computing Irwin King The Chinese University of Hong Kong king@cse.cuhk.edu.hk!! 2012 All Rights Reserved. Outline Scale-Free Networks Generation Properties Analysis Dynamic
More informationFROM SPACE TO PLACE: PREDICTING USERS INTENTIONS TO RETURN TO VIRTUAL WORLDS 1
SPECIAL ISSUE FROM SPACE TO PLACE: PREDICTING USERS INTENTIONS TO RETURN TO VIRTUAL WORLDS 1 Lakshmi Goel Coggin College of Business, University of North Florida, 1UNF Drive, Jacksonville, FL 32224 U.S.A.
More informationStatistical Physics of Community Detection
Statistical Physics of Community Detection Keegan Go (keegango), Kenji Hata (khata) December 8, 2015 1 Introduction Community detection is a key problem in network science. Identifying communities, defined
More informationContent-based Dimensionality Reduction for Recommender Systems
Content-based Dimensionality Reduction for Recommender Systems Panagiotis Symeonidis Aristotle University, Department of Informatics, Thessaloniki 54124, Greece symeon@csd.auth.gr Abstract. Recommender
More informationIntroduction to Data Science Lecture 8 Unsupervised Learning. CS 194 Fall 2015 John Canny
Introduction to Data Science Lecture 8 Unsupervised Learning CS 194 Fall 2015 John Canny Outline Unsupervised Learning K-Means clustering DBSCAN Matrix Factorization Performance Machine Learning Supervised:
More informationTCP Spatial-Temporal Measurement and Analysis
TCP Spatial-Temporal Measurement and Analysis Infocom 05 E. Brosh Distributed Network Analysis (DNA) Group Columbia University G. Lubetzky-Sharon, Y. Shavitt Tel-Aviv University 1 Overview Inferring network
More informationMINI-PAPER A Gentle Introduction to the Analysis of Sequential Data
MINI-PAPER by Rong Pan, Ph.D., Assistant Professor of Industrial Engineering, Arizona State University We, applied statisticians and manufacturing engineers, often need to deal with sequential data, which
More informationMinghai Liu, Rui Cai, Ming Zhang, and Lei Zhang. Microsoft Research, Asia School of EECS, Peking University
Minghai Liu, Rui Cai, Ming Zhang, and Lei Zhang Microsoft Research, Asia School of EECS, Peking University Ordering Policies for Web Crawling Ordering policy To prioritize the URLs in a crawling queue
More informationLocal Community Detection in Dynamic Graphs Using Personalized Centrality
algorithms Article Local Community Detection in Dynamic Graphs Using Personalized Centrality Eisha Nathan, Anita Zakrzewska, Jason Riedy and David A. Bader * School of Computational Science and Engineering,
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationOnline Bad Data Detection for Synchrophasor Systems via Spatio-temporal Correlations
LOGO Online Bad Data Detection for Synchrophasor Systems via Spatio-temporal s Le Xie Texas A&M University NASPI International Synchrophasor Symposium March 24, 2016 Content 1 Introduction 2 Technical
More informationReal-Time Model-Free Detection of Low-Quality Synchrophasor Data
Real-Time Model-Free Detection of Low-Quality Synchrophasor Data Meng Wu and Le Xie Department of Electrical and Computer Engineering Texas A&M University College Station, TX NASPI Work Group meeting March
More informationLeast Squares and SLAM Pose-SLAM
Least Squares and SLAM Pose-SLAM Giorgio Grisetti Part of the material of this course is taken from the Robotics 2 lectures given by G.Grisetti, W.Burgard, C.Stachniss, K.Arras, D. Tipaldi and M.Bennewitz
More informationDeepWalk: Online Learning of Social Representations
DeepWalk: Online Learning of Social Representations ACM SIG-KDD August 26, 2014, Rami Al-Rfou, Steven Skiena Stony Brook University Outline Introduction: Graphs as Features Language Modeling DeepWalk Evaluation:
More informationPULP: Fast and Simple Complex Network Partitioning
PULP: Fast and Simple Complex Network Partitioning George Slota #,* Kamesh Madduri # Siva Rajamanickam * # The Pennsylvania State University *Sandia National Laboratories Dagstuhl Seminar 14461 November
More informationCentralities (4) By: Ralucca Gera, NPS. Excellence Through Knowledge
Centralities (4) By: Ralucca Gera, NPS Excellence Through Knowledge Some slide from last week that we didn t talk about in class: 2 PageRank algorithm Eigenvector centrality: i s Rank score is the sum
More informationGraph Algorithms. Parallel and Distributed Computing. Department of Computer Science and Engineering (DEI) Instituto Superior Técnico.
Graph Algorithms Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico May, 0 CPD (DEI / IST) Parallel and Distributed Computing 0-0-0 / Outline
More informationHitachi Visualization Predictive Crime Analytics
Hitachi Visualization Predictive Crime Analytics Creating Safe Cities - The Problem Public safety budgets are tightening Violent crimes e.g., assault are increasing in many cities along with the shifting
More informationConvolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering May 12 2017 2 Content 1. Introduction 2. Proposed Technique 2.1 Learning Fast Localized Spectral Filters 2.2 Graph Coarsening
More informationBehavioral Data Mining. Lecture 18 Clustering
Behavioral Data Mining Lecture 18 Clustering Outline Why? Cluster quality K-means Spectral clustering Generative Models Rationale Given a set {X i } for i = 1,,n, a clustering is a partition of the X i
More informationNetwork Lasso: Clustering and Optimization in Large Graphs
Network Lasso: Clustering and Optimization in Large Graphs David Hallac, Jure Leskovec, Stephen Boyd Stanford University September 28, 2015 Convex optimization Convex optimization is everywhere Introduction
More informationEvaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination
Evaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination Richard Kershaw and Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering, Viterbi School
More informationStreaming iphone sensor data to SAS Event Stream Processing
SAS USER FORUM Streaming iphone sensor data to SAS Event Stream Processing Pasi Helenius Senior Advisor SAS Event Stream Processing 3 KEY CHARACTERISTICS Technology Process steams of data events, on the
More informationOPEN-CSAM INFORMATION AGGREGATOR AND REPORTING TOOL USING AI AND NATURAL LANGUAGE PROCESSING
OPEN-CSAM INFORMATION AGGREGATOR AND REPORTING TOOL USING AI AND NATURAL LANGUAGE PROCESSING Georgios Chatzichristos Operational Security Unit - ENISA 6 11 2018 THE GOAL Help Decision Makers take better
More informationStructured prediction using the network perceptron
Structured prediction using the network perceptron Ta-tsen Soong Joint work with Stuart Andrews and Prof. Tony Jebara Motivation A lot of network-structured data Social networks Citation networks Biological
More informationThe Un-normalized Graph p-laplacian based Semi-supervised Learning Method and Speech Recognition Problem
Int. J. Advance Soft Compu. Appl, Vol. 9, No. 1, March 2017 ISSN 2074-8523 The Un-normalized Graph p-laplacian based Semi-supervised Learning Method and Speech Recognition Problem Loc Tran 1 and Linh Tran
More informationFinal report - CS224W: Using Wikipedia pages traffic data to infer pertinence of links
Final report - CS224W: Using Wikipedia pages traffic data to infer pertinence of links Marc Thibault; SUNetID number: 06227968 Mael Trean; SUNetIDnumber: 06228438 I - Introduction/Motivation/Problem Definition
More informationChallenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning
Challenges in Geographic Routing: Sparse Networks, Obstacles, and Traffic Provisioning Brad Karp Berkeley, CA bkarp@icsi.berkeley.edu DIMACS Pervasive Networking Workshop 2 May, 2 Motivating Examples Vast
More informationMIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns
MIDTERM EXAMINATION Networked Life (NETS 112) November 21, 2013 Prof. Michael Kearns This is a closed-book exam. You should have no material on your desk other than the exam itself and a pencil or pen.
More informationImage Interpolation Using Multiscale Geometric Representations
Image Interpolation Using Multiscale Geometric Representations Nickolaus Mueller, Yue Lu and Minh N. Do Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign ABSTRACT
More informationWeighted Alternating Least Squares (WALS) for Movie Recommendations) Drew Hodun SCPD. Abstract
Weighted Alternating Least Squares (WALS) for Movie Recommendations) Drew Hodun SCPD Abstract There are two common main approaches to ML recommender systems, feedback-based systems and content-based systems.
More informationEmpirical Complexity of Laplacian Linear Solvers: Discussion
Empirical Complexity of Laplacian Linear Solvers: Discussion Erik Boman, Sandia National Labs Kevin Deweese, UC Santa Barbara John R. Gilbert, UC Santa Barbara 1 Simons Institute Workshop on Fast Algorithms
More informationAnomaly Detection in Very Large Graphs Modeling and Computational Considerations
Anomaly Detection in Very Large Graphs Modeling and Computational Considerations Benjamin A. Miller, Nicholas Arcolano, Edward M. Rutledge and Matthew C. Schmidt MIT Lincoln Laboratory Nadya T. Bliss ASURE
More informationK-Means and Gaussian Mixture Models
K-Means and Gaussian Mixture Models David Rosenberg New York University June 15, 2015 David Rosenberg (New York University) DS-GA 1003 June 15, 2015 1 / 43 K-Means Clustering Example: Old Faithful Geyser
More informationDS595/CS525: Urban Network Analysis --Urban Mobility Prof. Yanhua Li
Welcome to DS595/CS525: Urban Network Analysis --Urban Mobility Prof. Yanhua Li Time: 6:00pm 8:50pm Wednesday Location: Fuller 320 Spring 2017 2 Team assignment Finalized. (Great!) Guest Speaker 2/22 A
More informationPARALLEL AND DISTRIBUTED PLATFORM FOR PLUG-AND-PLAY AGENT-BASED SIMULATIONS. Wentong CAI
PARALLEL AND DISTRIBUTED PLATFORM FOR PLUG-AND-PLAY AGENT-BASED SIMULATIONS Wentong CAI Parallel & Distributed Computing Centre School of Computer Engineering Nanyang Technological University Singapore
More informationG(B)enchmark GraphBench: Towards a Universal Graph Benchmark. Khaled Ammar M. Tamer Özsu
G(B)enchmark GraphBench: Towards a Universal Graph Benchmark Khaled Ammar M. Tamer Özsu Bioinformatics Software Engineering Social Network Gene Co-expression Protein Structure Program Flow Big Graphs o
More informationPrinciples of Wireless Sensor Networks. Fast-Lipschitz Optimization
http://www.ee.kth.se/~carlofi/teaching/pwsn-2011/wsn_course.shtml Lecture 5 Stockholm, October 14, 2011 Fast-Lipschitz Optimization Royal Institute of Technology - KTH Stockholm, Sweden e-mail: carlofi@kth.se
More informationNew Trends in Database Systems
New Trends in Database Systems Ahmed Eldawy 9/29/2016 1 Spatial and Spatio-temporal data 9/29/2016 2 What is spatial data Geographical data Medical images 9/29/2016 Astronomical data Trajectories 3 Application
More informationMining Web Data. Lijun Zhang
Mining Web Data Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Introduction Web Crawling and Resource Discovery Search Engine Indexing and Query Processing Ranking Algorithms Recommender Systems
More informationvolley: automated data placement for geo-distributed cloud services
volley: automated data placement for geo-distributed cloud services sharad agarwal, john dunagan, navendu jain, stefan saroiu, alec wolman, harbinder bhogan very rapid pace of datacenter rollout April
More informationSpatial Interpolation & Geostatistics
(Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Lag Mean Distance between pairs of points 1 Tobler s Law All places are related, but nearby places are related more than distant places Corollary:
More informationFemto-Matching: Efficient Traffic Offloading in Heterogeneous Cellular Networks
Femto-Matching: Efficient Traffic Offloading in Heterogeneous Cellular Networks Wei Wang, Xiaobing Wu, Lei Xie and Sanglu Lu Nanjing University April 28, 2015 1/1 Heterogeneous Cellular Networks femto-cell
More informationA Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection
A Fault-Tolerant P2P-based Protocol for Logical Networks Interconnection Jaime Lloret 1, Juan R. Diaz 2, Fernando Boronat 3 and Jose M. Jiménez 4 Department of Communications, Polytechnic University of
More informationCS 5220: Parallel Graph Algorithms. David Bindel
CS 5220: Parallel Graph Algorithms David Bindel 2017-11-14 1 Graphs Mathematically: G = (V, E) where E V V Convention: V = n and E = m May be directed or undirected May have weights w V : V R or w E :
More informationParallel Gibbs Sampling From Colored Fields to Thin Junction Trees
Parallel Gibbs Sampling From Colored Fields to Thin Junction Trees Joseph Gonzalez Yucheng Low Arthur Gretton Carlos Guestrin Draw Samples Sampling as an Inference Procedure Suppose we wanted to know the
More informationObject Geolocation from Crowdsourced Street Level Imagery
Object Geolocation from Crowdsourced Street Level Imagery Vladimir A. Krylov and Rozenn Dahyot ADAPT Centre, School of Computer Science and Statistics, Trinity College Dublin, Dublin, Ireland {vladimir.krylov,rozenn.dahyot}@tcd.ie
More informationHigh-Throughput Real-Time Network Flow Visualization
High-Throughput Real-Time Network Flow Visualization Daniel Best Research Scientist Information Analytics daniel.best@pnl.gov Douglas Love, Shawn Bohn, William Pike 1 Tools and a Pipeline to Provide Defense
More informationA Work-Efficient GPU Algorithm for Level Set Segmentation. Mike Roberts Jeff Packer Mario Costa Sousa Joseph Ross Mitchell
A Work-Efficient GPU Algorithm for Level Set Segmentation Mike Roberts Jeff Packer Mario Costa Sousa Joseph Ross Mitchell What do I mean by work-efficient? If a parallel algorithm performs asymptotically
More informationCluster Analysis (b) Lijun Zhang
Cluster Analysis (b) Lijun Zhang zlj@nju.edu.cn http://cs.nju.edu.cn/zlj Outline Grid-Based and Density-Based Algorithms Graph-Based Algorithms Non-negative Matrix Factorization Cluster Validation Summary
More informationSpatial Interpolation - Geostatistics 4/3/2018
Spatial Interpolation - Geostatistics 4/3/201 (Z i Z j ) 2 / 2 Spatial Interpolation & Geostatistics Lag Distance between pairs of points Lag Mean Tobler s Law All places are related, but nearby places
More informationScalable Clustering of Signed Networks Using Balance Normalized Cut
Scalable Clustering of Signed Networks Using Balance Normalized Cut Kai-Yang Chiang,, Inderjit S. Dhillon The 21st ACM International Conference on Information and Knowledge Management (CIKM 2012) Oct.
More informationLink Prediction for Social Network
Link Prediction for Social Network Ning Lin Computer Science and Engineering University of California, San Diego Email: nil016@eng.ucsd.edu Abstract Friendship recommendation has become an important issue
More informationModeling Dynamic Behavior in Large Evolving Graphs
Modeling Dynamic Behavior in Large Evolving Graphs R. Rossi, J. Neville, B. Gallagher, and K. Henderson Presented by: Doaa Altarawy 1 Outline - Motivation - Proposed Model - Definitions - Modeling dynamic
More information