Sciweavers

184 search results - page 27 / 37
» Horn-Representation of a Concept Lattice
Sort
View
FCA
2005
Springer
188views Formal Methods» more  FCA 2005»
15 years 3 months ago
Formal Concept Analysis-Based Class Hierarchy Design in Object-Oriented Software Development
The class hierarchy is an important aspect of object-oriented software development. Design and maintenance of such a hierarchy is a difficult task that is often accomplished witho...
Robert Godin, Petko Valtchev
CIKM
2009
Springer
15 years 4 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
CLA
2007
14 years 11 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
106
Voted
ECCV
2008
Springer
15 years 8 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee