Sciweavers

63 search results - page 8 / 13
» Computing iceberg concept lattices with T
Sort
View
DSVIS
2005
Springer
14 years 1 months ago
Concept Analysis as a Formal Method for Menu Design
The design and construction of navigation menus for websites have traditionally been performed manually according to the intuition of a web developer. This paper introduces a new a...
Guo-Qiang Zhang, Gongqin Shen, Ye Tian, Jiayang Su...
FCT
1991
Springer
13 years 11 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
DIM
2007
ACM
13 years 11 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
ICSE
1994
IEEE-ACM
13 years 12 months ago
On the Inference of Configuration Structures from Source Code
We apply mathematical concept analysis to the problem of infering configuration structures from existing source code. Concept analysis has been developed by German mathematicians ...
Maren Krone, Gregor Snelting
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 8 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont