Foundations of Knowledge Management Categorization & Formal Concept Analysis
|
|
- Arline Goodman
- 6 years ago
- Views:
Transcription
1 Foundations of Knowledge Management Categorization & How can concepts be formalized? Markus Strohmaier Univ. Ass. / Assistant Professor Knowledge Management Institute Graz University of Technology, Austria markus.strohmaier@tugraz.at web: 1
2 Slides in part based on Gerd Stumme Course at Otto-von-Guericke Universität Magdeburg / Summer Term 2003 ECML PKDD Tutorial Rudolf Wille as Mathematical Theory of Concepts and Concept Hierarchies, In, Eds B. Ganter et al., LNAI 3626, pp1-33, (2005) Further Literature: (Ganter / Stumme) 2
3 Overview Today s Agenda: Categorization & Formal Context Formal Concepts Formal Concept Lattices FCA Implications Constructing Concept Lattices 3
4 Categorization [Mervis Rosch 1981] Intension (Meaning) The specification of those qualities that a thing must have to be a member of the class Extension (the objects in the class) Things that have those qualities 4
5 Categorization [Mervis Rosch 1981] Six salient problems: Arbitrariness of categories. Are there any a priori reasons for dividing objects into categories, or is this division initially arbitrary? Equivalence of category members. Are all category members equally representative of the category as has often been assumed? Determinacy of category membership and representation. Are categories specified by necessary and sufficient conditions for membership? Are boundaries of categories well defined? The nature of abstraction. How much abstraction is required--that is, do we need only memory for individual exemplars to account for categorization? Or, at the other extreme, are higher-order abstractions of general knowledge, beyond the individual categories, necessary? Decomposability of categories into elements. Does a reasonable explanation of objects consist in their decomposition into elementary qualities? The nature of attributes. What are the characteristics of these "attributes into which categories are to be decomposed? 5
6 Terminology ISO 704: Terminology Work: Principles and methods DIN 2330: Begriffe und Ihre Benennungen Representation level Name Definition Concept level Concept attribute a attribute b attribute c Object level Object 1 property A property B property C Object 2 property A property B property C Object 3 property A property B property C 6
7 [Wille 2005] Models concepts as units of thought. A concept is constituted by its: Extension: consists of all objects belonging to a concept Intension: consists of all attributes common to all those objects Concepts live in relationships with many other concepts where the sub-concept-superconcept-relation plays a prominent role. 7
8 Formal context: [Wille 2005] A Formal Context is a tripel (G, M, I) for which G and M are sets while I is a binary relation between G and M. Formal Concept: A formal concept of a formal context K := (G,M, I) is defined as a pair (A,B) with and A = B, and B = A ; A and B are called the extent and the intent of the formal concept (A,B), respectively. 8
9 Running Example: Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, Ich möchte nur darauf hinweisen, daß es eine Zeit gab, in der man die Ähnlichkeit der Empfindungen zur Basis der Kategorisierung von Pflanze und Tier gemacht hat. Man denke [...] an die frühen Taxonomien des Ulisse Aldrovandi aus dem 16. Jahrhundert, der die scheußlichen Tiere (die Spinnen, Molche und Schlagen) und die Schönheiten (die Leoparden, die Adler usw.) zu eigenen Gruppen [von Lebewesen] zusammenfasste. Heinz von Foerster, Wahrheit ist die Erfindung eines Lügners, Page 22/23 [Mervis Rosch 1981] 9
10 Def.: A formal context is a tripel (G,M,I), where G is a set of objects, M is a set of attributes and I is a relation between G and M. Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, (g,m) I is read as object g has attribute m. 10
11 Derivation Operators Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, A G, B M (A Extent, B Intent) all attributes shared by all objects of A all objects having all attributes of B A 1 A 1 The two derivation operators satisfy the follwing 3 conditions: 11
12 Def.: A formal concept is a pair (A,B), with A G, B M A =B and B = A Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, all attributes shared by all objects of A all objects having all attributes of B Intent Set A is called the extent (a set of objects) Set B is called the intent (a set of attributes) Extent Of the formal concept (A,B) 12
13 Sub/Superconcept Relation Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, A G, B M all attributes shared by all objects of A all objects having all attributes of B A 2 A 1 A 2 A 1 The orange concept is a subconcept of the blue one, since its extent is contained in the blue one. (equivalent to the blue intent is contained in the orange one) 13
14 Galois Lattices / Galois Connections 14
15 Concept Lattices Concept Lattices (cf. Galois Lattices) Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, A 2 A 1 A 2 A 1 A1 Extent Intent A2 Formal Concept A1 (A1, A1 ) The set of objects that are yellow, sweet and smooth 15
16 Concept Lattices Concept Lattices (cf. Galois Lattices) Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, A 1 Intent (Attributes) Extent (Objects) A1 A 1 16
17 Concept Lattices Def.: The concept lattice of a formal context (G,M,I) is the set of all formal concepts of (G,M,I), together with the partial order The concept lattice is denoted by B(G,M,I). Theorem: The concept lattice is a lattice, i.e. for two concepts (A 1,B 1 ) and (A 2,B 2 ), there is always a greatest common subconcept and a least common superconcept 17
18 Greatest Common Subconcept Which objects share the attributes smooth and red and sour? A: Grapes, Apples greatest common subconcept (infimum) a greatest common subconcept and a least common superconcept 18
19 Least Common Superconcept Which attributes share the objects strawberries and lemon? A: Bumpy, round least common superconcept (supremum) a greatest common subconcept and a least common superconcept 19
20 Implications Def.: An implication A -> B holds in a context (G, M, I) if every object intent respects A ->B, i.e. if each object that has all the attributes in A also has all the attributes in B. Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, We also say A->B is an implication of (G,M,I). A B B A 20
21 Object count Implications Taste: Sweet/Sour, Shape: Round/Long/, Color: Red/Yellow/.., Texture: Smooth/Bumpy, 21
22 Implications: Applications / AOL Search Query Logs 22
23 Applications / Goal Tagging Implications: 23
24 Applications / Bugs - Bugzilla Implications: 24
25 FCA / Scaling Transforming many-valued into single valued contexts Many-valued contexts Color Shape Taste Texture Apple Lemon Red/ green/ yellow Yellow Round Round Sweet/ sour sour Smooth Bumpy What hasn t been mentioned yet Banana Yellow Long Sweet Smooth Strawberries Red Round Sweet Bumpy Grapes Red/ green Round Sweet/ sour Smooth Pear Yellow Long Sweet Smooth Via Scales S 1 red green yellow Color Shape Taste Texture red green yellow 25
26 Constructing Lattices 26
27 A Naive Approach: Lattice Construction Algorithms Ganter / Stumme
28 Lattice Construction Algorithms Example: (Formal Concepts) Ganter / Stumme
29 A Naive Approach: Lattice Construction Algorithms Ganter / Stumme
30 Lattice Construction Algorithms Example: ({T 2,T 7 },{e}) <= ({T 1,T 2,T 3,T 4,T 5,T 6,T 7 },{0}) Ganter / Stumme 2003 ({0},{a,b,c,d,e}) <= ({T 4 },{a,b,c}) a circle for a concept is always positioned higher than all circles for its proper subconcepts. Ganter / Stumme
31 Lattice Construction Algorithms Example ctd : Ganter / Stumme
32 Tools: E.g. ConExp Networks.tb JaLaBa Further Information FCA Homepage 32
33 ConExp 33
34 Bonus Task Define a Formal Context, for which G >=10, M >=10 and I ~ G + M Use Conexp to Name all elements of G and M (choose plausible G and M) Represent your formal context (choose plausible I) Draw the Concept Lattice Calculate Implications (there should be at least one implication with f>3) Submit The ConExp.cex file that contains your context and the layouted(!) lattice Name the Conexp File using the following Syntax: GWM08-BT1-YOURMATR-YOURLASTNAME.cex To me via using subject [GWM08-BT1-YOURMATR] before the beginning of next week s class 34
35 Any questions? See you next week! 35
Foundations of Knowledge Management Categorization & Formal Concept Analysis
707.009 Foundations of Knowledge Management Categorization & Markus Strohmaier Univ. Ass. / Assistant Professor Knowledge Management Institute Graz University of Technology, Austria e-mail: markus.strohmaier@tugraz.at
More informationWorking with Two-Mode Networks in multiplex
Working with Two-Mode Networks in multiplex Antonio Rivero Ostoic School of Business and Social Sciences Aarhus University October 12, 2016 Social networks are systems defined by a collection of relationships
More informationFormal Concept Analysis
Formal Concept Analysis 2 Closure Systems and Implications 4 Closure Systems Concept intents as closed sets c e b 2 a 1 3 1 2 3 a b c e 20.06.2005 2 Next-Closure was developed by B. Ganter (1984). Itcanbeused
More informationIntroduction to Formal Concept Analysis
Introduction to Formal Concept Analysis 2nd International Conference of Formal Concept Analysis February 23 February 27, 2004 Sydney, Australia 1 Outline for the Tutorial: Presentation Short Break Practical
More informationGeorge J. Klir Radim Belohlavek, Martin Trnecka. State University of New York (SUNY) Binghamton, New York 13902, USA
POSSIBILISTIC INFORMATION: A Tutorial Basic Level in Formal Concept Analysis: Interesting Concepts and Psychological Ramifications George J. Klir Radim Belohlavek, Martin Trnecka State University of New
More informationRule Mining for Many-Valued Implications Using Concept Lattice
Rule Mining for Many-Valued Implications Using Concept Lattice Bhavana Jamalpur 1, Nagendar Yamsani 3 Department of Computer Science and Engineering S R Engineering College Warangal Urban, India bhavana_j@srecwarangal.ac.in,
More informationFormal Concept Analysis in a Nutshell
Outline 1 Concept lattices Data from a hospital Formal definitions More examples Outline 1 Concept lattices Data from a hospital Formal definitions More examples 2 Attribute logic Checking completeness
More informationImplications from data with fuzzy attributes vs. scaled binary attributes
Implications from data with fuzzy attributes vs. scaled binary attributes Radim Bělohlávek, Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email:
More informationOn the Intractability of Computing the Duquenne-Guigues Base
Journal of Universal Computer Science, vol 10, no 8 (2004), 927-933 submitted: 22/3/04, accepted: 28/6/04, appeared: 28/8/04 JUCS On the Intractability of Computing the Duquenne-Guigues Base Sergei O Kuznetsov
More informationConceptual Knowledge Discovery. Data Mining with Formal Concept Analysis. Gerd Stumme. Tutorial at ECML/PKDD Tutorial Formal Concept Analysis
Conceptual Knowledge Discovery Data Mining with Formal Concept Analysis Gerd Stumme Tutorial at ECML/PKDD 2002 Slide 1 1. Introduction 2. Formal Contexts & Concept Lattices 3. Application Examples I 4.
More informationIncremental Computation of Concept Diagrams
Incremental Computation of Concept Diagrams Francesco Kriegel Theoretical Computer Science, TU Dresden, Germany Abstract. Suppose a formal context K = (G, M, I) is given, whose concept lattice B(K) with
More informationInformal Definition: Telling things apart
9. Decision Trees Informal Definition: Telling things apart 2 Nominal data No numeric feature vector Just a list or properties: Banana: longish, yellow Apple: round, medium sized, different colors like
More informationAdding Background Knowledge to Formal Concept Analysis via Attribute Dependency Formulas
Adding Background Knowledge to Formal Concept Analysis via Attribute Dependency Formulas Radim Belohlavek Binghamton University SUNY Binghamton, NY 13902, U. S. A. rbelohla@binghamton.edu Vilem Vychodil
More informationSOME OPEN PROBLEMS IN FORMAL CONCEPT ANALYSIS. Problems presented at ICFCA 2006 in Dresden. Problem 1 (Minimal generators for Boolean layer cakes).
SOME OPEN PROBLEMS IN FORMAL CONCEPT ANALYSIS Abstract. This note intends to collect some open problems in Formal Concept Analysis. The ones below have been presented at the International Conference on
More informationFormal Concept Analysis: Foundations and Applications
Formal Concept Analysis: Foundations and Applications Philippe Balbiani Institut de recherche en informatique de Toulouse Outline Introduction (page 3) Concept lattices of contexts (page 10) Many-valued
More informationAn embedding of ChuCors in L-ChuCors
Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010 27 30 June 2010. An embedding of ChuCors in L-ChuCors Ondrej Krídlo 1,
More informationTriadic Factor Analysis
Triadic Factor Analysis Cynthia Vera Glodeanu Technische Universität Dresden, 01062 Dresden, Germany Cynthia_Vera.Glodeanu@mailbox.tu-dresden.de Abstract. This article is an extension of work which suggests
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationFun with. food. What doesn t belong?
Fun with food What doesn t belong? Table of Contents Fun with Food Eat a Rainbow! Fruits and Veggies Spot the Fruits and Veggies Color by Number Fruit Healthy Food Coloring Page Vegetable Graph Fruit Graph
More informationFORMAL CONCEPT ANALYSIS WITH HIERARCHICALLY ORDERED ATTRIBUTES
International Journal of General Systems, 2004 Vol. 00 (0), pp. 1 12 FORMAL CONCEPT ANALYSIS WITH HIERARCHICALLY ORDERED ATTRIBUTES RADIM BĚLOHLÁVEK a,b, *, VLADIMÍR SKLENÁŘ a and JIŘÍ ZACPAL a a Department
More informationOn Boolean factor analysis with formal concepts as factors
FR-C3-1 SCIS&ISIS2006 @ Tokyo, Japan (September 20-24, 2006 On Boolean factor analysis with formal concepts as factors Radim Bělohlávek and Vilém Vychodil Dept Computer Science, Palacký University, Tomkova
More informationUsing Matrix Decompositions in Formal Concept Analysis
Using Matrix Decompositions in Formal Concept Analysis Vaclav Snasel 1, Petr Gajdos 1, Hussam M. Dahwa Abdulla 1, Martin Polovincak 1 1 Dept. of Computer Science, Faculty of Electrical Engineering and
More informationImplications from data with fuzzy attributes
Implications from data with fuzzy attributes Radim Bělohlávek, Martina Chlupová, and Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic Email: {radim.belohlavek,
More informationAkademie věd. Concept lattices and attribute implications from data with fuzzy attributes
G) Akademie věd České republiky Teze doktorské disertační práce k získání vědeckého titulu doktor věd ve skupine věd fyzikálně-matematické vědy Concept lattices and attribute implications from data with
More informationBuilding an Address Gazetteer on top of an Urban Network Ontology
Advanced Information Systems Laboratory 1st Workshop of COST Action C21: "Ontologies for Urban Development: Interfacing Urban Information Systems" Building an Address Gazetteer on top of an Urban Network
More informationLesson 1: Living things:
C.W Lesson 1: Living things: - Living things: 1-2- 3- - Circle the living things: H.w: workbook page: ( ) 1 H.W - Write these words: Living things People Plant Animal 2 C.W Lesson 2: Properties of living
More informationClosure-based constraints in formal concept analysis
Closure-based constraints in formal concept analysis Radim Belohlavek, Vilem Vychodil Data Analysis and Modeling Laboratory (DAMOL), Dept. Computer Science, Palacky University, Olomouc, Czech Republic;
More informationFrom a Possibility Theory View of Formal Concept Analysis to the Possibilistic Handling of Incomplete and Uncertain Contexts
From a Possibility Theory View of Formal Concept Analysis to the Possibilistic Handling of Incomplete and Uncertain Contexts Zina Ait-Yakoub 1, Yassine Djouadi 2, Didier Dubois 2, and Henri Prade 2 1 Department
More informationFUZZY ATTRIBUTE LOGIC: ATTRIBUTE IMPLICATIONS, THEIR VALIDITY, ENTAILMENT, AND NON-REDUNDANT BASIS 2 PRELIMINARIES
FUZZY ATTRIBUTE LOGIC: ATTRIBUTE IMPLICATIONS, THEIR VALIDITY, ENTAILMENT, AND NON-REDUNDANT BASIS Radim Bělohlávek Vilém Vychodil Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc,
More informationJournal of Computer and System Sciences
Journal of Computer and System Sciences 76 (2010) 3 20 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Discovery of optimal factors in binary
More informationTowards logics for neural conceptors
Towards logics for neural conceptors Till Mossakowski joint work with Razvan Diaconescu and Martin Glauer Otto-von-Guericke-Universität Magdeburg AITP 2018, Aussois, March 30, 2018 Overview 1 Conceptors
More informationarxiv: v1 [cs.ir] 8 Mar 2017
Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields Dmitry I. Ignatov National Research University Higher School of Economics, Moscow dignatov@hse.ru
More informationScienceDirect. Formal Concept Analysis Overview and Applications
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 1258 1267 24th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2013 Formal Concept Analysis
More informationMembership Constraints in Formal Concept Analysis
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Membership Constraints in Formal Concept Analysis Sebastian Rudolph and Christian Săcărea and Diana
More informationError-Tolerant Direct Bases
TECHNISCHE UNIVERSITÄT DRESDEN FAKULTÄT INFORMATIK MASTER THESIS Error-Tolerant Direct Bases by Wenqian Wang June 2013 Supervisor: Advisors: External Advisors: Prof. Dr.-Ing. Franz Baader Dr. rer. nat.
More informationThe Tensor Product as a Lattice of Regular Galois Connections
The Tensor Product as a Lattice of Regular Galois Connections Markus Krötzsch 1 and Grit Malik 2 1 AIFB, Universität Karlsruhe, Germany 2 Institut für Algebra, Technische Universität Dresden, Germany Abstract.
More informationRelational Data, Formal Concept Analysis, and Graded Attributes
Relational Data, Formal Concept Analysis, and Graded Attributes Radim Belohlavek Dept. Systems Science and Industrial Engineering, Binghamton University SUNY Binghamton, NY, 13902, U. S. A., rbelohla@binghamton.edu
More informationSome Relationships Between Fuzzy Sets, Mathematical Morphology, Rough Sets, F-Transforms, and Formal Concept Analysis
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems Vol. 24, Suppl. 2 (December 2016) 1 32 c World Scientific Publishing Company DOI: 10.1142/S0218488516400080 Some Relationships
More informationBasic Concepts of Probability
Probability Probability theory is the branch of math that deals with random events Probability is used to describe how likely a particular outcome is in a random event the probability of obtaining heads
More informationMaking a Weather Wheel
Wie ist heute das Wetter? How is the weather today? Making a Weather Wheel Materials you will need o 1 sheet white cover stock (or other heavy printing paper) o Pattern page o Hole punch o 1 small paper
More informationweather, cloudy, rainy, sunny, snowy, windy
Halifax County Schools 1st Six Weeks Goal 2 Weather The learner will make observations and build an understanding of weather concepts. 2.01 Observe and report daily weather changes throughout the year.
More informationChapter 10. Chapter 10. Multinomial Experiments and. Multinomial Experiments and Contingency Tables. Contingency Tables.
Chapter 10 Multinomial Experiments and Contingency Tables 1 Chapter 10 Multinomial Experiments and Contingency Tables 10-1 1 Overview 10-2 2 Multinomial Experiments: of-fitfit 10-3 3 Contingency Tables:
More information11-2 Multinomial Experiment
Chapter 11 Multinomial Experiments and Contingency Tables 1 Chapter 11 Multinomial Experiments and Contingency Tables 11-11 Overview 11-2 Multinomial Experiments: Goodness-of-fitfit 11-3 Contingency Tables:
More informationMadison County Schools Suggested 3 rd Grade Math Pacing Guide,
Madison County Schools Suggested 3 rd Grade Math Pacing Guide, 2016 2017 The following Standards have changes from the 2015-16 MS College- and Career-Readiness Standards: Significant Changes (ex: change
More informationIntroduction to Randomized Algorithms III
Introduction to Randomized Algorithms III Joaquim Madeira Version 0.1 November 2017 U. Aveiro, November 2017 1 Overview Probabilistic counters Counting with probability 1 / 2 Counting with probability
More informationT02 Tutorial Slides for Week 6
T02 Tutorial Slides for Week 6 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 17 October, 2017
More informationSection 7.1: Functions Defined on General Sets
Section 7.1: Functions Defined on General Sets In this chapter, we return to one of the most primitive and important concepts in mathematics - the idea of a function. Functions are the primary object of
More informationCorrelations to the Common Core State Standards: Kindergarten
Correlations to the Common Core State s: Kindergarten L-1, Building the Hundreds Counting and Cardinality Know number names and the count sequence. K.CC.1. Count to 100 by ones and by tens. K.CC.2. Count
More informationStudents will understand that biological diversity is a result of evolutionary processes.
Course: Biology Agricultural Science & Technology Unit: Diversity and Classification State Standard V: Students will understand that biological diversity is a result of evolutionary processes. State Objectives
More informationOn factorization by similarity of fuzzy concept lattices with hedges
On factorization by similarity of fuzzy concept lattices with hedges Radim Bělohlávek, Jan Outrata and Vilém Vychodil Department of Computer Science, Palacky University, Olomouc Tomkova 40, CZ-779 00 Olomouc,
More informationChapter 2 Rough Set Theory
Chapter 2 Rough Set Theory Abstract This chapter describes the foundations for rough set theory. We outline Pawlak s motivating idea and give a technical exposition. Basics of Pawlak s rough set theory
More informationAttribute exploration with fuzzy attributes and background knowledge
Attribute exploration with fuzzy attributes and background knowledge Cynthia Vera Glodeanu Technische Universität Dresden, 01062 Dresden, Germany Cynthia-Vera.Glodeanu@tu-dresden.de Abstract. Attribute
More informationTowards a Navigation Paradigm for Triadic Concepts
Towards a Navigation Paradigm for Triadic Concepts Sebastian Rudolph, Christian Săcărea, and Diana Troancă TU Dresden and Babeş-Bolyai University of Cluj-Napoca sebastian.rudolph@tu-dresden.de, {csacarea,dianat}@cs.ubbcluj.ro
More informationModeling Preferences with Formal Concept Analysis
Modeling Preferences with Formal Concept Analysis Sergei Obiedkov Higher School of Economics, Moscow, Russia John likes strawberries more than apples. John likes raspberries more than pears. Can we generalize?
More informationKlausur zur Vorlesung Vertiefung Theoretische Informatik Sommersemester 2016
Prof. Dr. Viorica Sofronie-Stokkermans Dipl.-Inform. Markus Bender AG Formale Methoden und Theoretische Informatik Fachbereich Informatik Universität Koblenz-Landau Klausur zur Vorlesung Vertiefung Theoretische
More informationAnalysing Online Social Network Data with Biclustering and Triclustering
Analysing Online Social Network Data with Biclustering and Triclustering Alexander Semenov 1 Dmitry Gnatyshak 1 Dmitry Ignatov 1 Jonas Poelmans 2,1 1 NRU Higher School of Economics, Russia 2 KU Leuven,
More informationKünstliche Intelligenz
Künstliche Intelligenz 4. Wissensrepräsentation Dr. Claudia Schon schon@uni-koblenz.de Institute for Web Science and Technologies 1 Except for some small changes these slides are transparencies from Poole,
More informationSpatial Computing. or how to design a right-brain hemisphere. Christian Freksa University of Bremen
Spatial Computing or how to design a right-brain hemisphere Christian Freksa University of Bremen 1 Acknowledgments 2 Some Examples of Spatial Problems (How) can I get the piano into my living room? How
More information2nd Grade Matter
Slide 1 / 118 Slide 2 / 118 2nd Grade Matter 2015-11-20 www.njctl.org Slide 3 / 118 Table of Contents Properties of Materials Matter and Material Defined Properties of Materials Explore properties of materials
More informationOn minimal solutions of linear Diophantine equations
On minimal solutions of linear Diophantine equations Martin Henk Robert Weismantel Abstract This paper investigates the region in which all the minimal solutions of a linear diophantine equation ly. We
More informationFuzzy Systems. Possibility Theory.
Fuzzy Systems Possibility Theory Rudolf Kruse Christian Moewes {kruse,cmoewes}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge Processing
More informationCLASSICAL EXTENSIONAL MEREOLOGY. Mereology
1 Mereology Core axioms and concepts parthood sum Higher order properties: cumulativity divisivity (aka divisiveness) atomicity 2 Mereology is the theory of parthood derived from the Greek µέρος (meros)
More informationData Retrieval and Noise Reduction by Fuzzy Associative Memories
Data Retrieval and Noise Reduction by Fuzzy Associative Memories Irina Perfilieva, Marek Vajgl University of Ostrava, Institute for Research and Applications of Fuzzy Modeling, Centre of Excellence IT4Innovations,
More informationUNIT 13: Acids and Bases Lesson Review Stations: Let s get ready for the test!!!
Name: Period: Date: KIPP NYC College Prep General Chemistry UNIT 13: Acids and Bases Lesson Review Stations: Let s get ready for the test!!! Do Now: By the end of today, you will have an answer to: What
More informationDiocese of Boise Math Curriculum 1 st grade
Diocese of Boise Math Curriculum 1 st grade ESSENTIAL What is counting and how can it be used? What are the different ways to solve word problems? Counting and Cardinality A1 Know and use number names
More informationChapter 26: Comparing Counts (Chi Square)
Chapter 6: Comparing Counts (Chi Square) We ve seen that you can turn a qualitative variable into a quantitative one (by counting the number of successes and failures), but that s a compromise it forces
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationFive peculiar theorems on simultaneous representation of primes by quadratic forms
Five peculiar theorems on simultaneous representation of primes by quadratic forms David Brink January 2008 Abstract It is a theorem of Kaplansky that a prime p 1 (mod 16) is representable by both or none
More informationClassification is the KEY...
Classification is the KEY... Subject Areas: Science Setting: Classroom Duration: One to two class periods This lesson may be combined with Observations on the half shell Skills: observation, critical thinking,
More informationStudent Notes Acids and Bases
Name: Class: Date: Student Notes Acids and Bases Many foods that we eat contain acids, such as lemons, oranges, apples, vinegar, grapes, and soda pop. Lemons and oranges contain citric acid, while apples
More informationComputing the Concept Lattice using Dendritical Neural Networks
Computing the Concept Lattice using Dendritical Neural Networks David Ernesto Caro-Contreras, Andres Mendez-Vazquez Centro de Investigación y Estudios Avanzados del Politécnico Nacional Av. del Bosque
More informationCalifornia CCSS Mathematics Grades 1-3
Operations and Algebraic Thinking Represent and solve problems involving addition and subtraction. 1.OA.1. Use addition and subtraction within 20 to solve word problems involving situations of adding to,
More informationÜbungsaufgaben zur VU Computermathematik Serie 9
Winfried Auzinger Sommersemester 214 Dirk Praetorius 4. 6. Juni 214 Übungsaufgaben zur VU Computermathematik Serie 9 Eine Sammlung verschiedener Problemstellungen. Die Angaben zu manchen der Aufgaben sind
More informationTheory of Computer Science. Theory of Computer Science. E1.1 Motivation. E1.2 How to Measure Runtime? E1.3 Decision Problems. E1.
Theory of Computer Science May 18, 2016 E1. Complexity Theory: Motivation and Introduction Theory of Computer Science E1. Complexity Theory: Motivation and Introduction Malte Helmert University of Basel
More informationTheory of Computation 1 Sets and Regular Expressions
Theory of Computation 1 Sets and Regular Expressions Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Theory of Computation
More informationReconsidering MacLane. Peter M. Hines
Reconsidering MacLane Coherence for associativity in infinitary and untyped settings Peter M. Hines Oxford March 2013 Topic of the talk: Pure category theory... for its own sake. This talk is about the
More informationContext Graphs for Many-Valued Contexts
Context Graphs for Many-Valued Contexts Jens Kötters Monash University, Melbourne, Australia Abstract. A context graph of a one-valued context is a graph which has formal objects as its vertices, and whose
More informationLife Science 7 Mrs. Duddles. Q1 Rock Cycle, Soil & Ecosystems
Life Science 7 Mrs. Duddles Q1 Rock Cycle, Soil & Ecosystems bjectives: Friday 10/28 ½ Day PM nly Students will learn about macroinvertebrates and how they are used as bio-indicators of stream health Students
More informationLTCS Report. Exploring finite models in the Description Logic EL gfp. Franz Baader, Felix Distel. LTCS-Report 08-05
Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Exploring finite models in the Description Logic EL gfp Franz Baader, Felix Distel LTCS-Report
More information1 st Grade LEUSD Learning Targets in Mathematics
1 st Grade LEUSD Learning Targets in Mathematics 8/21/2015 The learning targets below are intended to provide a guide for teachers in determining whether students are exhibiting characteristics of being
More informationOrdinals and Cardinals: Basic set-theoretic techniques in logic
Ordinals and Cardinals: Basic set-theoretic techniques in logic Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI 2011, Ljubljana, Slovenia This course is a foundational
More informationTOPOSES ARE SYMMETRIC MONOIDAL CLOSED CATEGORIES
Please cite this article as: Viliam Slodičák, Toposes are symmetric monoidal closed categories, Scientific Research of the Institute of Mathematics and Computer Science, 2012, Volume 11, Issue 1, pages
More information3 PROBABILITY TOPICS
Chapter 3 Probability Topics 135 3 PROBABILITY TOPICS Figure 3.1 Meteor showers are rare, but the probability of them occurring can be calculated. (credit: Navicore/flickr) Introduction It is often necessary
More information(Refer Slide Time: 0:18)
Foundations of Wavelets, Filter Banks and Time Frequency Analysis. Professor Vikram M. Gadre. Department Of Electrical Engineering. Indian Institute of Technology Bombay. Week-1. Lecture -2.3 L2 Norm of
More informationarxiv:quant-ph/ v1 26 Feb 2004
A Theory of Concepts and Their Combinations I: The Structure of the Sets of Contexts and Properties arxiv:quant-ph/0402207v1 26 Feb 2004 Diederik Aerts Center Leo Apostel for Interdisciplinary Studies
More informationTRIAS An Algorithm for Mining Iceberg Tri-Lattices
TRIAS An Algorithm for Mining Iceberg Tri-Lattices Robert Jschke 1,2, Andreas Hotho 1, Christoph Schmitz 1, Bernhard Ganter 3, Gerd Stumme 1,2 1 Knowledge & Data Engineering Group, University of Kassel,
More informationChem 14C Lecture 1 Spring 2017 Final Exam Part B Page 1
Chem 14C Lecture 1 Spring 2017 Final Exam Part B Page 1 1. (2) Write the letter of the structure that best fits the following 13 C-NMR spectrum: 51 ppm (doublet), 44 ppm (triplet), 27 ppm (quartet), 26
More informationPower. Wintersemester 2016/17. Jerome Olsen
Power Wintersemester 2016/17 Jerome Olsen Power True result H0 ist wahr H0 ist falsch Test result H0 Annahme (kein sig. Ergebnis) H0 Verwerfung (sig. Ergebnis) 1-α β 95% 20% α 1-β 5% 80% Type-II error
More informationWorking with Digital Elevation Models in ArcGIS 8.3
Working with Digital Elevation Models in ArcGIS 8.3 The homework that you need to turn in is found at the end of this document. This lab continues your introduction to using the Spatial Analyst Extension
More informationMy Journal By: Copyright 2015 A Dab of Glue Will Do
My Journal By: My Journal By: My Journal By: My Journal By: Science Notebook Contract This is my Science Notebook for the 20 school year: I promise to take care of my notebook. use one page at a time.
More informationFoundations of Chemistry
Name Foundations of Chemistry What is matter, and how does it change? Date Before You Read Before you read the chapter, think about what you know about matter and how it changes Record three things that
More informationPV211: Introduction to Information Retrieval https://www.fi.muni.cz/~sojka/pv211
PV211: Introduction to Information Retrieval https://www.fi.muni.cz/~sojka/pv211 IIR 18: Latent Semantic Indexing Handout version Petr Sojka, Hinrich Schütze et al. Faculty of Informatics, Masaryk University,
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationOptimal Design for the Rasch Poisson-Gamma Model
Optimal Design for the Rasch Poisson-Gamma Model Ulrike Graßhoff, Heinz Holling and Rainer Schwabe Abstract The Rasch Poisson counts model is an important model for analyzing mental speed, an fundamental
More informationFormal Concept Analysis
Formal Concept Analysis I Contexts, Concepts, and Concept Lattices Sebastian Rudolph Computational Logic Group Technische Universität Dresden slides based on a lecture by Prof. Gerd Stumme Sebastian Rudolph
More informationHidden Markov Models. Vibhav Gogate The University of Texas at Dallas
Hidden Markov Models Vibhav Gogate The University of Texas at Dallas Intro to AI (CS 4365) Many slides over the course adapted from either Dan Klein, Luke Zettlemoyer, Stuart Russell or Andrew Moore 1
More informationNombre: RED GREEN BLUE YELLOW PINK ORANGE. Color according to the instructions. Count and write the number. Celia Rodríguez Ruiz
Color according to the instructions. RED BLUE ORANGE GREEN YELLOW PINK Count and write the number Read the sentences and color the picture The car is red. The cloud is blue. The dog is brown. The bird
More informationA Picture Tells a Story
70 A Picture Tells a Story Write each sentence correctly. Then circle the type of sentence it is. Language Arts Types of sentences is the skateboard in the closet statement question exclamation command
More informationNew Paltz Central School District Mathematics Third Grade
September - Unit 1: Place Value and Numeration/Addition and Use hundred charts and number lines. Place Value October Subtraction Read and write numbers to 1,000. Pre- What is place value? Order numbers
More informationTRIAS An Algorithm for Mining Iceberg Tri-Lattices
TRIAS An Algorithm for Mining Iceberg Tri-Lattices Robert Jäschke 1,2, Andreas Hotho 1, Christoph Schmitz 1, Bernhard Ganter 3, Gerd Stumme 1,2 1 Knowledge & Data Engineering Group, University of Kassel,
More information