Exploratory Programming for Formal Concept Analysis

(1)

An Introduction toconexp-clj

Daniel Borchmann

TU Dresden

May 24, 2013

http://www.math.tu-dresden.de/~borch/conexp-clj/icfca2013-tutorial.html

Daniel Borchmann (TU Dresden) conexp-clj May 24, 2013 1 / 14

(2)

Motivation Why another FCA Tool?

Main Question

Why another FCA tool?

Many tools which can do things fast and well!

The “Problem”

But what if you want to do something else?

What if you want to process your results further on?

What if you want to do something from which you arenot completely sure of?

Solution

Need flexible “FCA scripting”

Hard to achieve with available tools conexp-clj!

(3)

Main Question

Why another FCA tool? Many tools which can do things fast and well!

The “Problem”

Solution

(4)

Main Question

The “Problem”

Solution

(5)

Main Question

The “Problem”

Solution

(6)

Main Question

The “Problem”

Solution

(7)

Main Question

The “Problem”

Solution

(8)

Main Question

The “Problem”

Solution

(9)

Main Question

The “Problem”

Solution

Hard to achieve with available tools

conexp-clj!

(10)

Main Question

The “Problem”

Solution

(11)

Motivation Goods and Bads

Whatconexp-cljis good for

flexible tool to try out new ideas in FCA

suitable forexploratory programming, i. e. trying out new algorithms to see if they are correct and how they behave

compute non-trivial examples (pedagogical or otherwise) FCA scripting

Whatconexp-cljisnotgood for

High performance computations Data-intense computations GUI enthusiasts

(12)

(13)

(14)

compute non-trivial examples (pedagogical or otherwise)

FCA scripting

(15)

(16)

(17)

Whatconexp-cljisnotgood for High performance computations

Data-intense computations GUI enthusiasts

(18)

Whatconexp-cljisnotgood for High performance computations Data-intense computations

GUI enthusiasts

(19)

Whatconexp-cljisnotgood for High performance computations Data-intense computations GUI enthusiasts

(20)

Motivation Main Features

Main Features ofconexp-clj(Overview) basic operations on formal contexts relational algebra with formal contexts

transparent IO for formal and many-valued contexts scaling for many-valued contexts

implicational theory and basic attribute exploration computing Luxenburger-bases and iceberg concept sets lattice layouts and lattice IO (some...)

a bit of fuzzy-FCA interface for Java interface for sage

(21)

Basic Principles Design Principles

Implementation

implemented in Clojure, a Lisp dialect running on the JVM highly portable (JVM)

highly flexible (Lisp)

transparent access to all Java functionality compiled

(22)

Implementation

implemented in Clojure, a Lisp dialect running on the JVM

highly portable (JVM) highly flexible (Lisp)

(23)

Implementation

(24)

Implementation

(25)

Implementation

transparent access to all Java functionality

compiled

(26)

Implementation

(27)

Basic Principles Installing and Running

Prerequisites

Java 1.6 or higher (JRE sufficient)

Download and Installation

Go toconexp-clj’s website:http://github.com/exot/conexp-clj Move toHow to Run

Download one of the .zip files and unpack them where you want

Running

Run./bin/conexp-cljfor a simple (yet sufficient!) command-line interface

Run./bin/conexp-clj --guifor a “convenient” (but mostly broken) graphical user interface

(28)

Prerequisites

Running

(29)

Prerequisites

Running

(30)

Prerequisites

Go toconexp-clj’s website:http://github.com/exot/conexp-clj

Move toHow to Run

Running

(31)

Prerequisites

Running

(32)

Prerequisites

Running

(33)

Prerequisites

Running

(34)

Prerequisites

Running

(35)

Prerequisites

Running

(36)

Basic Principles Principle Workflow

Code user=>

1 1

user=>(+ 1 2) 3

