Sciweavers

8 search results - page 1 / 2
» Concept Lattices Constrained by Equivalence Relations
Sort
View
FUIN
2006
103views more  FUIN 2006»
13 years 4 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
ICFCA
2005
Springer
13 years 10 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
13 years 11 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
TIT
2002
126views more  TIT 2002»
13 years 4 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy