1 1. Introduction Background Key questions 2. Probabilistic Exemplar Based Model Representation Classification process Learning process 3. Empirical Evaluation.

Slides:



Advertisements
Similar presentations
Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, California
Advertisements

Solving inconsistent ontologies with heuristics Joey Lam, Derek Sleeman, Wamberto Vasconcelos 23 Jan 2006.
Mustafa Cayci INFS 795 An Evaluation on Feature Selection for Text Clustering.
Weka. Preprocessing Opening a file Editing a file Visualize a variable.
Large-Scale Entity-Based Online Social Network Profile Linkage.
LECTURE 11: BAYESIAN PARAMETER ESTIMATION
Weka. Preprocessing Opening a file Editing a file Visualize a variable.
Rosa Cowan April 29, 2008 Predictive Modeling & The Bayes Classifier.
Assuming normally distributed data! Naïve Bayes Classifier.
Looking at both the Present and the Past to Efficiently Update Replicas of Web Content Luciano Barbosa * Ana Carolina Salgado ! Francisco Tenorio ! Jacques.
Introduction to Automatic Classification Shih-Wen (George) Ke 7 th Dec 2005.
Introduction to Information Retrieval Introduction to Information Retrieval Hinrich Schütze and Christina Lioma Lecture 11: Probabilistic Information Retrieval.
Case Based Reasoning Melanie Hanson Engr 315. What is Case-Based Reasoning? Storing information from previous experiences Using previously gained knowledge.
Motivate AI Class with Interactive Computer Game Author : Akcell Chiang Presented by Yi Cheng Lin.
Clustering. 2 Outline  Introduction  K-means clustering  Hierarchical clustering: COBWEB.
Instance Based Learning Bob Durrant School of Computer Science University of Birmingham (Slides: Dr Ata Kabán) 1.
Text Classification Using Stochastic Keyword Generation Cong Li, Ji-Rong Wen and Hang Li Microsoft Research Asia August 22nd, 2003.
Robust Bayesian Classifier Presented by Chandrasekhar Jakkampudi.
Introduction to Machine Learning Approach Lecture 5.
 2002, G.Tecuci, Learning Agents Laboratory 1 Learning Agents Laboratory Computer Science Department George Mason University Prof. Gheorghe Tecuci Case-based.
Large-Scale Cost-sensitive Online Social Network Profile Linkage.
1 Assessment of Imprecise Reliability Using Efficient Probabilistic Reanalysis Farizal Efstratios Nikolaidis SAE 2007 World Congress.
By : Anas Assiri.  Introduction  fraud detection  Immune system  Artificial immune system (AIS)  AISFD  Clonal selection.
Copyright R. Weber Machine Learning, Data Mining ISYS370 Dr. R. Weber.
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization Thorsten Joachims Carnegie Mellon University Presented by Ning Kang.
Becerra-Fernandez, et al. -- Knowledge Management 1/e -- © 2004 Prentice Hall Chapter 9 Using Past History Explicitly as Knowledge: Case-based Reasoning.
Quality Assessment for CBSD: Techniques and A Generic Environment Presented by: Cai Xia Supervisor: Prof. Michael Lyu Markers: Prof. Ada Fu Prof. K.F.
Partially Supervised Classification of Text Documents by Bing Liu, Philip Yu, and Xiaoli Li Presented by: Rick Knowles 7 April 2005.
Case study of Several Case Based Reasoners Sandesh.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Achieving High Software Reliability Using a Faster, Easier and Cheaper Method NASA OSMA SAS '01 September 5-7, 2001 Taghi M. Khoshgoftaar The Software.
Classification Techniques: Bayesian Classification
An Ensemble of Three Classifiers for KDD Cup 2009: Expanded Linear Model, Heterogeneous Boosting, and Selective Naive Bayes Members: Hung-Yi Lo, Kai-Wei.
CISC Machine Learning for Solving Systems Problems Presented by: Ashwani Rao Dept of Computer & Information Sciences University of Delaware Learning.
Copyright R. Weber Machine Learning, Data Mining INFO 629 Dr. R. Weber.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. A fast nearest neighbor classifier based on self-organizing incremental neural network (SOINN) Neuron.
Chapter 11 Statistical Techniques. Data Warehouse and Data Mining Chapter 11 2 Chapter Objectives  Understand when linear regression is an appropriate.
Powerpoint Templates Page 1 Powerpoint Templates Scalable Text Classification with Sparse Generative Modeling Antti PuurulaWaikato University.
Fighting Identity Theft with Advances in Fingerprint Recognition Dick Mathekga.
Strategies for Distributed CBR Santi Ontañón IIIA-CSIC.
Catalog Integration R. Agrawal, R. Srikant: WWW-10.
Active learning Haidong Shi, Nanyi Zeng Nov,12,2008.
Seminar of Interest Friday, September 15, at 11:00 am, EMS W220. Dr. Hien Nguyen of the University of Wisconsin- Whitewater. "Hybrid User Model for Information.
20. september 2006TDT55 - Case-based reasoning1 Retrieval, reuse, revision, and retention in case-based reasoning.
29 August 2013 Venkat Naïve Bayesian on CDF Pair Scores.
Dimensionality Reduction in Unsupervised Learning of Conditional Gaussian Networks Authors: Pegna, J.M., Lozano, J.A., Larragnaga, P., and Inza, I. In.
Data Mining and Decision Support
Virtual Examples for Text Classification with Support Vector Machines Manabu Sassano Proceedings of the 2003 Conference on Emprical Methods in Natural.
Machine Learning in Practice Lecture 21 Carolyn Penstein Rosé Language Technologies Institute/ Human-Computer Interaction Institute.
ADAPTIVE HIERARCHICAL CLASSIFICATION WITH LIMITED TRAINING DATA Dissertation Defense of Joseph Troy Morgan Committee: Dr Melba Crawford Dr J. Wesley Barnes.
Naive Bayes Classifier. REVIEW: Bayesian Methods Our focus this lecture: – Learning and classification methods based on probability theory. Bayes theorem.
Text Classification and Naïve Bayes Formalizing the Naïve Bayes Classifier.
Naive Bayes Classifier
Classification Techniques: Bayesian Classification
Image Segmentation Techniques
Prepared by: Mahmoud Rafeek Al-Farra
Clustering.
Open-Category Classification by Adversarial Sample Generation
Supervised vs. unsupervised Learning
Bayesian Learning Chapter
Authors: Wai Lam and Kon Fan Low Announcer: Kyu-Baek Hwang
The Naïve Bayes (NB) Classifier
Prepared by: Mahmoud Rafeek Al-Farra
LECTURE 07: BAYESIAN ESTIMATION
Evaluation Report Investigates a problem or a set of options.
Sofia Pediaditaki and Mahesh Marina University of Edinburgh
A task of induction to find patterns
Internet Traffic Classification Using Bayesian Analysis Techniques
A task of induction to find patterns
10 Case-Based Reasoning and Learning
Presentation transcript:

