Temporal Knowledge Acquisition From Multiple Experts

Size: px
Start display at page:

Download "Temporal Knowledge Acquisition From Multiple Experts"

Transcription

1 emporal Knowledge Acuisition From Multiple Experts Helen Kaikova, Vagan erziyan Metaintelligence Lab., Kharkov State echnical University of Radioelectronics, 4 Lenina Avenue, 3076 Kharkov, Ukraine, vagan@milab.kharkov.ua Abstract he paper deals with the research in the area of knowledge acuisition from multiple experts when knowledge includes temporal component. he expert s ranking refinement techniue is presented which is based on of the most supported opinion among all the experts. Paper answers to the following uestions: how to derive the most supported knowledge from the multiple experts about the unknown temporal relation between the two events; how to make uality evaluation of the most supported opinion; how to make syntactical analysis of the most supported opinion to make necessary corrections; how to make, evaluate, use and refine ranking of all the experts to improve the results.. Introduction he area of knowledge management includes the problem of eliciting expertise from more than one expert. he significance of this subject deals with fast development of telecommunications, Internet, WWW that connects people together and gives possibilities to collect knowledge from different sources. he problems, how to collect different opinions, handle inconsistent and incomplete knowledge taken from them, find consensus, support interface between individual and collective knowledge, are now under great interest of international research. Could the overlapping knowledge from multiple sources be described in such a way that it is context or even process independent? In [], the negative answer was given. If more than one expert is used, one must either select the opinion of the best expert or pool the experts judgements [, 5]. It is assumed that when experts judgements are pooled, collectively they offer sufficient cues to lead to the building of a comprehensive theory. In practice, one of the following three strategies may be used for knowledge acuisition: use the opinion of only one expert; collect the opinions of multiple experts, but use them one at a time, or integrate these opinions. Research described in [7] deals mainly with the strategy of integrating opinions. here it is assumed that acuired knowledge has more validity if it forms a consensus (if such exists) among the experts. In [6], five techniues are discussed and compared for aggregating expertise. In this study, elicited knowledge is aggregated using classical statistical methods (regression and discriminant analysis), the ID3 pattern classification method, the k-nn (Nearest Neighbour) techniue, and neural networks. In aggregating knowledge, the authors seek to identify the significance of each of the factors extracted and the functional inter-relationship among the relevant factors. A logic for reasoning with inconsistent knowledge has been described in [9]. his logic suits reasoning with knowledge coming from different and not fully reliable knowledge sources. Inconsistency may be resolved by considering the reliability of the knowledge sources used. he reliability relation can be interpreted as denoting that if two premisses are involved in a conflict the least reliable premiss has the highest probability of being wrong. he present paper deals with the integrating multiple experts opinions that include temporal relations between some events. he representation and reasoning about temporal relations are essential for knowledge representation [], natural language understanding [3,0], planning [,4], technical diagnosis [8], and other areas. An algebra with binary relations on intervals was introduced by Allen []. He gives an algorithm for computing an approximation to the strongest implied relation for each pair of intervals. We use Allen s representation of temporal relations to introduce a techniue to manage knowledge obtained from multiple knowledge sources. he scheme with problems, discussed in this paper, is shown in Figure. We consider knowledge that includes multiple experts description of some domain events by defining temporal relationships between them.

2 DOMAIN emporal relation Event Event Most supported opinion Experts Experts ranking Figure. he problem of knowledge acuisition from multiple experts hese problems are:. How to derive the most supported knowledge from the multiple experts about the unknown temporal relation between the two events?. How to make uality evaluation of the most supported opinion? 3. How to make syntactical analysis of the most supported opinion to make necessary corrections? 4. How to make, evaluate, use and refine ranks of all the experts to improve the results?. Basic Concepts In this chapter, we define main concepts used throughout the paper. We define knowledge about temporal domain as fifth <S,M,R,,P>. he concepts used are the following: S - the set of n knowledge sources or experts; M - the set of m basic relations for temporal points (able ). In this able, X - and X + are endpoints of the temporal interval ; Y - and Y + are endpoints of the temporal interval.; able. Set M of basic endpoints relations for two temporal intervals M Group : {,,3} M M M 3 X - < Y - X - > Y - X - = Y - Group : {4,5,6} M 4 M 5 M 6 X - < Y + X - > Y + X - = Y + Group 3: {7,8,9} M 7 M 8 M 9 X + < Y - X + > Y - X + = Y - Group 4: {0,,} M 0 M M X + < Y + X + > Y + X + = Y + R - the set of r basic relations for temporal intervals. We define this set according to Allen [,]. he set of 3 Allen s interval relations is shown in able ;

3 able. he set R of Allen s basic temporal relations Before R After R Meets R 3 Met-by R 4 During R 5 Includes R 6 Overlaps R 7 Overlapped by R 8 Starts R 9 Started-by Finishes R 0 R Finished by R Euals R 3 - the set of t temporal intervals which correspond to the domain events; P - the semantic predicate which defines piece of knowledge about temporal relationships in the basic domain by the following relation between the sets, R and S:, if the knowledge source Si uses Rk P ( a, Rk, b, Si) = to describe relation between a and b; 0, otherwise. 3. Deriving Most Supported Expert Opinion o derive most supported opinion among all the experts about temporal relation we first construct the RM matrix r m which defines relationship between the relations sets R and M as it is shown in able 3 by the following way: R R, M M(( R M ) RM ) k k k, ;

4 able 3. he RM-matrix Relationships between Allen s basic temporal intervals relations and endpoints relations RM M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M R R R R R R R R R R R R R he techniue of deriving the most supported opinion concerning certain pair a and b of events is the following. he experts give their votes concerning use of each temporal relation from the set R with this pair of events. After that we make the SM a,b matrix n m which defines relationship between the set of knowledge sources S and set of basic relations M for each two fixed temporal intervals a and b by the following way:,, S S, M M, R a b i k ab, a k b i k i, R(( P(, R,, S )& ( R M )) SM ). he techniue takes into account the rank of each expert which defines the weight of this expert vote among all other votes. Let r v i will be the rank of i-th expert before v-th voting ( 0 < ri v < n ). he techniue supposes that each expert rank is initially assigned to one: ri =, i( i =,..., n). We construct the vector VOE a,b which contains results of the current experts voting concerning relation between intervals a and b derived from the matrix SM a,b as follows: ab, ab, ab, VOE = abs( ϕ ψ ), a, b, t,, m, where ab, ϕ = n ri v i, ab i( SM = ) i,, ab, ψ =, n ri v i, ab i( SM = 0) After that we derive MSUP a,b as the vector which contains most supported opinion concerning relation between intervals a and b derived as follows: ab, ab, ab, ( ϕ ψ > 0) MSUP, a, b, t,, m. he number of conflicts con v i between opinion of i-th expert and the most supported opinion is calculated through all set M during the v-th voting: coni v m = ( SMi ab,, MSUP ab, ), ab,, t, i, n, v, his number is used to refine the rank of each expert after certain vote taking into account how close are the opinion of this expert and the most supported opinion. he voting type techniue supposes that the uality of the resulting opinion is better when the number of votes that are eual to the most supported opinion is large. We make the most supported opinion uality Q evaluation by the following way: i,,.

5 Votes accepted as most supported opinion Q = ; All votes Q v ab, = m VOE m n i r ab, 4. Correction rules for the most supported opinion refinement Not every most supported opinion can be accepted as the result because some parts of it may include conflicts. hus we need certain syntactical analysis to handle conflicts using correction rules. We use the following correction rules to check and refine the most supported opinion:. If <all the components from the same group of the most supported opinion are eual to zero>, then <that one which has the least vote should be changed to one>. ab, ab,, t, hh, 4, (( MSUP, Group)& &( s Grouph( VOE = ab, = min( VOEGroup )))) MSUPs ab,. h. If <all the components from the same group of the most supported opinion are eual to zero and more then one of them has minimal vote in the group>, then <that one which corresponds to the relation of euivalence between temporal points should be changed to one>. ab,, t, hh, 4, (( Grouph ={,, 3} )& ab, ab, &( MSUP, Group )&((( VOE = v i. s ab, h ab, ab, ab, 3 ab, ab, ab, = VOE ) VOE ) OR(( VOE = = VOE ) VOE ))) MSUP If <there are more than one components from the same group of the most supported opinion which are eual to one>, then <that one which has the least vote should be changed to zero>.,, a, b, t, h, h 4, (( MSUP & MSUP,, s s ab ab ab, ab, ab, Grouph)& ( VOEs < VOE )) MSUPs. 4. If <there are more than one eual to one components from the same group of the most supported opinion including the last one and they have the same vote>, h then <those ones which are not correspond to the relation of euivalence between temporal points should be changed to zero>. { } a, b, t, h, h 4, (( Grouph =,, 3 )&( s ab,, Group )& ( MSUP & MSUP & h 3 s ab 3 ab, s ab, s ab, & ( VOE = VOE ))) MSUP Reuirements to the expert s ranking (refinement strategy) Mechanism of expert ranking is used to improve results of voting type processing of the multiple experts knowledge. he main formula used to refine ranks is the following: r + = r + r i v i v i v µ ( µ con ), where r = δ, m ( ), µ v n = v j n n con. v ri v n ri v δ i = i v i v v v his formula is based on the following strategy of refinement ranks: All the experts have the same initial rank, eual to. After each vote the rank of each expert should be recalculated. An expert improves his rank after some vote if his opinion has less conflicts with the most supported one than the average number of conflicts among all the experts. Otherwise he loses some part of his rank. An expert s rank should not be changed after some vote if expert does not participate it or his opinion has as many conflicts with the most supported one as the average number of conflicts among all the experts. An expert s rank should always be more than zero and less than number of experts. he value of punishment (prize) for presence (absence) of each conflict should be maximal for expert with rank eual to n/ (n - number of experts). he value of punishment (or prize) for presence (or absence) of each conflict should be aspire to zero for expert whose rank is close to zero or to n. 6. Example of deriving the most supported expert opinion In this chapter we will consider the example of deriving the most supported opinion of four experts concerning a temporal relation. Let the four experts are asked to express their opinion about temporal relation between two abstract temporal intervals: first vote - between intervals j i v

6 and ; second vote - between intervals 3 and 4 ; third vote - between intervals 5 and 6. We supposed that ranks of all experts at the very beginning (before the first vote) is eual to one. Let the experts express their opinions during the first vote by the following way: Expert : during. Expert : overlaps. Expert 3: starts. Expert 4: finished by. he results of deriving the most supported opinion for the first vote are presented in able 4. able 4. he example (first vote) SM, M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R 5 ) S (R 7 ) S 3 (R 9 ) S 4 (R ) VOE MSUP Correction Results: Most supported opinion: overlaps. otal votes: 48 Positive votes: 36 Quality: 0.75 Expert ranking in the example will changed after the first vote as it is shown in able 5. able 5. Ranks refinement in the example (after first vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported Expert Number of conflicts con i Ranks refinement Rank before voting r i Rank add (lost) r i Rank after voting r i Expert Expert Expert Expert Average.5 0

7 Let the experts express their opinions during the second vote by the following way: Expert : 3 after 4 (r = ). Expert : 3 meets 4 (r =.875). Expert 3: 3 overlapped by 4 (r 3 = ). Expert 4: 3 before 4 (r 4 = ). he results of deriving the most supported opinion for the second vote are presented in able 6. able 6. he example (second vote) SM 3,4 M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R ) S (R 3 ) S 3 (R 8 ) S 4 (R ) VOE MSUP Correction Results: Most supported opinion: 3 overlaps 4. otal votes: 48 Positive votes: Quality: Expert ranking in the example will changed after the second vote as it is shown in able 7. able 7. Ranks refinement in the example (after second vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported Ranks refinement Expert con i δ i r i r i r 3 i Expert Expert Expert Expert Average

8 Let the experts express their opinions during the third vote by the following way: Expert : 5 includes 6 (r 3 = 0.397). Expert : 5 finished by 6 (r 3 =.6745). Expert 3: 5 after 6 (r 3 3 = ). Expert 4: 5 overlapped by 6 (r 3 4 =.356). he results of deriving the most supported opinion for the third vote are presented in able 8. able 8. he example (third vote) SM 5,6 M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R 6 ) S (R ) S 3 (R ) S 4 (R 8 ) VOE MSUP Correction Results: Most supported opinion: 5 overlapped by 6. otal votes: Positive votes: Quality: Expert ranking in the example will changed after the third vote as it is shown in able 9. able 9. Ranks refinement in the example (after third vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported Ranks refinement Expert con 3 i δ i 3 r 3 i r 3 i r 4 i Expert Expert Expert Expert Average One can see that after third vote the rank of first expert is such that he cannot essentially effect the most supported opinion. he rank of the fourth expert makes his opinion the most weighty among all the experts.

9 However it also obvious that he can lose his rank in future if all other experts will vote similarly against his opinion. 7. Example of changing the order of the domain description In this chapter we will consider the same example with same temporal intervals - 6. We will change only the order of the domain description using the same opinions of the same experts. We first consider the case of description of the temporal relation between intervals 5 and 6, then between intervals 3 and 4, and then between intervals and. he goal of such attempt is to analyse the differences in the resulting experts ranks in both examples. he results of deriving the most supported opinion and results of the experts ranks refinement for the firstthird vote in the reverse-order example are presented in ables 0-5. able 0. he reverse example (first vote) SM 5,6 M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R 6 ) S (R ) S 3 (R ) S 4 (R 8 ) VOE MSUP Correction * * Results: Most supported opinion: 5 includes 6 or 5 overlapped by 6. otal votes: 48 Positive votes: 3 Quality: 0.67 able. Ranks refinement in the reverse example (after first vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported * * Ranks refinement Number of Rank before voting Rank add (lost) Rank after voting Expert conflicts con i r i r i r i Expert Expert Expert Expert Average 0

10 able. he reverse example (second vote) SM 3,4 M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R ) S (R 3 ) S 3 (R 8 ) S 4 (R ) VOE MSUP Correction * * * * 0 Results: Most supported opinion: 3 during 4 or 3 includes 4 or 3 overlaps 4 or 3 overlapped by 4. otal votes: 48 Positive votes: 9.66 Quality: 0.4 able 3. Ranks refinement in the reverse example (after second vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported * * * * 0 Ranks refinement Expert con i δ i r i r i r 3 i Expert Expert Expert Expert Average

11 able 4. he reverse example (third vote) SM, M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M S (R 5 ) S (R 7 ) S 3 (R 9 ) S 4 (R ) VOE MSUP Correction Results: Most supported opinion: overlaps. otal votes: Positive votes: Quality: able 5. Ranks refinement in the reverse example (after third vote) Opinions M M M 3 M 4 M 5 M 6 M 7 M 8 M 9 M 0 M M Expert Expert Expert Expert Most supported Ranks refinement Expert con 3 i δ i 3 r 3 i r 3 i r 4 i Expert Expert Expert Expert Average

12 One can see that the situation is changed almost totally. he first and the second votes in the reverse example have ambiguity in the selection of the most supported opinion. his happened because no one of the correction rules can be applied. One interesting fact that the second vote gave four alternatives and three of them are different from the initial opinions of experts. he resulting rank of each expert is also depends on the order of the domain description. he continuation of the experiment with the computer has been made so that new experts ranks obtained after three votes were applied with the same domain and the same order. Such iterative process of the same domain description leads after several steps to an uniue relation for each domain pair. 8. Conclusion he method can also be used to derive the most supported knowledge in domains that have a well-defined set of basic relations (such as the set M) and a set of compound relations (such as the set R). In those cases, experts are allowed to give incomplete or incorrect knowledge about a relation from the set R because it can be handled by deriving the most supported opinion of multiple experts through the set M. Ranking techniue in this research supports experts whose opinion is close to the most supported one. It even may happen that only one expert remains after several votes whose rank becomes more than all other ranks together. In many applications, the most supported knowledge is not the best one. Moreover the talent individuals can easily lose their rank if they are thinking not like others. hat is why method should be developed to pick up and classify experts whose opinions are the most different from the most supported opinion, and then try to take them into account. he uestion is also open is it good or not that the order of describing domain events effects the result of expert ranking. If one will continue the example further then he can see, that if the order of voting will changed again then ranks of experts after every three votes will be different. References. Allen, J.F., Maintaining Knowledge About emporal Intervals, Communications of the ACM, V.6, No., 983, pp Allen, J.F., emporal Reasoning and Planning, In: Allen J.F. (ed.), Reasoning About Plans, Morgan Kaufmann, San Mateo, 99, pp Allen, J.F., owards a General heory of Action and ime, Artificial Intelligence, V.3, No., 984, pp Allen, J.F. and Koomen, J.A., Planning Using a emporal World Model, In: Proceedings of the 8 th International Joint Conference on Artificial Intelligence, Karlsruhe, 983, pp Barrett, A.R. and Edwards, J.S., Knowledge Elicitation and Knowledge Representation in a Large Domain with Multiple Experts, Expert Systems with Applications, Pergamon, V.8, No., 995, pp Mak, B., Bui,. and Blanning, R., Aggregating and Updating Experts Knowledge: An Experimental Evaluation of Five Classification echniues, Expert Systems with Applications, Pergamon, V.0, No., 996, pp Medsker, L., an, M. and urban, E., Knowledge Acuisition from Multiple Experts: Problems and Issues, Expert Systems with Applications, Pergamon, V.9, No., 995, pp Nokel, K., emporally Distributed Symptoms in echnical Diagnosis, Lecture Notes in Artificial Intelligence, V.57, Springer-Verlag, Roos, N., A Logic for Reasoning with Inconsistent Knowledge, Artificial Intelligence, Elsevier, V.57, No., 99, pp Song, F. and Cohen, R., he Interpretation of emporal Relations in Narrative, In: Proceedings of the 7 th National Conference of the American Association for Artificial Intelligence, Saint Paul, 988, pp aylor, W.A., Weimann, D.H. and Martin, P.J., Knowledge Acuisition and Synthesis in a Multiple Source Multiple Domain Process Context, Expert Systems with Applications, Pergamon, V.8, No., 995, pp Weida, R. and Litman D., erminological Reasoning with Constraint Networks and an Application to Plan Recognition, In: Nebel B., Swartout W. and Rich C. (eds), Principles of Knowledge Representation and Reasoning: Proceedings of the 3 rd International Conference, Cambridge, 99, pp

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural

More information

Interpreting Low and High Order Rules: A Granular Computing Approach

Interpreting Low and High Order Rules: A Granular Computing Approach Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:

More information

Vote. Vote on timing for night section: Option 1 (what we have now) Option 2. Lecture, 6:10-7:50 25 minute dinner break Tutorial, 8:15-9

Vote. Vote on timing for night section: Option 1 (what we have now) Option 2. Lecture, 6:10-7:50 25 minute dinner break Tutorial, 8:15-9 Vote Vote on timing for night section: Option 1 (what we have now) Lecture, 6:10-7:50 25 minute dinner break Tutorial, 8:15-9 Option 2 Lecture, 6:10-7 10 minute break Lecture, 7:10-8 10 minute break Tutorial,

More information

Preferred Mental Models in Qualitative Spatial Reasoning: A Cognitive Assessment of Allen s Calculus

Preferred Mental Models in Qualitative Spatial Reasoning: A Cognitive Assessment of Allen s Calculus Knauff, M., Rauh, R., & Schlieder, C. (1995). Preferred mental models in qualitative spatial reasoning: A cognitive assessment of Allen's calculus. In Proceedings of the Seventeenth Annual Conference of

More information

An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints

An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints Salem Benferhat and Sylvain Lagrue and Julien Rossit CRIL - Université d Artois Faculté des Sciences Jean Perrin Rue Jean

More information

Selection of Classifiers based on Multiple Classifier Behaviour

Selection of Classifiers based on Multiple Classifier Behaviour Selection of Classifiers based on Multiple Classifier Behaviour Giorgio Giacinto, Fabio Roli, and Giorgio Fumera Dept. of Electrical and Electronic Eng. - University of Cagliari Piazza d Armi, 09123 Cagliari,

More information

Parts 3-6 are EXAMPLES for cse634

Parts 3-6 are EXAMPLES for cse634 1 Parts 3-6 are EXAMPLES for cse634 FINAL TEST CSE 352 ARTIFICIAL INTELLIGENCE Fall 2008 There are 6 pages in this exam. Please make sure you have all of them INTRODUCTION Philosophical AI Questions Q1.

More information

Expressiveness, decidability, and undecidability of Interval Temporal Logic

Expressiveness, decidability, and undecidability of Interval Temporal Logic University of Udine Department of Mathematics and Computer Science Expressiveness, decidability, and undecidability of Interval Temporal Logic ITL - Beyond the end of the light Ph.D. Defence Dario Della

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!

More information

EVALUATING MISCLASSIFICATION PROBABILITY USING EMPIRICAL RISK 1. Victor Nedel ko

EVALUATING MISCLASSIFICATION PROBABILITY USING EMPIRICAL RISK 1. Victor Nedel ko 94 International Journal "Information Theories & Applications" Vol13 [Raudys, 001] Raudys S, Statistical and neural classifiers, Springer, 001 [Mirenkova, 00] S V Mirenkova (edel ko) A method for prediction

More information

Temporal Relation primitives. based on fuzzy relations

Temporal Relation primitives. based on fuzzy relations Temporal Relation primitives based on fuzzy relations Contents Contents Requests Temporal relation primitives Discussion Temporal primitives Main conditions Minor conditions Complements and hypotheses

More information

Tutorial on Venn-ABERS prediction

Tutorial on Venn-ABERS prediction Tutorial on Venn-ABERS prediction Paolo Toccaceli (joint work with Alex Gammerman and Ilia Nouretdinov) Computer Learning Research Centre Royal Holloway, University of London 6th Symposium on Conformal

More information

A Fixed Point Representation of References

A Fixed Point Representation of References A Fixed Point Representation of References Susumu Yamasaki Department of Computer Science, Okayama University, Okayama, Japan yamasaki@momo.cs.okayama-u.ac.jp Abstract. This position paper is concerned

More information

Bayesian Knowledge Fusion

Bayesian Knowledge Fusion Bayesian Knowledge Fusion Eugene Santos Jr. and John T. Wilkinson Thayer School of Engineering Dartmouth College Hanover, NH 03755-8000 Eunice E. Santos Department of Computer Science Virginia Polytechnic

More information

43400 Serdang Selangor, Malaysia Serdang Selangor, Malaysia 4

43400 Serdang Selangor, Malaysia Serdang Selangor, Malaysia 4 An Extended ID3 Decision Tree Algorithm for Spatial Data Imas Sukaesih Sitanggang # 1, Razali Yaakob #2, Norwati Mustapha #3, Ahmad Ainuddin B Nuruddin *4 # Faculty of Computer Science and Information

More information

1 Overview. 2 Learning from Experts. 2.1 Defining a meaningful benchmark. AM 221: Advanced Optimization Spring 2016

1 Overview. 2 Learning from Experts. 2.1 Defining a meaningful benchmark. AM 221: Advanced Optimization Spring 2016 AM 1: Advanced Optimization Spring 016 Prof. Yaron Singer Lecture 11 March 3rd 1 Overview In this lecture we will introduce the notion of online convex optimization. This is an extremely useful framework

More information

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

COMP219: Artificial Intelligence. Lecture 19: Logic for KR COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof

More information

The Perceptron. Volker Tresp Summer 2014

The Perceptron. Volker Tresp Summer 2014 The Perceptron Volker Tresp Summer 2014 1 Introduction One of the first serious learning machines Most important elements in learning tasks Collection and preprocessing of training data Definition of a

More information

Machine Learning Techniques

Machine Learning Techniques Machine Learning Techniques ( 機器學習技法 ) Lecture 15: Matrix Factorization Hsuan-Tien Lin ( 林軒田 ) htlin@csie.ntu.edu.tw Department of Computer Science & Information Engineering National Taiwan University

More information

CS 188: Artificial Intelligence. Outline

CS 188: Artificial Intelligence. Outline CS 188: Artificial Intelligence Lecture 21: Perceptrons Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein. Outline Generative vs. Discriminative Binary Linear Classifiers Perceptron Multi-class

More information

Guarded resolution for Answer Set Programming

Guarded resolution for Answer Set Programming Under consideration for publication in Theory and Practice of Logic Programming 1 Guarded resolution for Answer Set Programming V.W. Marek Department of Computer Science, University of Kentucky, Lexington,

More information

Similarity-based Classification with Dominance-based Decision Rules

Similarity-based Classification with Dominance-based Decision Rules Similarity-based Classification with Dominance-based Decision Rules Marcin Szeląg, Salvatore Greco 2,3, Roman Słowiński,4 Institute of Computing Science, Poznań University of Technology, 60-965 Poznań,

More information

Notes on Discriminant Functions and Optimal Classification

Notes on Discriminant Functions and Optimal Classification Notes on Discriminant Functions and Optimal Classification Padhraic Smyth, Department of Computer Science University of California, Irvine c 2017 1 Discriminant Functions Consider a classification problem

More information

Decision procedure for Default Logic

Decision procedure for Default Logic Decision procedure for Default Logic W. Marek 1 and A. Nerode 2 Abstract Using a proof-theoretic approach to non-monotone reasoning we introduce an algorithm to compute all extensions of any (propositional)

More information

Nested Epistemic Logic Programs

Nested Epistemic Logic Programs Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and

More information

The Perceptron. Volker Tresp Summer 2016

The Perceptron. Volker Tresp Summer 2016 The Perceptron Volker Tresp Summer 2016 1 Elements in Learning Tasks Collection, cleaning and preprocessing of training data Definition of a class of learning models. Often defined by the free model parameters

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

Iterative Laplacian Score for Feature Selection

Iterative Laplacian Score for Feature Selection Iterative Laplacian Score for Feature Selection Linling Zhu, Linsong Miao, and Daoqiang Zhang College of Computer Science and echnology, Nanjing University of Aeronautics and Astronautics, Nanjing 2006,

More information

Principles of AI Planning

Principles of AI Planning Principles of 5. Planning as search: progression and regression Malte Helmert and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 4th, 2010 Planning as (classical) search Introduction Classification

More information

-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY.

-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY. -1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY. Abstract. Consider the question of assigning a probabilistic valuation

More information

Convex Hull-Based Metric Refinements for Topological Spatial Relations

Convex Hull-Based Metric Refinements for Topological Spatial Relations ABSTRACT Convex Hull-Based Metric Refinements for Topological Spatial Relations Fuyu (Frank) Xu School of Computing and Information Science University of Maine Orono, ME 04469-5711, USA fuyu.xu@maine.edu

More information

Effect of Rule Weights in Fuzzy Rule-Based Classification Systems

Effect of Rule Weights in Fuzzy Rule-Based Classification Systems 506 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 9, NO. 4, AUGUST 2001 Effect of Rule Weights in Fuzzy Rule-Based Classification Systems Hisao Ishibuchi, Member, IEEE, and Tomoharu Nakashima, Member, IEEE

More information

Assignment 1. Learning distributed word representations. Jimmy Ba

Assignment 1. Learning distributed word representations. Jimmy Ba Assignment 1 Learning distributed word representations Jimmy Ba csc321ta@cstorontoedu Background Text and language play central role in a wide range of computer science and engineering problems Applications

More information

Short Note: Naive Bayes Classifiers and Permanence of Ratios

Short Note: Naive Bayes Classifiers and Permanence of Ratios Short Note: Naive Bayes Classifiers and Permanence of Ratios Julián M. Ortiz (jmo1@ualberta.ca) Department of Civil & Environmental Engineering University of Alberta Abstract The assumption of permanence

More information

Belief revision: A vade-mecum

Belief revision: A vade-mecum Belief revision: A vade-mecum Peter Gärdenfors Lund University Cognitive Science, Kungshuset, Lundagård, S 223 50 LUND, Sweden Abstract. This paper contains a brief survey of the area of belief revision

More information

Qualitative Temporal Reasoning about Vague Events

Qualitative Temporal Reasoning about Vague Events Qualitative Temporal Reasoning about Vague Events Steven Schockaert, Martine De Cock, Etienne E. Kerre Ghent University Department of Applied Mathematics and Computer Science {Steven.Schockaert,Martine.DeCock,Etienne.Kerre}@UGent.be

More information

Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment

Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment International Journal of General Systems, 2013 Vol. 42, No. 4, 386 394, http://dx.doi.org/10.1080/03081079.2012.761609 Multicriteria decision-making method using the correlation coefficient under single-valued

More information

ARTIFICIAL INTELLIGENCE. Artificial Neural Networks

ARTIFICIAL INTELLIGENCE. Artificial Neural Networks INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Artificial Neural Networks Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html

More information

TDT4173 Machine Learning

TDT4173 Machine Learning TDT4173 Machine Learning Lecture 3 Bagging & Boosting + SVMs Norwegian University of Science and Technology Helge Langseth IT-VEST 310 helgel@idi.ntnu.no 1 TDT4173 Machine Learning Outline 1 Ensemble-methods

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

Outline: Ensemble Learning. Ensemble Learning. The Wisdom of Crowds. The Wisdom of Crowds - Really? Crowd wiser than any individual

Outline: Ensemble Learning. Ensemble Learning. The Wisdom of Crowds. The Wisdom of Crowds - Really? Crowd wiser than any individual Outline: Ensemble Learning We will describe and investigate algorithms to Ensemble Learning Lecture 10, DD2431 Machine Learning A. Maki, J. Sullivan October 2014 train weak classifiers/regressors and how

More information

CC283 Intelligent Problem Solving 28/10/2013

CC283 Intelligent Problem Solving 28/10/2013 Machine Learning What is the research agenda? How to measure success? How to learn? Machine Learning Overview Unsupervised Learning Supervised Learning Training Testing Unseen data Data Observed x 1 x

More information

Predictive analysis on Multivariate, Time Series datasets using Shapelets

Predictive analysis on Multivariate, Time Series datasets using Shapelets 1 Predictive analysis on Multivariate, Time Series datasets using Shapelets Hemal Thakkar Department of Computer Science, Stanford University hemal@stanford.edu hemal.tt@gmail.com Abstract Multivariate,

More information

Many-Valued Non-Monotonic Modal Logics

Many-Valued Non-Monotonic Modal Logics Many-Valued Non-Monotonic Modal Logics Melvin Fitting mlflc@cunyvm.cuny.edu Dept. Mathematics and Computer Science Lehman College (CUNY), Bronx, NY 10468 Depts. Computer Science, Philosophy, Mathematics

More information

Weak Composition for Qualitative Spatial and Temporal Reasoning

Weak Composition for Qualitative Spatial and Temporal Reasoning Weak Composition for Qualitative Spatial and Temporal Reasoning Jochen Renz 1 and Gérard Ligozat 2 1 National ICT Australia, Knowledge Representation and Reasoning Group UNSW Sydney, NSW 2052, Australia

More information

Measuring the Good and the Bad in Inconsistent Information

Measuring the Good and the Bad in Inconsistent Information Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Measuring the Good and the Bad in Inconsistent Information John Grant Department of Computer Science, University

More information

Probabilistic Bisimilarity as Testing Equivalence

Probabilistic Bisimilarity as Testing Equivalence Probabilistic Bisimilarity as Testing Equivalence Yuxin Deng a,, Yuan Feng b a Shanghai Key Laboratory of Trustworthy Computing, MOE International Joint Lab of Trustworthy Software, and International Research

More information

Fuzzy Systems. Introduction

Fuzzy Systems. Introduction Fuzzy Systems Introduction Prof. Dr. Rudolf Kruse Christian Moewes {kruse,cmoewes}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge

More information

Keeping interval-based functional dependencies up-to-date

Keeping interval-based functional dependencies up-to-date Keeping interval-based functional dependencies up-to-date Carlo Combi and Pietro Sala Department of Computer Science, University of Verona {carlo.combi pietro.sala} @univr.it Abstract. In the temporal

More information

Induction of Decision Trees

Induction of Decision Trees Induction of Decision Trees Peter Waiganjo Wagacha This notes are for ICS320 Foundations of Learning and Adaptive Systems Institute of Computer Science University of Nairobi PO Box 30197, 00200 Nairobi.

More information

Propositional Logic: Semantics

Propositional Logic: Semantics Propositional Logic: Semantics Alice Gao Lecture 4, September 19, 2017 Semantics 1/56 Announcements Semantics 2/56 The roadmap of propositional logic Semantics 3/56 FCC spectrum auction an application

More information

CS540 ANSWER SHEET

CS540 ANSWER SHEET CS540 ANSWER SHEET Name Email 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 1 2 Final Examination CS540-1: Introduction to Artificial Intelligence Fall 2016 20 questions, 5 points

More information

Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification

Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification Computational Intelligence Lecture 3: Simple Neural Networks for Pattern Classification Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi

More information

Learning with multiple models. Boosting.

Learning with multiple models. Boosting. CS 2750 Machine Learning Lecture 21 Learning with multiple models. Boosting. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Learning with multiple models: Approach 2 Approach 2: use multiple models

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More information

Chapter 2 The Naïve Bayes Model in the Context of Word Sense Disambiguation

Chapter 2 The Naïve Bayes Model in the Context of Word Sense Disambiguation Chapter 2 The Naïve Bayes Model in the Context of Word Sense Disambiguation Abstract This chapter discusses the Naïve Bayes model strictly in the context of word sense disambiguation. The theoretical model

More information

Moving Average Rules to Find. Confusion Matrix. CC283 Intelligent Problem Solving 05/11/2010. Edward Tsang (all rights reserved) 1

Moving Average Rules to Find. Confusion Matrix. CC283 Intelligent Problem Solving 05/11/2010. Edward Tsang (all rights reserved) 1 Machine Learning Overview Supervised Learning Training esting Te Unseen data Data Observed x 1 x 2... x n 1.6 7.1... 2.7 1.4 6.8... 3.1 2.1 5.4... 2.8... Machine Learning Patterns y = f(x) Target y Buy

More information

Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees

Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees Tomasz Maszczyk and W lodzis law Duch Department of Informatics, Nicolaus Copernicus University Grudzi adzka 5, 87-100 Toruń, Poland

More information

Rule-Based Classifiers

Rule-Based Classifiers Rule-Based Classifiers For completeness, the table includes all 16 possible logic functions of two variables. However, we continue to focus on,,, and. 1 Propositional Logic Meta-theory. Inspection of a

More information

Intro. ANN & Fuzzy Systems. Lecture 38 Mixture of Experts Neural Network

Intro. ANN & Fuzzy Systems. Lecture 38 Mixture of Experts Neural Network Lecture 38 Mixture of Experts Neural Network Outline Committee Classifier Linear Committee Classifiers General Committee Classifiers Mixture of Experts Based Approach Gating Network Design Procedure Examples

More information

An Inquisitive Formalization of Interrogative Inquiry

An Inquisitive Formalization of Interrogative Inquiry An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

Data Mining und Maschinelles Lernen

Data Mining und Maschinelles Lernen Data Mining und Maschinelles Lernen Ensemble Methods Bias-Variance Trade-off Basic Idea of Ensembles Bagging Basic Algorithm Bagging with Costs Randomization Random Forests Boosting Stacking Error-Correcting

More information

Fuzzy Systems. Introduction

Fuzzy Systems. Introduction Fuzzy Systems Introduction Prof. Dr. Rudolf Kruse Christoph Doell {kruse,doell}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge Processing

More information

PROBABILISTIC LOGIC. J. Webster (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering Copyright c 1999 John Wiley & Sons, Inc.

PROBABILISTIC LOGIC. J. Webster (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering Copyright c 1999 John Wiley & Sons, Inc. J. Webster (ed.), Wiley Encyclopedia of Electrical and Electronics Engineering Copyright c 1999 John Wiley & Sons, Inc. PROBABILISTIC LOGIC A deductive argument is a claim of the form: If P 1, P 2,...,andP

More information

Classification Based on Logical Concept Analysis

Classification Based on Logical Concept Analysis Classification Based on Logical Concept Analysis Yan Zhao and Yiyu Yao Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2 E-mail: {yanzhao, yyao}@cs.uregina.ca Abstract.

More information

Local Feature Extraction Models from Incomplete Data in Face Recognition Based on Nonnegative Matrix Factorization

Local Feature Extraction Models from Incomplete Data in Face Recognition Based on Nonnegative Matrix Factorization American Journal of Software Engineering and Applications 2015; 4(3): 50-55 Published online May 12, 2015 (http://www.sciencepublishinggroup.com/j/ajsea) doi: 10.11648/j.ajsea.20150403.12 ISSN: 2327-2473

More information

Last updated: Oct 22, 2012 LINEAR CLASSIFIERS. J. Elder CSE 4404/5327 Introduction to Machine Learning and Pattern Recognition

Last updated: Oct 22, 2012 LINEAR CLASSIFIERS. J. Elder CSE 4404/5327 Introduction to Machine Learning and Pattern Recognition Last updated: Oct 22, 2012 LINEAR CLASSIFIERS Problems 2 Please do Problem 8.3 in the textbook. We will discuss this in class. Classification: Problem Statement 3 In regression, we are modeling the relationship

More information

Optimizing Abstaining Classifiers using ROC Analysis. Tadek Pietraszek / 'tʌ dek pɪe 'trʌ ʃek / ICML 2005 August 9, 2005

Optimizing Abstaining Classifiers using ROC Analysis. Tadek Pietraszek / 'tʌ dek pɪe 'trʌ ʃek / ICML 2005 August 9, 2005 IBM Zurich Research Laboratory, GSAL Optimizing Abstaining Classifiers using ROC Analysis Tadek Pietraszek / 'tʌ dek pɪe 'trʌ ʃek / pie@zurich.ibm.com ICML 2005 August 9, 2005 To classify, or not to classify:

More information

) (d o f. For the previous layer in a neural network (just the rightmost layer if a single neuron), the required update equation is: 2.

) (d o f. For the previous layer in a neural network (just the rightmost layer if a single neuron), the required update equation is: 2. 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2011 Recitation 8, November 3 Corrected Version & (most) solutions

More information

CS 6901 (Applied Algorithms) Lecture 3

CS 6901 (Applied Algorithms) Lecture 3 CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar

More information

PRE-AP CHEMISTRY Syllabus

PRE-AP CHEMISTRY Syllabus I. Course Description: This is an accelerated course designed to prepare students for Advanced Placement Chemistry. This introductory course gives a general overview of the study of molecules and their

More information

Introduction to Logic in Computer Science: Autumn 2006

Introduction to Logic in Computer Science: Autumn 2006 Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today The first part of the course will

More information

Game-Theoretic Foundations for Norms

Game-Theoretic Foundations for Norms Game-Theoretic Foundations for Norms Guido Boella Dipartimento di Informatica Università di Torino-Italy E-mail: guido@di.unito.it Leendert van der Torre Department of Computer Science University of Luxembourg

More information

CSCI-567: Machine Learning (Spring 2019)

CSCI-567: Machine Learning (Spring 2019) CSCI-567: Machine Learning (Spring 2019) Prof. Victor Adamchik U of Southern California Mar. 19, 2019 March 19, 2019 1 / 43 Administration March 19, 2019 2 / 43 Administration TA3 is due this week March

More information

Feature Engineering, Model Evaluations

Feature Engineering, Model Evaluations Feature Engineering, Model Evaluations Giri Iyengar Cornell University gi43@cornell.edu Feb 5, 2018 Giri Iyengar (Cornell Tech) Feature Engineering Feb 5, 2018 1 / 35 Overview 1 ETL 2 Feature Engineering

More information

Day 6: Classification and Machine Learning

Day 6: Classification and Machine Learning Day 6: Classification and Machine Learning Kenneth Benoit Essex Summer School 2014 July 30, 2013 Today s Road Map The Naive Bayes Classifier The k-nearest Neighbour Classifier Support Vector Machines (SVMs)

More information

Data Warehousing & Data Mining

Data Warehousing & Data Mining 13. Meta-Algorithms for Classification Data Warehousing & Data Mining Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13.

More information

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z )

What happens to the value of the expression x + y every time we execute this loop? while x>0 do ( y := y+z ; x := x:= x z ) Starter Questions Feel free to discuss these with your neighbour: Consider two states s 1 and s 2 such that s 1, x := x + 1 s 2 If predicate P (x = y + 1) is true for s 2 then what does that tell us about

More information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

Gaussian and Linear Discriminant Analysis; Multiclass Classification

Gaussian and Linear Discriminant Analysis; Multiclass Classification Gaussian and Linear Discriminant Analysis; Multiclass Classification Professor Ameet Talwalkar Slide Credit: Professor Fei Sha Professor Ameet Talwalkar CS260 Machine Learning Algorithms October 13, 2015

More information

Alpha-Beta Pruning: Algorithm and Analysis

Alpha-Beta Pruning: Algorithm and Analysis Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person

More information

Stat 406: Algorithms for classification and prediction. Lecture 1: Introduction. Kevin Murphy. Mon 7 January,

Stat 406: Algorithms for classification and prediction. Lecture 1: Introduction. Kevin Murphy. Mon 7 January, 1 Stat 406: Algorithms for classification and prediction Lecture 1: Introduction Kevin Murphy Mon 7 January, 2008 1 1 Slides last updated on January 7, 2008 Outline 2 Administrivia Some basic definitions.

More information

Principles of AI Planning

Principles of AI Planning Principles of AI Planning 5. Planning as search: progression and regression Albert-Ludwigs-Universität Freiburg Bernhard Nebel and Robert Mattmüller October 30th, 2013 Introduction Classification Planning

More information

BIODIVERSITY IN LEAF LITTER

BIODIVERSITY IN LEAF LITTER BIODIVERSITY IN LEAF LITTER PURPOSE: The purpose of this lab is to measure the biodiversity of organisms found in a sample of leaf litter. Species diversity is a characteristic that is unique to a community

More information

Face Recognition. Face Recognition. Subspace-Based Face Recognition Algorithms. Application of Face Recognition

Face Recognition. Face Recognition. Subspace-Based Face Recognition Algorithms. Application of Face Recognition ace Recognition Identify person based on the appearance of face CSED441:Introduction to Computer Vision (2017) Lecture10: Subspace Methods and ace Recognition Bohyung Han CSE, POSTECH bhhan@postech.ac.kr

More information

Propositional Logic Logical Implication (4A) Young W. Lim 4/21/17

Propositional Logic Logical Implication (4A) Young W. Lim 4/21/17 Propositional Logic Logical Implication (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation

More information

A Split-combination Method for Merging Inconsistent Possibilistic Knowledge Bases

A Split-combination Method for Merging Inconsistent Possibilistic Knowledge Bases A Split-combination Method for Merging Inconsistent Possibilistic Knowledge Bases Guilin Qi 1,2, Weiru Liu 1, David H. Glass 2 1 School of Computer Science Queen s University Belfast, Belfast BT7 1NN 2

More information

Knowledge Extraction from DBNs for Images

Knowledge Extraction from DBNs for Images Knowledge Extraction from DBNs for Images Son N. Tran and Artur d Avila Garcez Department of Computer Science City University London Contents 1 Introduction 2 Knowledge Extraction from DBNs 3 Experimental

More information

International Journal "Information Theories & Applications" Vol.14 /

International Journal Information Theories & Applications Vol.14 / International Journal "Information Theories & Applications" Vol.4 / 2007 87 or 2) Nˆ t N. That criterion and parameters F, M, N assign method of constructing sample decision function. In order to estimate

More information

Uncertainty in Spatial Data Mining and Its Propagation

Uncertainty in Spatial Data Mining and Its Propagation Uncertainty in Mining and Its Propagation Abstract Binbin He 1,2, Tao Fang 2, Dazhi Guo 1 and Jiang Yun 1 1 School of Environment & Informatics, China University of Mining and Technology, Xuzhou, JiangSu,

More information

TUTORIAL Temporal Representation and Reasoning in Interval Temporal Logics. ECAI 2014 Prague, August 18th, 2014

TUTORIAL Temporal Representation and Reasoning in Interval Temporal Logics. ECAI 2014 Prague, August 18th, 2014 TUTORIAL Temporal Representation and Reasoning in Interval Temporal Logics Angelo Montanari Dept. of Mathematics and Computer Science, University of Udine, Italy Pietro Sala Dept. of Computer Science,

More information

Knowledge Discovery Based Query Answering in Hierarchical Information Systems

Knowledge Discovery Based Query Answering in Hierarchical Information Systems Knowledge Discovery Based Query Answering in Hierarchical Information Systems Zbigniew W. Raś 1,2, Agnieszka Dardzińska 3, and Osman Gürdal 4 1 Univ. of North Carolina, Dept. of Comp. Sci., Charlotte,

More information

COMS 4771 Introduction to Machine Learning. Nakul Verma

COMS 4771 Introduction to Machine Learning. Nakul Verma COMS 4771 Introduction to Machine Learning Nakul Verma Announcements HW1 due next lecture Project details are available decide on the group and topic by Thursday Last time Generative vs. Discriminative

More information

INTRODUCTION TO NONMONOTONIC REASONING

INTRODUCTION TO NONMONOTONIC REASONING Faculty of Computer Science Chair of Automata Theory INTRODUCTION TO NONMONOTONIC REASONING Anni-Yasmin Turhan Dresden, WS 2017/18 About the Course Course Material Book "Nonmonotonic Reasoning" by Grigoris

More information

UNCERTAIN REASONING AND DECISION MAKING

UNCERTAIN REASONING AND DECISION MAKING UNCERTAIN REASONING AND DECISION MAKING Qing Zhou The Software Institute of Zhongshan University, Guangzhou, Guangdong, P.R.China, 510275 lnszq@zsulink.zsu.edu.cn Wei Peng Science and Technology Institute

More information

The Perceptron. Volker Tresp Summer 2018

The Perceptron. Volker Tresp Summer 2018 The Perceptron Volker Tresp Summer 2018 1 Elements in Learning Tasks Collection, cleaning and preprocessing of training data Definition of a class of learning models. Often defined by the free model parameters

More information

Transactions on Business and Engineering Intelligent Applications 71

Transactions on Business and Engineering Intelligent Applications 71 Transactions on Business and Engineering Intelligent Applications 71 EVALUATING EFFECTIVENESS OF LINGUISTIC TECHNOLOGIES OF KNOWLEDGE IDENTIFICATION IN TEXT COLLECTIONS Nina Khairova, Gennady Shepelyov,

More information

On minimal models of the Region Connection Calculus

On minimal models of the Region Connection Calculus Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science

More information