Paper Presentation. Steve Jan. March 5, Virginia Tech. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
|
|
- Eustacia McDonald
- 5 years ago
- Views:
Transcription
1 Paper Presentation Steve Jan Virginia Tech March 5, 2015 Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
2 2 paper to present Nonparametric Multi-group Membership Model for Dynamic Networks, NIPS 13, Myunghwan Kim and Jure Leskovec, Stanford Community Detection in Graphs through Correlation, KDD14, Lian Duan, W. Nick Street, Yanchi Liu, Haibing Lu, New Jersey Institute of Technology, Santa Clara University Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
3 Nonparametric Multi-group Membership Model Social networkis often dynamic in a sense that relations between entities rise and decay over time. Problem: extract a summary of the common structure and dynamic of the underlying relations. Applications: Predict missing relationships, forecast future links, identify clusters and groups of nodes Note It uses lots of statistic techniques to solve this problem. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
4 Dynamic Multi-group Membership Graph Model They pay close attention to the three processes governing network dynamics: Birth and death dynamics of individual groups Evolution of memberships of nodes to groups The structure of network interactions between group members as well as non-members. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
5 Birth and death dynamics of individual groups Why do we know when the groups birth and death? It would be more clear that for the number of groups at each specific time. A group can be be in one of two states:{ active (alive) or inactive (not yet born or dead) }. Figure: Blact: active (alive), White: inactive Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
6 Formal Way of Birth and death dynamics of individual groups It uses distance-dependent Indian Buffet Processes (dd-ibp) to model, which is a time-relate stochastic process. Customers enter an Indian Buffet restaurant and sample some subset of an infinitely long sequence of dishes. In this applications, time t would be customers, they samples a set of active groups K t. Formally speacking, at the first time step t = 1, we have Poisson(λ) number of groups that are initially active, i.e., K 1 Poisson(λ). Poisson(γλ) new groups are also born at time t. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
7 Dynamics of node group memberships Intuition: Nodes joining and leaving groups based on their current status.. They further uses Markov chain to model dynamics of nodes joining and leaving groups. They denote each node i of the network is whether belong to community K at time t by a binary variable zik t {0, 1} where, a k, b k are two parameters and probability. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
8 Relationship between node group memberships and links of the network Intuition: Link netween two nodes based on their current groups They assume there is a connection between nodes memberships to groups and the links of the network. They build on the Multiplicative Attribute Graph model: each group k is associated with a link affinity matrix M R 2 2. These four entries represent groups members, members and non-members, as well as non- members themselves. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
9 Model Inference via MCMC After introducing these three models, then they try to sample these parameters. Sampling node group memberships Z: Use forward-backward recursion algorithm. group membership transition matrix Q: Use a conjugate prior of Bernoulli distribution and some posterior distribution. Sampling link affinities M: Use Metropolis-Hastings and Hybrid Monte Carlo (HMC) sampling. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
10 Experiments Datasets they use: NIPS co-authorships network for T = 17 years (1987 to 2003). DBLP co- authorship network is obtained from 21 Computer Science conferences from 2000 to 2009 (T = 10) INFOCOM dataset represents the physical proximity interactions between 78 students at the 2006 INFOCOM conference, T = 50 Tasks they have: Missing link prediction Future network forecasting Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
11 Missing link prediction Randomly hold out 20% of node pairs throughout the entire time period. Naive: Relationship between each pair of nodes is decided by Bernoulli distribution with Beta(1, 1) prior. LFRM: static networks DRIFT: infinite factorial HMM model. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
12 Future network forecasting Given networks from t = 1,..., T, they want to predict the link of t = T + 1. They train the models on first Tobs networks, fix the parameters, and then for each model they run MCMC sampling one time step into the future. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
13 Conclusion We learn three models for time series. How to sampel these parameters Personally I think this paper is good in terms of the statistics methods they use Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
14 Community Detection in Graphs through Correlation Then, we move to the next paper. This paper is about Community Detection, based on Modularity-based. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
15 Major problem of modularity Resolution problem. K m is an m-clique The detected communities are marked by circles with dash lines. Multi-resolution Further divide each detected community Bias: (the tendency to merge small communities and to split large communities, are introduced.) Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
16 Connection with itemset search Graph communities: number of internal edges is greater than expected under assumption of random partition Correlated itemsets: occur more than expected under the assumption of item independence Connection: modularity = leverage Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
17 Correlated Itemsets Given itemset S = {I 1, I 2,..., I m } with m items in a dataset with n transactions True probability: tp s = P(S) Expected probability ep s = m i=1 P(I i) Correlation measure: M s = f (tp s, ep s ) (tp s ep s ) 2 ep s Chi-square: Probability ratio : tp s /ep s Leverage: tp s ep s Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
18 Correlated itemset example t1: Beef, Chicken, Milk t2:beef, Cheese t3: Cheese, Boots t4: Beef, Chicken, Cheese t5: Beef, Chicken, Clothes, Cheese, Milk For the itemset {Beef, Chicken} tp = 3 5, ep = , Leverage = tp ep = 25 Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
19 Modularity Function Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
20 Transforming modularity function For partition {G 1, G 2,..., G l }on graph G k i : degree of node i k internal : number of nodes in the same group of node i that connect to node. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
21 Transforming modularity function Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
22 Transforming modularity function They found that if translating the undirect-graph modulaity to direct-graph one, they can use itemset criteria to represnt moduality. If we randomly select an edge from the doubly-directed graph: The true probability of the edge in G p : tp = Probability the edge started from G p : Probability the edge ended in G p : i Gpk i 2m j Gpk j 2m i Gpk internal i 2m The expected probability of the edge in G p under the assumption of independence: ep = i Gpk i 2m j Gpk j 2m Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
23 Transforming modularity function Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
24 Transforming modularity function Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
25 Transforming modularity function Connecting correlation with modularity For a given partition G p, partial modularity Q p = tp p ep p For a given itemset S, leverage = tp s ep s Since the other correlation measures are also functions of tp and ep, they can change the partial modularity function Q p by using the formula of other correlation measures. Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
26 Experiments Modify the objective function Greedy search (hierarchical clustering) Baseline: Modularity-based methods (Leverage) Datasets: Real life: 1. Karate club( two equal size communities) 2. College football(12 equal size communities) Evaluation measures: Rand Index (Rand1971), Jaccard, F-measure, Normalized mutual information (Danon 2005) Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
27 Real life datasets Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
28 Summary Connection between community detection and correlation search Modularity is good only when there are large and clear communities Likelihood ratio is robust to any type of communities Probability ratio partitions the whole graph into small communities with 2 or 3 objects Steve Jan (Virginia Tech) Paper Presentation March 5, / 28
Coalescence. Outline History. History, Model, and Application. Coalescence. The Model. Application
Coalescence History, Model, and Application Outline History Origins of theory/approach Trace the incorporation of other s ideas Coalescence Definition and descriptions The Model Assumptions and Uses Application
More informationAncestral Recombination Graphs
Ancestral Recombination Graphs Ancestral relationships among a sample of recombining sequences usually cannot be accurately described by just a single genealogy. Linked sites will have similar, but not
More informationCommunity Detection and Labeling Nodes
and Labeling Nodes Hao Chen Department of Statistics, Stanford Jan. 25, 2011 (Department of Statistics, Stanford) Community Detection and Labeling Nodes Jan. 25, 2011 1 / 9 Community Detection - Network:
More informationDepartment of Statistics and Operations Research Undergraduate Programmes
Department of Statistics and Operations Research Undergraduate Programmes OPERATIONS RESEARCH YEAR LEVEL 2 INTRODUCTION TO LINEAR PROGRAMMING SSOA021 Linear Programming Model: Formulation of an LP model;
More informationPopulation Structure and Genealogies
Population Structure and Genealogies One of the key properties of Kingman s coalescent is that each pair of lineages is equally likely to coalesce whenever a coalescent event occurs. This condition is
More informationPopulation Genetics using Trees. Peter Beerli Genome Sciences University of Washington Seattle WA
Population Genetics using Trees Peter Beerli Genome Sciences University of Washington Seattle WA Outline 1. Introduction to the basic coalescent Population models The coalescent Likelihood estimation of
More informationSocial Network Analysis in HCI
Social Network Analysis in HCI Derek L. Hansen and Marc A. Smith Marigold Bays-Muchmore (baysmuc2) Hang Cui (hangcui2) Contents Introduction ---------------- What is Social Network Analysis? How does it
More informationScalable Methods for the Analysis of Network-Based Data
Scalable Methods for the Analysis of Network-Based Data MURI Project: University of California, Irvine Annual Review Meeting December 8 th 2009 Principal Investigator: Padhraic Smyth Today s Meeting Goals
More informationSSB Debate: Model-based Inference vs. Machine Learning
SSB Debate: Model-based nference vs. Machine Learning June 3, 2018 SSB 2018 June 3, 2018 1 / 20 Machine learning in the biological sciences SSB 2018 June 3, 2018 2 / 20 Machine learning in the biological
More informationRomantic Partnerships and the Dispersion of Social Ties
Introduction Embeddedness and Evaluation Combining Features Romantic Partnerships and the of Social Ties Lars Backstrom Jon Kleinberg presented by Yehonatan Cohen 2014-11-12 Introduction Embeddedness and
More informationMarkov Chain Monte Carlo (MCMC)
Markov Chain Monte Carlo (MCMC) Tim Frasier Copyright Tim Frasier This work is licensed under the Creative Commons Attribution 4.0 International license. Click here for more information. What is MCMC?
More informationMore on games (Ch )
More on games (Ch. 5.4-5.6) Alpha-beta pruning Previously on CSci 4511... We talked about how to modify the minimax algorithm to prune only bad searches (i.e. alpha-beta pruning) This rule of checking
More informationStatistical Analysis of Nuel Tournaments Department of Statistics University of California, Berkeley
Statistical Analysis of Nuel Tournaments Department of Statistics University of California, Berkeley MoonSoo Choi Department of Industrial Engineering & Operations Research Under Guidance of Professor.
More informationCS221 Project Final Report Gomoku Game Agent
CS221 Project Final Report Gomoku Game Agent Qiao Tan qtan@stanford.edu Xiaoti Hu xiaotihu@stanford.edu 1 Introduction Gomoku, also know as five-in-a-row, is a strategy board game which is traditionally
More informationGames and Big Data: A Scalable Multi-Dimensional Churn Prediction Model
Games and Big Data: A Scalable Multi-Dimensional Churn Prediction Model Paul Bertens, Anna Guitart and África Periáñez (Silicon Studio) CIG 2017 New York 23rd August 2017 Who are we? Game studio and graphics
More informationSupervisory Control for Cost-Effective Redistribution of Robotic Swarms
Supervisory Control for Cost-Effective Redistribution of Robotic Swarms Ruikun Luo Department of Mechaincal Engineering College of Engineering Carnegie Mellon University Pittsburgh, Pennsylvania 11 Email:
More informationAnalysis of geographically structured populations: Estimators based on coalescence
Analysis of geographically structured populations: Estimators based on coalescence Peter Beerli Department of Genetics, Box 357360, University of Washington, Seattle WA 9895-7360, Email: beerli@genetics.washington.edu
More informationAERONAUTICAL CHANNEL MODELING FOR PACKET NETWORK SIMULATORS
AERONAUTICAL CHANNEL MODELING FOR PACKET NETWORK SIMULATORS Author: Sandarva Khanal Advisor: Dr. Richard A. Dean Department of Electrical and Computer Engineering Morgan State University ABSTRACT The introduction
More informationReport 3. Kalman or Wiener Filters
1 Embedded Systems WS 2014/15 Report 3: Kalman or Wiener Filters Stefan Feilmeier Facultatea de Inginerie Hermann Oberth Master-Program Embedded Systems Advanced Digital Signal Processing Methods Winter
More informationMachine Learning for Computational Sustainability
Machine Learning for Computational Sustainability Tom Dietterich Oregon State University In collaboration with Dan Sheldon, Sean McGregor, Majid Taleghan, Rachel Houtman, Claire Montgomery, Kim Hall, H.
More informationLearning to Play like an Othello Master CS 229 Project Report. Shir Aharon, Amanda Chang, Kent Koyanagi
Learning to Play like an Othello Master CS 229 Project Report December 13, 213 1 Abstract This project aims to train a machine to strategically play the game of Othello using machine learning. Prior to
More informationInferring Mobile Trajectories using a Network of Binary Proximity Sensors
Inferring Mobile Trajectories using a etwork of Binary Proximity Sensors Eunjoon Cho, Kevin Wong, Omprakash Gnawali, Martin Wicke, and Leonidas Guibas {ejcho,kbw5}@stanford.edu, gnawali@cs.stanford.edu,
More informationACRUCIAL issue in the design of wireless sensor networks
4322 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 58, NO. 8, AUGUST 2010 Coalition Formation for Bearings-Only Localization in Sensor Networks A Cooperative Game Approach Omid Namvar Gharehshiran, Student
More informationMeme Tracking. Abhilash Chowdhary CS-6604 Dec. 1, 2015
Meme Tracking Abhilash Chowdhary CS-6604 Dec. 1, 2015 Overview Introduction Information Spread Meme Tracking Part 1 : Rise and Fall Patterns of Information Diffusion: Model and Implications Part 2 : NIFTY:
More informationUsing Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization
Using Crowdsourced Data in Location-based Social Networks to Explore Influence Maximization Ji Li 1 Zhipeng Cai 1 Mingyuan Yan 2 Yingshu Li 1 1 Department of Computer Science, Georgia State University
More informationSimilarity & Link Analysis. Stony Brook University CSE545, Fall 2016
Similarity & Link nalysis Stony rook University SE545, Fall 6 Finding Similar Items? (http://blog.soton.ac.uk/hive//5//r ecommendation-system-of-hive/) (http://www.datacommunitydc.org/blog/ 3/8/entity-resolution-for-big-data)
More informationMore on games (Ch )
More on games (Ch. 5.4-5.6) Announcements Midterm next Tuesday: covers weeks 1-4 (Chapters 1-4) Take the full class period Open book/notes (can use ebook) ^^ No programing/code, internet searches or friends
More informationProposed Graduate Course at ANU: Statistical Communication Theory
Proposed Graduate Course at ANU: Statistical Communication Theory Mark Reed mark.reed@nicta.com.au Title of the course: Statistical Communication Theory Course Director: Dr. Mark Reed (ANU Adjunct Fellow)
More informationDetection of Compound Structures in Very High Spatial Resolution Images
Detection of Compound Structures in Very High Spatial Resolution Images Selim Aksoy Department of Computer Engineering Bilkent University Bilkent, 06800, Ankara, Turkey saksoy@cs.bilkent.edu.tr Joint work
More informationAdvanced Techniques for Mobile Robotics Location-Based Activity Recognition
Advanced Techniques for Mobile Robotics Location-Based Activity Recognition Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Activity Recognition Based on L. Liao, D. J. Patterson, D. Fox,
More informationCreating an Agent of Doom: A Visual Reinforcement Learning Approach
Creating an Agent of Doom: A Visual Reinforcement Learning Approach Michael Lowney Department of Electrical Engineering Stanford University mlowney@stanford.edu Robert Mahieu Department of Electrical Engineering
More informationThe Self-Avoiding Walk (Probability And Its Applications) By Neal Madras;Gordon Slade
The Self-Avoiding Walk (Probability And Its Applications) By Neal Madras;Gordon Slade If you are searching for a book by Neal Madras;Gordon Slade The Self-Avoiding Walk (Probability and Its Applications)
More informationSection Introduction to Sets
Section 1.1 - Introduction to Sets Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
More informationWireless Network Delay Estimation for Time-Sensitive Applications
Wireless Network Delay Estimation for Time-Sensitive Applications Rafael Camilo Lozoya Gámez, Pau Martí, Manel Velasco and Josep M. Fuertes Automatic Control Department Technical University of Catalonia
More informationLocation Segmentation, Inference and Prediction for Anticipatory Computing
Location Segmentation, Inference and Prediction for Anticipatory Computing Nathan Eagle MIT Media Laboratory The Santa Fe Institute nathan@mit.edu Aaron Clauset The Santa Fe Institute aaronc@santafe.edu
More information1 Introduction. Yan Shoshitaishvili*, Christopher Kruegel, and Giovanni Vigna Portrait of a Privacy Invasion
Yan Shoshitaishvili*, Christopher Kruegel, and Giovanni Vigna Portrait of a Privacy Invasion Detecting Relationships Through Large-scale Photo Analysis The popularity of online social networks has changed
More informationA PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations
Simulation A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations D. Silvestre, J. Hespanha and C. Silvestre 2018 American Control Conference Milwaukee June 27-29 2018 Silvestre, Hespanha and
More informationChapter 5 - Elementary Probability Theory
Chapter 5 - Elementary Probability Theory Historical Background Much of the early work in probability concerned games and gambling. One of the first to apply probability to matters other than gambling
More informationAn Empirical Evaluation of Policy Rollout for Clue
An Empirical Evaluation of Policy Rollout for Clue Eric Marshall Oregon State University M.S. Final Project marshaer@oregonstate.edu Adviser: Professor Alan Fern Abstract We model the popular board game
More informationProject. B) Building the PWM Read the instructions of HO_14. 1) Determine all the 9-mers and list them here:
Project Please choose ONE project among the given five projects. The last three projects are programming projects. hoose any programming language you want. Note that you can also write programs for the
More informationFast Statistical Timing Analysis By Probabilistic Event Propagation
Fast Statistical Timing Analysis By Probabilistic Event Propagation Jing-Jia Liou, Kwang-Ting Cheng, Sandip Kundu, and Angela Krstić Electrical and Computer Engineering Department, University of California,
More informationPortrait of a Privacy Invasion
Portrait of a Privacy Invasion Detecting Relationships Through Large-scale Photo Analysis Yan Shoshitaishvili, Christopher Kruegel, Giovanni Vigna UC Santa Barbara Santa Barbara, CA, USA {yans,chris,vigna}@cs.ucsb.edu
More informationIntroduction to Monte Carlo Methods
Introduction Introduction to Monte Carlo Methods Daryl DeFord VRDI MGGG June 6, 2018 Introduction Outline 1 Introduction 2 3 Monte Carlo Methods 4 Historical Overview 5 Markov Chain Methods 6 MCMC on Graphs
More informationCS224W: Social and Information Network Analysis Jure Leskovec, Stanford University
CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/22/2014 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu
More informationMixing Business Cards in a Box
Mixing Business Cards in a Box I. Abstract... 2 II. Introduction... 2 III. Experiment... 2 1. Materials... 2 2. Mixing Procedure... 3 3. Data collection... 3 IV. Theory... 4 V. Statistics of the Data...
More informationBayesian Positioning in Wireless Networks using Angle of Arrival
Bayesian Positioning in Wireless Networks using Angle of Arrival Presented by: Rich Martin Joint work with: David Madigan, Eiman Elnahrawy, Wen-Hua Ju, P. Krishnan, A.S. Krishnakumar Rutgers University
More informationFDM (Fast Distributed Mining) over normal mining algorithm based on A-priori property and its application in market basket analysis
FDM (Fast Distributed Mining) over normal mining algorithm based on A-priori property and its application in market basket analysis Sateesh Reddy, Ravi Konaraddi, Sivagama Sundari G CSE Department, MVJCE
More informationDesign of Parallel Algorithms. Communication Algorithms
+ Design of Parallel Algorithms Communication Algorithms + Topic Overview n One-to-All Broadcast and All-to-One Reduction n All-to-All Broadcast and Reduction n All-Reduce and Prefix-Sum Operations n Scatter
More informationLocalization (Position Estimation) Problem in WSN
Localization (Position Estimation) Problem in WSN [1] Convex Position Estimation in Wireless Sensor Networks by L. Doherty, K.S.J. Pister, and L.E. Ghaoui [2] Semidefinite Programming for Ad Hoc Wireless
More informationSampling distributions and the Central Limit Theorem
Sampling distributions and the Central Limit Theorem Johan A. Elkink University College Dublin 14 October 2013 Johan A. Elkink (UCD) Central Limit Theorem 14 October 2013 1 / 29 Outline 1 Sampling 2 Statistical
More information5.4 Imperfect, Real-Time Decisions
116 5.4 Imperfect, Real-Time Decisions Searching through the whole (pruned) game tree is too inefficient for any realistic game Moves must be made in a reasonable amount of time One has to cut off the
More informationGMP based channel estimation for single carrier transmissions over doubly selective channels
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2010 GMP based channel estimation for single carrier
More informationAlternation in the repeated Battle of the Sexes
Alternation in the repeated Battle of the Sexes Aaron Andalman & Charles Kemp 9.29, Spring 2004 MIT Abstract Traditional game-theoretic models consider only stage-game strategies. Alternation in the repeated
More informationStatistical Communication Theory
Statistical Communication Theory Mark Reed 1 1 National ICT Australia, Australian National University 21st February 26 Topic Formal Description of course:this course provides a detailed study of fundamental
More informationSystems Dependability Assessment
FOCUS RISK MANAGEMENT AND DEPENDABILITY SERIES Systems Dependability Assessment Modeling with Graphs and Finite State Automata Jean-François Aubry Nicolae Brinzei Systems Dependability Assessment FOCUS
More informationLearning from Hints: AI for Playing Threes
Learning from Hints: AI for Playing Threes Hao Sheng (haosheng), Chen Guo (cguo2) December 17, 2016 1 Introduction The highly addictive stochastic puzzle game Threes by Sirvo LLC. is Apple Game of the
More informationComparative method, coalescents, and the future
Comparative method, coalescents, and the future Joe Felsenstein Depts. of Genome Sciences and of Biology, University of Washington Comparative method, coalescents, and the future p.1/36 Correlation of
More informationTREES OF GENES IN POPULATIONS
1 TREES OF GENES IN POPULATIONS Joseph Felsenstein Abstract Trees of ancestry of copies of genes form in populations, as a result of the randomness of birth, death, and Mendelian reproduction. Considering
More informationUWB Small Scale Channel Modeling and System Performance
UWB Small Scale Channel Modeling and System Performance David R. McKinstry and R. Michael Buehrer Mobile and Portable Radio Research Group Virginia Tech Blacksburg, VA, USA {dmckinst, buehrer}@vt.edu Abstract
More informationCoverage in Sensor Networks
Coverage in Sensor Networks Xiang Luo ECSE 6962 Coverage problems Definition: the measurement of quality of service (surveillance) that can be provided by a particular sensor network Coverage problems
More informationDevelopment of Outage Tolerant FSM Model for Fading Channels
Development of Outage Tolerant FSM Model for Fading Channels Ms. Anjana Jain 1 P. D. Vyavahare 1 L. D. Arya 2 1 Department of Electronics and Telecomm. Engg., Shri G. S. Institute of Technology and Science,
More informationTICRec: A Probabilistic Framework to Utilize Temporal Influence Correlations for Time-aware Location Recommendations
: A Probabilistic Framework to Utilize Temporal Influence Correlations for Time-aware Location Recommendations Jia-Dong Zhang, Chi-Yin Chow, Member, IEEE Abstract In location-based social networks (LBSNs),
More informationApplying Vision to Intelligent Human-Computer Interaction
Applying Vision to Intelligent Human-Computer Interaction Guangqi Ye Department of Computer Science The Johns Hopkins University Baltimore, MD 21218 October 21, 2005 1 Vision for Natural HCI Advantages
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationTexas Hold em Inference Bot Proposal. By: Brian Mihok & Michael Terry Date Due: Monday, April 11, 2005
Texas Hold em Inference Bot Proposal By: Brian Mihok & Michael Terry Date Due: Monday, April 11, 2005 1 Introduction One of the key goals in Artificial Intelligence is to create cognitive systems that
More informationSMALL WORLDS IN NETWORKS OF INVENTORS AND THE ROLE OF SCIENCE: AN ANALYSIS OF FRANCE
SMALL WORLDS IN NETWORKS OF INVENTORS AND THE ROLE OF SCIENCE: AN ANALYSIS OF FRANCE FRANCESCO LISSONI (1), PATRICK LLERENA (2), BULAT SANDITOV (3) (1) Brescia University & KITeS Bocconi University, (2)
More informationRobust Frequency-Hopping System for Channels with Interference and Frequency-Selective Fading
Robust Frequency-Hopping System for Channels with Interference and Frequency-Selective Fading Don Torrieri 1, Shi Cheng 2, and Matthew C. Valenti 2 1 US Army Research Lab 2 Lane Department of Computer
More informationApplying Machine Learning Techniques to an Imperfect Information Game
Applying Machine Learning Techniques to an Imperfect Information Game by Ne ill Sweeney B.Sc. M.Sc. A thesis submitted to the School of Computing, Dublin City University in partial fulfilment of the requirements
More informationDistributed estimation and consensus. Luca Schenato University of Padova WIDE 09 7 July 2009, Siena
Distributed estimation and consensus Luca Schenato University of Padova WIDE 09 7 July 2009, Siena Joint work w/ Outline Motivations and target applications Overview of consensus algorithms Application
More informationKalman Filters and Adaptive Windows for Learning in Data Streams
Kalman Filters and Adaptive Windows for Learning in Data Streams Albert Bifet Ricard Gavaldà Universitat Politècnica de Catalunya DS 06 Barcelona A. Bifet, R. Gavaldà (UPC) Kalman Filters and Adaptive
More informationDecentralized Cognitive MAC for Opportunistic Spectrum Access in Ad-Hoc Networks: A POMDP Framework
Decentralized Cognitive MAC for Opportunistic Spectrum Access in Ad-Hoc Networks: A POMDP Framework Qing Zhao, Lang Tong, Anathram Swami, and Yunxia Chen EE360 Presentation: Kun Yi Stanford University
More information2007 Census of Agriculture Non-Response Methodology
2007 Census of Agriculture Non-Response Methodology Will Cecere National Agricultural Statistics Service Research and Development Division, U.S. Department of Agriculture, 3251 Old Lee Highway, Fairfax,
More informationComparative method, coalescents, and the future. Correlation of states in a discrete-state model
Comparative method, coalescents, and the future Joe Felsenstein Depts. of Genome Sciences and of Biology, University of Washington Comparative method, coalescents, and the future p.1/28 Correlation of
More informationMixed Synchronous/Asynchronous State Memory for Low Power FSM Design
Mixed Synchronous/Asynchronous State Memory for Low Power FSM Design Cao Cao and Bengt Oelmann Department of Information Technology and Media, Mid-Sweden University S-851 70 Sundsvall, Sweden {cao.cao@mh.se}
More informationHand & Upper Body Based Hybrid Gesture Recognition
Hand & Upper Body Based Hybrid Gesture Prerna Sharma #1, Naman Sharma *2 # Research Scholor, G. B. P. U. A. & T. Pantnagar, India * Ideal Institue of Technology, Ghaziabad, India Abstract Communication
More informationConsensus Algorithms for Distributed Spectrum Sensing Based on Goodness of Fit Test in Cognitive Radio Networks
Consensus Algorithms for Distributed Spectrum Sensing Based on Goodness of Fit Test in Cognitive Radio Networks Djamel TEGUIG, Bart SCHEERS, Vincent LE NIR Department CISS Royal Military Academy Brussels,
More informationVEHICULAR ad hoc networks (VANETs) are becoming
Repetition-based Broadcast in Vehicular Ad Hoc Networks in Rician Channel with Capture Farzad Farnoud, Shahrokh Valaee Abstract In this paper we study the performance of different vehicular wireless broadcast
More informationTraffic-Aided Multiuser Detection for Random-Access CDMA Networks
1570 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 49, NO 7, JULY 2001 Traffic-Aided Multiuser Detection for Random-Access CDMA Networks Biao Chen, Member, IEEE, and Lang Tong, Member, IEEE Abstract Traffic
More informationA Bayesian rating system using W-Stein s identity
A Bayesian rating system using W-Stein s identity Ruby Chiu-Hsing Weng Department of Statistics National Chengchi University 2011.12.16 Joint work with C.-J. Lin Ruby Chiu-Hsing Weng (National Chengchi
More informationCSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Course Overview Graph Algorithms Algorithm Design Techniques: Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational Intractability Main Ideas Main idea: Break the given
More informationStock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm
Stock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm Ahdieh Rahimi Garakani Department of Computer South Tehran Branch Islamic Azad University Tehran,
More informationControl Synthesis and Delay Sensor Deployment for Efficient ASV designs
Control Synthesis and Delay Sensor Deployment for Efficient ASV designs C H A O FA N L I < C H AO F @ TA M U. E D U >, T E X A S A & M U N I V E RS I T Y S A C H I N S. S A PAT N E K A R, U N I V E RS
More informationA Study of the Spatio-Temporal Correlations in Mobile Calls Networks
A Study of the Spatio-Temporal Correlations in Mobile Calls Networks Romain Guigourès, Marc Boullé and Fabrice Rossi Abstract For the last few years, the amount of data has significantly increased in the
More informationGenealogical Implicit Affinity Networks
Genealogical Implicit Affinity Networks Matthew Smith and Christophe Giraud-Carrier Department of Computer Science Brigham Young University, Provo, UT 84602 Abstract This paper presents a method for building
More informationTime-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Items Recommendation
July, 12 th 2018 Time-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Items Recommendation BIRNDL 2018, Ann Arbor Anas Alzogbi University of Freiburg Databases & Information Systems
More informationLuca Schenato joint work with: A. Basso, G. Gamba
Distributed consensus protocols for clock synchronization in sensor networks Luca Schenato joint work with: A. Basso, G. Gamba Networked Control Systems Drive-by-wire systems Swarm robotics Smart structures:
More informationIntroduction. Descriptive Statistics. Problem Solving. Inferential Statistics. Chapter1 Slides. Maurice Geraghty
Inferential Statistics and Probability a Holistic Approach Chapter 1 Displaying and Analyzing Data with Graphs This Course Material by Maurice Geraghty is licensed under a Creative Commons Attribution-ShareAlike
More informationp-percent Coverage in Wireless Sensor Networks
p-percent Coverage in Wireless Sensor Networks Yiwei Wu, Chunyu Ai, Shan Gao and Yingshu Li Department of Computer Science Georgia State University October 28, 2008 1 Introduction 2 p-percent Coverage
More informationAUTOMATED MUSIC TRACK GENERATION
AUTOMATED MUSIC TRACK GENERATION LOUIS EUGENE Stanford University leugene@stanford.edu GUILLAUME ROSTAING Stanford University rostaing@stanford.edu Abstract: This paper aims at presenting our method to
More informationParametric Approaches for Refractivity-from-Clutter Inversion
Parametric Approaches for Refractivity-from-Clutter Inversion Peter Gerstoft Marine Physical Laboratory, Scripps Institution of Oceanography La Jolla, CA 92093-0238 phone: (858) 534-7768 fax: (858) 534-7641
More informationCOordinated relationship exploration is an important task in
TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 1 The Effect of Edge Bundling and Seriation on Sensemaking of Biclusters in Bipartite Graphs Maoyuan Sun, Jian Zhao, Hao Wu, Kurt Luther, Chris North
More informationArtificial Beacons with RGB-D Environment Mapping for Indoor Mobile Robot Localization
Sensors and Materials, Vol. 28, No. 6 (2016) 695 705 MYU Tokyo 695 S & M 1227 Artificial Beacons with RGB-D Environment Mapping for Indoor Mobile Robot Localization Chun-Chi Lai and Kuo-Lan Su * Department
More informationAmplitude and Phase Distortions in MIMO and Diversity Systems
Amplitude and Phase Distortions in MIMO and Diversity Systems Christiane Kuhnert, Gerd Saala, Christian Waldschmidt, Werner Wiesbeck Institut für Höchstfrequenztechnik und Elektronik (IHE) Universität
More informationRobust Location Detection in Emergency Sensor Networks. Goals
Robust Location Detection in Emergency Sensor Networks S. Ray, R. Ungrangsi, F. D. Pellegrini, A. Trachtenberg, and D. Starobinski. Robust location detection in emergency sensor networks. In Proceedings
More informationIoanna Manolopoulou and Brent C. Emerson. October 7, Abstract
Phylogeographic Ancestral Inference Using the Coalescent Model on Haplotype Trees Ioanna Manolopoulou and Brent C. Emerson October 7, 2011 Abstract Phylogeographic ancestral inference is a question frequently
More informationFast Detour Computation for Ride Sharing
Fast Detour Computation for Ride Sharing Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Volker Universität Karlsruhe (TH), 76128 Karlsruhe, Germany {geisberger,luxen,sanders}@ira.uka.de;
More informationExtracting Social Networks from Literary Fiction
Extracting Social Networks from Literary Fiction David K. Elson, Nicholas Dames, Kathleen R. McKeown Presented by Audrey Lawrence and Kathryn Lingel Introduction Network of 19th century novel's social
More informationRecommender Systems TIETS43 Collaborative Filtering
+ Recommender Systems TIETS43 Collaborative Filtering Fall 2017 Kostas Stefanidis kostas.stefanidis@uta.fi https://coursepages.uta.fi/tiets43/ selection Amazon generates 35% of their sales through recommendations
More informationMA/CSSE 473 Day 14. Permutations wrap-up. Subset generation. (Horner s method) Permutations wrap up Generating subsets of a set
MA/CSSE 473 Day 14 Permutations wrap-up Subset generation (Horner s method) MA/CSSE 473 Day 14 Student questions Monday will begin with "ask questions about exam material time. Exam details are Day 16
More informationTIES: An Engineering Design Methodology and System
From: IAAI-90 Proceedings. Copyright 1990, AAAI (www.aaai.org). All rights reserved. TIES: An Engineering Design Methodology and System Lakshmi S. Vora, Robert E. Veres, Philip C. Jackson, and Philip Klahr
More information