1 1. Introduction Background Key questions 2. Probabilistic Exemplar Based Model Representation Classification process Learning process 3. Empirical Evaluation 4. Related Work A Probabilistic Exemplar Based Model for Case-Based Reasoning Andrés Rodríguez, Sunil Vadera, Enrique Sucar Ins. Inv. Eléctricas, University of Salford, ITESM Morelos MICAI 2000 Abril 2000 OUTLINE

2 Introduction Case Base Reasoning Cycle case base Adaptation Evaluation Retention Retrieval How do we assess similarity ? Is the proposal a likely solution ? Which cases do we retain ? How do we adapt the old solution? Representation ? Case Base Reasoning Paradigm New cases can be solved by adapting solutions that were used to solve similar cases in the past.

3 A B category case C Interesting when categories not defined by nec/suf conds. data is unstructured categories not disjoint not all the data exists in advance uncertainty involved A B exemplar category prototypical case C

4 Key Questions The objective. A B exemplar category new exemplar What is a good representation for an EBM? What notion of similarity can be adopted? How can a new case be classified? How can it be learned incrementally?

5 Representation... C1 Cw e1 ei ek eq f1 f2 fm fj fn P(f1 | parents(f1)) P(fn | parents(fn)) P(e1 | C1) P(ei | C1 ) P(eq | Cw)... C1 Cw Ci e1 ei ek eq

6 Classification Process fa,..., fh new case... Cm C1 ec fk fj Stage 1 Rank the categories. Rank(ei) = Stage 2 Determination of an Exemplar P(ei | fa,..., fh) P(f | ei) nfei... C1 Cw e1 ei ek eq f1 f2 fm fj fn P(f1 | parents(f1)) P(fn | parents(fn)) P(e1 | C1) P(eq | Cw).... C1 e1 ei ek f1 f2 fm fj P(f1 | parents(f1)) P(e1 | C1)... f  ei

7 Learning Process Classification process new training case Add exemplar Retain ? C e1 e2 e3 C e1 e2 e3 C e1 e2 e3

8 What makes a good exemplar? A prototypical member [Rosch and Mervis (1974)] 1. High family resemblance in the region 2. Low family resemblance with other regions. Summary representation is a Bayesian net consisting of the features of all the cases represented by the exemplar. Prototypical case Focality Peripherality Prototypicality New case ei C

9 Estimating the Parameters Need to estimate P(fi| parents(fi)) Requires 2 n+1 values for n parents. Intersection may not have many examples Noisy OR model Exception Independence Absence of fi given e1 is independent of absence of a feature given e2 Accountability Condition If a case is not represented by any of the exemplars, then it does not have any of the exemplars’ features.... C1 Cw e1 ei ek eq f1 f2 fm fj fn P(f1 | parents(f1)) P(fn | parents(fn)) P(e1 | C1) P(eq | Cw)...

10... A e6 e8 e9 f1 f2 f4 fn-1 f3 fn Ve P(e6 | A) P(e9 | A) P(f1 | e6,Ve ) P(fn | e9,Ve) Virtual Exemplar Estimate of P(f | Ve) Where n : number of cases in the category  and parameters that determine the rate of decay

11 Empirical Evaluation Tested on Votes, Zoo, Audiology Decay: = 0.6,  = 0.1, threshold = /30 training/testing split Good accuracy for Votes (89%) & Zoo (92%) Poor for Audiology (50%) Audiology: Compression & Accuracy Category Percent CompressionAccuracy

12 Bayesian models Inductive models with supervised learning Case-based models PROTOS CASEY REMIND OC1 C4.5 COBWEB Inductive models unsupervised learning AutoClass IBL CBR-Express Naive Bayes Heckerman's Tirri's PEBM Protos Use of remindings, censors, difference links Learns from failure by user explanation Uses many heuristics Tirri and Myllymäkis’ model Uses all cases not exemplars Assumes cases are mutually exclusive Assumes features are independent given case Related Work

13 Conclusion Developed a model with: probabilistic exemplars foundations in Bayesian nets is incremental promising results Future Need to: develop quicker propagation test on more data sets evaluate it relative to others investigate, , threshold multilevel features dependent features