Sciweavers

13 search results - page 2 / 3
» Using Concept Lattices for Requirements Reconciliation
Sort
View
ICCS
1998
Springer
13 years 9 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
CIKM
2009
Springer
14 years 4 days 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 ...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 6 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
CLA
2007
13 years 7 months ago
Precalculating Component Interface Compatibility using FCA
In component-based software engineering, software systems are built by assembling prefabricated reusable components. The compatibility between the assembled components is crucial. ...
Gabriela Arévalo, Nicolas Desnos, Marianne ...
CBSE
2004
Springer
13 years 11 months ago
Correctness of Component-Based Adaptation
Abstract. Long running applications often need to adapt due to changing requirements or changing environment. Typically, such adaptation is performed by dynamically adding or remov...
Sandeep S. Kulkarni, Karun N. Biyani