Formal Concept Analysis

Similar documents
Formal Concept Analysis

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

Garnir Polynomial and their Properties

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

COMP108 Algorithmic Foundations

Association (Part II)

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Last time: introduced our first computational model the DFA.

1 Introduction to Modulo 7 Arithmetic

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Basic Polyhedral theory

Ch 1.2: Solutions of Some Differential Equations

0.1. Exercise 1: the distances between four points in a graph

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

(a) v 1. v a. v i. v s. (b)

12. Traffic engineering

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Present state Next state Q + M N

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

Journal of Universal Computer Science, vol. 6, no. 1 (2000), submitted: 20/10/99, accepted: 6/11/99, appeared: 28/1/00 Springer Pub. Co.

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Seven-Segment Display Driver

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

NEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Homework #3. 1 x. dx. It therefore follows that a sum of the

HIGHER ORDER DIFFERENTIAL EQUATIONS

A High-level Strategy for C-net Discovery

ECE602 Exam 1 April 5, You must show ALL of your work for full credit.

Knowledge-Based Systems. Outline 1. Outline 2. Expert System. Page 1. Development of KB Systems. CI = Computational Intelligence.

cycle that does not cross any edges (including its own), then it has at least

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Instructions for Section 1

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Fundamental Algorithms for System Modeling, Analysis, and Optimization

AP Calculus BC Problem Drill 16: Indeterminate Forms, L Hopital s Rule, & Improper Intergals

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Numbering Boundary Nodes

Minimum Spanning Trees

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

EEO 401 Digital Signal Processing Prof. Mark Fowler

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

DFA (Deterministic Finite Automata) q a

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Linear Algebra Existence of the determinant. Expansion according to a row.

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

1973 AP Calculus AB: Section I

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

Lecture 6.4: Galois groups

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Answer Homework 5 PHA5127 Fall 1999 Jeff Stark

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.

MATH 1080 Test 2-SOLUTIONS Spring

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Enforcement of Opacity Security Properties Using Insertion Functions

Planar Upward Drawings

Limiting value of higher Mahler measure

Engineering 323 Beautiful HW #13 Page 1 of 6 Brown Problem 5-12

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Constants and Conversions:

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

Combinatorial Networks Week 1, March 11-12

Chapter 3 Fourier Series Representation of Periodic Signals

nd the particular orthogonal trajectory from the family of orthogonal trajectories passing through point (0; 1).

Polygons POLYGONS.

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

Where k is either given or determined from the data and c is an arbitrary constant.

CONTINUITY AND DIFFERENTIABILITY

The Matrix Exponential

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Right Angle Trigonometry

The Matrix Exponential

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

Addition of angular momentum

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Multi-linear Systems and Invariant Theory. in the Context of Computer Vision and Graphics. Class 5: Self Calibration. CS329 Stanford University

Steinberg s Conjecture is false

Aquauno Video 6 Plus Page 1

Graph Contraction and Connectivity

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

IIT JEE MATHS MATRICES AND DETERMINANTS

Exam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.

Transcription:

Forml Conpt Anlysis Conpt intnts s losd sts Closur Systms nd Implitions 4 Closur Systms 0.06.005 Nxt-Closur ws dvlopd y B. Gntr (984). Lt M = {,..., n}. A M is ltilly smllr thn B M, if B A if th smllst lmnt whr A nd B diffr longs to B : A < B : i B\A: A {,,..., i-} = B {,,..., i-} Itnusd 45 to dtrmin th onpt ltti or to dtrmin th onpt ltti togthr with th stm sis or for intrtiv knowldg quisition. It dtrmins th onpt intnts in ltil ordr. 45 5 4 45 5 4 4 5 45 4 5 4 45 5 45 45 45 5 4 5 5 4 4 0.06.005 0.06.005 4

W nd th following: Algorithm Nxt-Closur for dtrmining ll onpt intnts: A < i B : i B \A A {,,..., i-} = B {,,..., i-} ) Th ltilly smllst onpt intnt is. A i := ( A {,,..., i-} ) {i} Thorm: Th smllst onpt intnt, whih ording to th ltil ordr is lrgr s givn st A M, is A i := (A i), ) Is A onpt intnt, thn w find th ltilly nxt intnt, y hking ll ttriuts i M \ A, strting with th lrgst, und thn in drsing ordr, until A < i (A i ) holds. Thn A i is th ltilly nxt onpt intnt. ) If A i = M, thn stop, ls A A i nd goto ). whr i is th lrgst lmnt of M with A < i A i. 0.06.005 5 0.06.005 6 Exmpl: on lkord Sinus 44 Noki 60 T-Fx 0 T-Fx 60 PC Hndy () Tlfon () Fx () Fx w. n. ppr (4) A i A i A i :=(A i ) A < i A i? nw onpt intnt Irg Conpt Lttis minsupp = 85% For minsupp = 85% th svn most gnrl of th.086 onpts of th Mushrooms dts http:\\kdd.is.ui.du r shown. 0.06.005 7 0.06.005 8

