917 search results - page 6 / 184 » Comparison of Data Structures for Computing Formal Concepts |
CLA
2004
13 years 9 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
ECAI
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...