Sciweavers

56 search results - page 10 / 12
» Auditing Boolean Attributes
Sort
View
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 3 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
94
Voted
CISST
2003
88views Hardware» more  CISST 2003»
15 years 1 months ago
Virtual Experts for Imagery Registration and Conflation
The unique human expertise in imagery analysis should be preserved and shared with other imagery analysts to improve image analysis and decision-making. Such knowledge can serve a...
Boris Kovalerchuk, Artemus Harper, Michael Kovaler...
103
Voted
PARMA
2004
136views Database» more  PARMA 2004»
15 years 1 months ago
Using Classification and Visualization on Pattern Databases for Gene Expression Data Analysis
Abstract. We are designing new data mining techniques on gene expression data, more precisely inductive querying techniques that extract a priori interesting bi-sets, i.e., sets of...
Céline Robardet, Ruggero G. Pensa, Jé...
PODS
2010
ACM
197views Database» more  PODS 2010»
14 years 12 months ago
When data dependencies over SQL tables meet the logics of paradox and S-3
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
Sven Hartmann, Sebastian Link
AIIA
2005
Springer
15 years 5 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut