Advisor: Hsin-His Chen Reporter: Chi-Hsin Yu Date: 2009.02.11 From AAAI 2008 William Pentney, Department of Computer Science & Engineering University of.

Slides:



Advertisements
Similar presentations
CS188: Computational Models of Human Behavior
Advertisements

Office of SA to CNS GeoIntelligence Introduction Data Mining vs Image Mining Image Mining - Issues and Challenges CBIR Image Mining Process Ontology.
Hybrid Context Inconsistency Resolution for Context-aware Services
PAPER BY : CHRISTOPHER R’E NILESH DALVI DAN SUCIU International Conference on Data Engineering (ICDE), 2007 PRESENTED BY : JITENDRA GUPTA.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,
Undirected Probabilistic Graphical Models (Markov Nets) (Slides from Sam Roweis)
EE462 MLCV Lecture Introduction of Graphical Models Markov Random Fields Segmentation Tae-Kyun Kim 1.
1 Unsupervised Semantic Parsing Hoifung Poon and Pedro Domingos EMNLP 2009 Best Paper Award Speaker: Hao Xiong.
Review Markov Logic Networks Mathew Richardson Pedro Domingos Xinran(Sean) Luo, u
Markov Networks.
CPSC 322, Lecture 26Slide 1 Reasoning Under Uncertainty: Belief Networks Computer Science cpsc322, Lecture 27 (Textbook Chpt 6.3) March, 16, 2009.
1 Lecture 35 Brief Introduction to Main AI Areas (cont’d) Overview  Lecture Objective: Present the General Ideas on the AI Branches Below  Introduction.
Distributed Message Passing for Large Scale Graphical Models Alexander Schwing Tamir Hazan Marc Pollefeys Raquel Urtasun CVPR2011.
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Carnegie Mellon Focused Belief Propagation for Query-Specific Inference Anton Chechetka Carlos Guestrin 14 May 2010.
1 Image Completion using Global Optimization Presented by Tingfan Wu.
CSE 574 – Artificial Intelligence II Statistical Relational Learning Instructor: Pedro Domingos.
1 MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING By Kaan Tariman M.S. in Computer Science CSCI 8810 Course Project.
Personalized Medicine Research at the University of Rochester Henry Kautz Department of Computer Science.
Ambulation : a tool for monitoring mobility over time using mobile phones Computational Science and Engineering, CSE '09. International Conference.
CHAPTER 12 ADVANCED INTELLIGENT SYSTEMS © 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang.
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,
Decision-Making on Robots Using POMDPs and Answer Set Programming Introduction Robots are an integral part of many sectors such as medicine, disaster rescue.
Invitation to Computer Science 5th Edition
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
UNIVERSITY of NOTRE DAME COLLEGE of ENGINEERING Preserving Location Privacy on the Release of Large-scale Mobility Data Xueheng Hu, Aaron D. Striegel Department.
Tim Finin University of Maryland, Baltimore County 29 January 2013 Joint work with Anupam Joshi, Laura Zavala and our students SRI Social Media Workshop.
© 2005 Ritsumeikan Univ. All Rights Reserved. Embedded Action Detector to Enhance Freedom from Care Ritsumeikan University Graduate School of Computer.
A Markov Random Field Model for Term Dependencies Donald Metzler W. Bruce Croft Present by Chia-Hao Lee.
Undirected Models: Markov Networks David Page, Fall 2009 CS 731: Advanced Methods in Artificial Intelligence, with Biomedical Applications.
第十讲 概率图模型导论 Chapter 10 Introduction to Probabilistic Graphical Models
Recognizing Activities of Daily Living from Sensor Data Henry Kautz Department of Computer Science University of Rochester.
Markov Logic And other SRL Approaches
Ensemble Based Systems in Decision Making Advisor: Hsin-His Chen Reporter: Chi-Hsin Yu Date: IEEE CIRCUITS AND SYSTEMS MAGAZINE 2006, Q3 Robi.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Chapter 13 Artificial Intelligence and Expert Systems.
AnalogySpace: Reducing the Dimensionality of Common Sense Knowledge Advisor: Hsin-His Chen Reporter: Chi-Hsin Yu Date: From AAAI 2008 Robert.
Tuffy Scaling up Statistical Inference in Markov Logic using an RDBMS
1 Markov Random Fields with Efficient Approximations Yuri Boykov, Olga Veksler, Ramin Zabih Computer Science Department CORNELL UNIVERSITY.
Estimating Component Availability by Dempster-Shafer Belief Networks Estimating Component Availability by Dempster-Shafer Belief Networks Lan Guo Lane.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
REU 2004 Computer Science and Engineering Department The University of Texas at Arlington Research Experiences for Undergraduates in Distributed Rational.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Training Conditional Random Fields using Virtual Evidence Boosting Lin Liao, Tanzeem Choudhury †, Dieter Fox, and Henry Kautz University of Washington.
Measuring Behavioral Trust in Social Networks
Chapter 10. The Explorer System in Cognitive Systems, Christensen et al. Course: Robots Learning from Humans On, Kyoung-Woon Biointelligence Laboratory.
Indexing Correlated Probabilistic Databases Bhargav Kanagal, Amol Deshpande University of Maryland, College Park, USA SIGMOD Presented.
CONTENTS: 1.Abstract. 2.Objective. 3.Block diagram. 4.Methodology. 5.Advantages and Disadvantages. 6.Applications. 7.Conclusion.
Contextual models for object detection using boosted random fields by Antonio Torralba, Kevin P. Murphy and William T. Freeman.
1 An infrastructure for context-awareness based on first order logic 송지수 ISI LAB.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
SUPERVISED AND UNSUPERVISED LEARNING Presentation by Ege Saygıner CENG 784.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Dinner for Two. Fuzzify Inputs Apply Fuzzy Operator.
Intro. ANN & Fuzzy Systems Lecture 28 Modeling (3): Expert System and Reinforcement Learning.
An Introduction to Markov Logic Networks in Knowledge Bases
EA C461 – Artificial Intelligence Logical Agent
Markov Random Fields with Efficient Approximations
Nonparametric Semantic Segmentation
Probabilistic Data Management
Artificial Intelligence
Learning Markov Networks
Introduction.
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
MACHINE LEARNING TECHNIQUES IN IMAGE PROCESSING
Enriching Taxonomies With Functional Domain Knowledge
Markov Networks.
A Review of Researches on Deep Learning in Remote Sensing Application
Presentation transcript:

