Sciweavers

917 search results - page 23 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
IRI
2006
IEEE
14 years 3 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil
DSN
2008
IEEE
13 years 10 months ago
Experiences with formal specification of fault-tolerant file systems
Fault-tolerant, replicated file systems are a crucial component of today's data centers. Despite their huge complexity, these systems are typically specified only in brief pr...
Roxana Geambasu, Andrew Birrell, John MacCormick
ICCS
2007
Springer
14 years 3 months ago
Conceptual Fingerprints: Lexical Decomposition by Means of Frames - a Neuro-cognitive Model
Abstract. Frames, i.e., recursive attribute-value structures, are a general format for the decomposition of lexical concepts. Attributes assign unique values to objects and thus de...
Wiebke Petersen, Markus Werning
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 3 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ICCS
2000
Springer
14 years 17 days ago
Conceptual Knowledge Discovery and Data Analysis
In this paper, we discuss Conceptual Knowledge Discovery in Databases (CKDD) in its connection with Data Analysis. Our approach is based on Formal Concept Analysis, a mathematical ...
Joachim Hereth Correia, Gerd Stumme, Rudolf Wille,...