Irg Conpt Lttis minsupp = 85% With drsing minimum support th informtion gts rihr. minsupp = 70% minsupp = 55% 0.06.005 9 0.06.005 0 Th support of st M of ttriuts is givn y supp() G Df.: Th irg onpt ltti of forml ontxt (G,M,I) for givn miniml support minsupp is th st { (A,B) B(G,M,I) supp(b) minsupp } Th visuliztion s nstd lin digrm indits implitions. It n omputd with. [Stumm t l 00] 0.06.005 0.06.005

omputs th losur systm of ll (frqunt) onpt intnts using th support funtion: mks us of som simpl fts out th support funtion: Df.: Th support of n ttriut st (itmst) M is givn y supp() G Only onpts with support ov thrshold minsupp [0,]. 0.06.005 0.06.005 4 tris to optimiz th following thr qustions:. How n th losur of n itmst dtrmind sd on supports only?. How n th losur systm omputd with dtrmining s fw losurs s possil?. How n s mny supports s possil drivd from lrdy known supports? 0.06.005 5 0.06.005 6

. How n th losur of n itmst dtrmind sd on supports only? = { x M \ supp() = supp( { x }) }. How n th losur systm omputd with dtrmining s fw losurs s possil? W dtrmin only th losurs of th miniml gnrtors. Exmpl: {, } = {,, }, sin supp( {, } ) = / nd supp( {,, } ) = 0/ supp( {,, } ) = /, 0.06.005 7 0.06.005 8. How n th losur systm omputd with dtrmining s fw losurs s possil? W dtrmin only th losurs of th miniml gnrtors. A st is miniml gnrtor iff its support is diffrnt of th supports of ll its lowr ovrs.. How n th losur of n itmst dtrmind sd on supports only? = x M \ supp() = supp( x ). How n th losur systm omputd with dtrmining s fw losurs s possil? Approh à l Apriori Th miniml gnrtors r n ordr idl (i.., if st is not miniml gnrtor, thn non of its suprsts is ithr.) Apriori lik pproh In th xmpl, nds two runs (nd Apriori four).. How n s mny supports s possil drivd from lrdy known supports? 0.06.005 9 0.06.005 0

. How n s mny supports s possil drivd from lrdy known supports? Thorm: If is no miniml gnrtor, thn supp() = min { supp(k) K is miniml gnrtor, K }. Exmpl: supp( {,, } ) = min { 0/, /, /, /, / } = 0, sin th st is no miniml gnrtor, nd sin supp( {, } ) = 0/, supp( {, } ) = / supp( { } ) = /, supp( { } ) = / supp( { } ) = / Rmrk: It is suffiint to hk th lrgst gnrtors K with K, i.. hr {, } nd {, }.. How n th losur of n itmst dtrmind sd on supports only? = { x M \ supp() = supp( x ) }. How n th losur systm omputd with dtrmining s fw losurs s possil? Approh à l Apriori. How n s mny supports s possil drivd from lrdy known supports? If is no miniml gnrtor, thn supp() = min { supp(k) K is miniml gnrtor, K }. 0.06.005 0.06.005 i i singltons Dtrmin support for ll C Dtrmin losurs for ll C i - Prun non-miniml gnrtors from i i A l Apriori For pot. min. gnrtors: ount in dts. Els supp() = min { supp(k) K, K m.g.}. = { x M \ supp() = supp( {x}) } iff supp() supp( \ {x}) f.. x omprd with Apriori i i singltons Dtrmin support for ll C i - Dtrmin losurs for ll C i - Prun non-miniml gnrtors from i If th support is too low or qul to th support of lowr ovr, th ndidt is prund. i i + i Gnrt_Cndidts( i - ) A l Apriori i i + i Gnrt_Cndidts( i - ) no i mpty? End ys Apriori lik pproh no i mpty? End ys W only gnrt ndidts for miniml gnrtors. 0.06.005 0.06.005 4

0.06.005 5 0.06.005 6 Exmpl of 0.06.005 7 0.06.005 8

0.06.005 9 0.06.005 0 0.06.005 0.06.005

vs. Nxt-Closur Nxt-Closur nds lmost no mmory. Nxt-Closur n xploit known symmtris twn ttriuts. Nxt-Closur n usd for knowldg quisition. hs fr ttr prformn, spilly on lrg dt sts. 0.06.005