conexp.fx.core.context

Class ConceptLattice<G,M>

java.lang.Object

conexp.fx.core.collections.relation.AbstractRelation<R,C>

conexp.fx.core.collections.relation.MatrixRelation<Concept<G,M>,Concept<G,M>>

conexp.fx.core.context.ConceptLattice<G,M>

All Implemented Interfaces:

Relation<Concept<G,M>,Concept<G,M>>, PartialComparable<Relation<Concept<G,M>,Concept<G,M>>>, Cloneable, Comparable<Relation<Concept<G,M>,Concept<G,M>>>, Iterable<Pair<Concept<G,M>,Concept<G,M>>>

public final class ConceptLattice<G,M>
extends MatrixRelation<Concept<G,M>,Concept<G,M>>

Nested Class Summary

Nested classes/interfaces inherited from interface conexp.fx.core.collections.relation.Relation

Relation.NoHomogenRelationException

Field Summary

Fields

Modifier and Type	Field and Description
javafx.collections.ObservableMap<M,Concept<G,M>>	attributeConcepts
MatrixContext<G,M>	context
javafx.collections.ObservableMap<G,Concept<G,M>>	objectConcepts

Fields inherited from class conexp.fx.core.collections.relation.MatrixRelation

matrix

Fields inherited from class conexp.fx.core.collections.relation.AbstractRelation

colHeads, homogen, rowHeads

Constructor Summary

Constructors

Constructor and Description
ConceptLattice(MatrixContext<G,M> context)

Method Summary

Modifier and Type	Method and Description
Set<M>	attributeLabels(Concept<G,M> concept)
Set<Concept<G,M>>	complement(Set<Concept<G,M>> concepts)
Set<Concept<G,M>>	filter(Concept<G,M> concept)
Set<Concept<G,M>>	ideal(Concept<G,M> concept)
Concept<G,M>	infimum(Concept<G,M>... concepts)
Concept<G,M>	infimum(Iterable<Concept<G,M>> concepts)
Set<Concept<G,M>>	interval(Concept<G,M> lower, Concept<G,M> upper)
Set<Concept<G,M>>	lowerNeighbors(Concept<G,M> concept)
Collection<Implication<G,M>>	luxenburgerBase(double minConfidence, boolean sorted) The method computes the luxenburger base for partial implications, whose confidence is at least minConfidence.
Set<G>	objectLabels(Concept<G,M> concept)
Concept<G,M>	supremum(Concept<G,M>... concepts)
Concept<G,M>	supremum(Iterable<Concept<G,M>> concepts)
Set<Concept<G,M>>	upperNeighbors(Concept<G,M> concept)

Methods inherited from class conexp.fx.core.collections.relation.MatrixRelation

_add, _col, _col, _colAnd, _colAnd, _colAnd, _contains, _flip, _remove, _row, _row, _rowAnd, _rowAnd, _rowAnd, add, addAll, addAllFast, addEventHandler, addFast, addFastSilent, clone, col, colAnd, contains, containsAll, dispose, empty, fill, hasEventHandlers, hashCode, isAcyclic, isAlternative, isAntisymmetric, isAsymmetric, isAtransitive, isConnex, isCyclic, isEmpty, isFull, isIrreflexive, isLeftComparative, isNAcyclic, isNAtransitive, isNCyclic, isNegativAtransitive, isNegativeTransitive, isNTransitive, isQuasiconnex, isReflexive, isRightComparative, isSymmetric, isTransitive, iterator, matrix, neighborhood, order, push, pushAllChangedEvent, remove, removeAll, removeEventHandler, retainAll, row, rowAnd, setContent, setMatrix, size, subRelation, subRelation, toArray

Methods inherited from class conexp.fx.core.collections.relation.AbstractRelation

checkHomogen, colAnd, colHeads, compareTo, equals, equivalenceClasses, filter, fromPredicate, fromPredicate, greater, greaterEq, isHomogen, rowAnd, rowHeads, smaller, smallerEq, toString, uncomparable

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface conexp.fx.core.collections.relation.Relation

density

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface conexp.fx.core.math.PartialComparable

equivalent

Field Detail

context

public final MatrixContext<G,M> context

objectConcepts

public final javafx.collections.ObservableMap<G,Concept<G,M>> objectConcepts

attributeConcepts

public final javafx.collections.ObservableMap<M,Concept<G,M>> attributeConcepts

Constructor Detail

ConceptLattice

public ConceptLattice(MatrixContext<G,M> context)

Method Detail

lowerNeighbors

public final Set<Concept<G,M>> lowerNeighbors(Concept<G,M> concept)

upperNeighbors

public final Set<Concept<G,M>> upperNeighbors(Concept<G,M> concept)

ideal

public final Set<Concept<G,M>> ideal(Concept<G,M> concept)

filter

public final Set<Concept<G,M>> filter(Concept<G,M> concept)

interval

public final Set<Concept<G,M>> interval(Concept<G,M> lower,
                                        Concept<G,M> upper)

complement

public final Set<Concept<G,M>> complement(Set<Concept<G,M>> concepts)

supremum

@SafeVarargs
public final Concept<G,M> supremum(Concept<G,M>... concepts)

supremum

public final Concept<G,M> supremum(Iterable<Concept<G,M>> concepts)

infimum

@SafeVarargs
public final Concept<G,M> infimum(Concept<G,M>... concepts)

infimum

public final Concept<G,M> infimum(Iterable<Concept<G,M>> concepts)

objectLabels

public final Set<G> objectLabels(Concept<G,M> concept)

attributeLabels

public final Set<M> attributeLabels(Concept<G,M> concept)

luxenburgerBase

public final Collection<Implication<G,M>> luxenburgerBase(double minConfidence,
                                                          boolean sorted)

The method computes the luxenburger base for partial implications, whose confidence is at least minConfidence. If sorted is set to true, then the partial implications are sorted according to descending confidence, and a List is returned. Otherwise an unsorted Set is returned.

Parameters:

minConfidence -

sorted -

Returns:

a collection of implications