Advisor: Hsin-His Chen Reporter: Chi-Hsin Yu Date: From AAAI 2008 William Pentney, Department of Computer Science & Engineering University of Washington Matthai Philipose, Intel Research Seattle Jeff Bilmes, Department of Electrical Engineering University of Washington

 Common Sense Data Acquisition for Indoor Mobile Robots ◦ AAAI 2004 ◦ Rakesh Gupta and Mykel J. Kochenderfer  Sensor-Based Understanding of Daily Life via Large-Scale Use of Common Sense ◦ AAAI 2006 ◦ William Pentney, et al., Matthai Philipose (Intel)  Learning Large Scale Common Sense Models of Everyday Life ◦ AAAI 2007 ◦ William Pentney, et al., Matthai Philipose (Intel)

 Introduction  Data Acquisition and Representation  Inference  Evaluation Methodology and Results  Conclusion

 Common sense ◦ being critical to the automated understanding of the world (Example)(Example) ◦ OMICS (Open Mind Indoor Common Sense) project  This paper ◦ enabling correspondingly large scale sensor-based understanding of the world (RFID)

(Back)

 Challenges ◦ semantic gaps (facts in DB - phenomena detected by sensors) ◦ fragility of reasoning in the face of noise ◦ Incompleteness of repositories (DB) ◦ slowness of reasoning with these large repositories  The adaptation of using sensor data is challenging because it is unclear that … ◦ how to represent models ◦ term occurrence statistics are a practical means of acquiring arbitrary common sense information from the web

 Collecting common sense data through the Open Mind Indoor Common Sense (OMICS) website  Restricting the domain to indoor home and office environments (AAAI 2004)

 Hand proximity to objects implies object use.  Three users perform various daily activities.  A total of 5-7 minutes of each activity was collected, for a total of 70-75min of data.  These traces were divided into time slices of 2.5s.

SRCS=State Recognition using Common Sense

 Template to relation ◦ “You when you are.” ◦ Relation: people(, ) ◦ Ex:  Relation People  people (‘eat’, ‘hungry’)  people(’drink water’,’are thirsty’)  Relation ContextAction  contextactions(’full garbage bag’, ’put the garbage in’, ’trash’)  contextactions(’making toasted bread’, ’slice’, ’bread’)  Relation ActionGenealization  actiongeneralization(’investigate cause of’, ’alarm’, ’smoke alarm’)  actiongeneralization(’wipe off’, ’floorcover’, ’carpet’)  actiongeneralization(’clean’, ’floorcover’, ’carpet’)  SRCS ◦ instances, 15 relations  KnowItAll ◦ Weighting the facts in OMICS DB Weighted Relations

 Using 20 fixed rewrite rules ◦ People(S, A) ⇝ (actionObserved(A) ⇒ personIn(S)) ◦ People(angry, yell) ⇝ (actionObserved(yell) ⇒ personIn(angry))  Horn clause ◦ p 1 ∧ p 2 ∧ … ∧ p N ⇒ p N+1 ◦ P 1 … p N : constant/atom, p N+1 :atom ◦ Constants: object, action, location, context, state ◦ 8 types of atoms:  useInferred(O), stateOf(O, S), locationInfererd(L), personIn(S), actionObserved(A) Weighted Relations Weighted Horn Clauses

 MRF ◦ Consists a graph whose set of vertices V are connected by a set of cliques c i ⊂ V.  V: atom f i,t and object o i,t for all i in time t ◦ Each c i has a potential function φ i :c i  R + ◦ Calculates p(f t,o t )  Markov logic network (Richardson & Domingos 2006) ◦ Are used for this conversion. Weighted Horn Clauses Markov Random Field (MRF)

Markov Random Field Chain Graph

 At time slice t ◦ Useinferred(O)=true if the use of object is detected at time slice t ◦ Infer other unknown variables using loopy belief propagation (Pearl 1988)  Calculate marginal for propositions in time slice t-1  30 min for inference in each time slice ◦ Use query-directed pruning to improve it  Output thresholds ◦ Set a variable to true if p(variable) > thresholds ◦ Use decision stump to learn the threshold

 Monitoring 24 Boolean variables to identify individual activity  Human labeling of the traces as the ground truth

 Train decision stumps on a sampling of data fro each activity (20mins)

 AAAI 2008 AAAI 2006 The performance is inconsistent. Improved

 Future works ◦ The cost of labeling trace is expensive  semi-supervised algorithm may help ◦ Integrating other sources of sensory input is exploring ◦ Selection of variable subset is important for scalable inference.  Conclusions ◦ Densely deployable wireless sensors made things possible.