user=>(make-context #{1 2 3} #{0 1 2} <=)

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>(javax.swing.JOptionPane/showMessageDialog nil "Wow!") nil

user=>

(37)

Code user=>1

1

user=>(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(38)

Code user=>1 1

user=>

(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(39)

Code user=>1 1

user=>(+ 1 2)

3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(40)

Code user=>1 1

user=>(+ 1 2) 3

user=>

(make-context #{1 2 3} #{0 1 2} <=)

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(41)

Code user=>1 1

user=>(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(42)

Code user=>1 1

user=>(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . . user=>

(javax.swing.JOptionPane/showMessageDialog nil "Wow!") nil

user=>

(43)

Code user=>1 1

user=>(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>(javax.swing.JOptionPane/showMessageDialog nil "Wow!")

nil user=>

(44)

Code user=>1 1

user=>(+ 1 2) 3

|0 1 2 --+---

1 |. x x 2 |. . x 3 |. . .

user=>

(45)

Basic Principles An Example

Example

live!

(46)

Basic Principles An Example

Example live!

(47)

Outlook More Concepts

Code (Functions) user=>

(defn f [x] (+ x 3))

#’user/f user=>(f 5) 8

user=>(def f (fn [x] (+ x 3)))

Code (Functional Programming) user=>(reduce + [1 2 3 4 5]) 15

user=>(reduce * (range 1 10)) 362880

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(48)

Code (Functions)

user=>(defn f [x] (+ x 3))

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(49)

Code (Functions)

#’user/f user=>

(f 5) 8

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(50)

Code (Functions)

#’user/f user=>(f 5)

8

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(51)

Code (Functions)

user=>

(def f (fn [x] (+ x 3)))

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(52)

Code (Functions)

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(53)

Code (Functions)

Code (Functional Programming) user=>

(reduce + [1 2 3 4 5]) 15

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(54)

Code (Functions)

Code (Functional Programming) user=>(reduce + [1 2 3 4 5])

15

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(55)

Code (Functions)

user=>

(reduce * (range 1 10)) 362880

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(56)

Code (Functions)

user=>(reduce * (range 1 10))

362880

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(57)

Code (Functions)

user=>

(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(58)

Code (Functions)

user=>(map f [4 5 6])

(7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(59)

Code (Functions)

user=>(map f [4 5 6]) (7 8 9)

user=>

(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(60)

Code (Functions)

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6])

(1 3 5) user=>

(61)

Code (Functions)

user=>(map f [4 5 6]) (7 8 9)

user=>(filter odd? [1 2 3 4 5 6]) (1 3 5)

user=>

(62)

Outlook Stegosaurus

Task

Is there a correlation between the number of intents and the number of pseudo intents of a formal context?

0 500 1,000 1,500 2,000 0

50 100 150 200 250

(63)

Outlook Stegosaurus

Task

Is there a correlation between the number of intents and the number of pseudo intents of a formal context?

0 500 1,000 1,500 2,000 0

50 100 150 200 250

(64)

Outlook Stegosaurus

Code

(defpoints (map(fn [_]

(let [ctx (reduce-context (random-context (rand-int 2048) 11

(rand)))]

(list(count(intents ctx))

(count(pseudo-intents ctx))))) (range 1 1000)))

(65)

Outlook In Case You Need Help

Code user=>

(doc make-context) ---

conexp.main/make-context

([objects attributes incidence])

Standard constructor for contexts. Takes a sequence of objects,

a sequence of attributes and either a set of pairs or function of

... nil

user=>(find-doc "formal context") ---

conexp.fca.implications/proper-premises-by-hypertrans ...

conexp.fca.implications/proper-premises-for-attribute ...

user=>

(66)

Code

user=>(doc make-context)

---

... nil

user=>

(67)

Code

user=>(doc make-context) ---

...

nil user=>

(find-doc "formal context") ---

user=>

(68)

Code

...

nil

user=>(find-doc "formal context")

---

user=>

(69)

Code

...

nil

user=>

(70)

The End Outlook and Further Development

The Future

A better GUI

Java backend for more performance More flexible IO system

More documentation

Alternate Reality

Reimplementation in Guile (Scheme, Python, Lua, ...) C backend for better performance

Retain flexibility, but increase speed

(71)

The Future A better GUI

More documentation

Alternate Reality

(72)

Java backend for more performance

More flexible IO system More documentation

Alternate Reality

(73)

More documentation

Alternate Reality

(74)

More documentation

Alternate Reality

(75)

More documentation

Alternate Reality

(76)

More documentation

Alternate Reality

Reimplementation in Guile (Scheme, Python, Lua, ...)

C backend for better performance Retain flexibility, but increase speed

(77)

More documentation

Alternate Reality

(78)

More documentation

Alternate Reality

(79)

Exercises!

(80)

Thank You!