Sciweavers

137 search results - page 2 / 28
» Hiding informative association rule sets
Sort
View
CIKM
2001
Springer
13 years 9 months ago
Ordinal Association Rules for Error Identification in Data Sets
A new extension of the Boolean association rules, ordinal association rules, that incorporates ordinal relationships among data items, is introduced. One use for ordinal rules is ...
Andrian Marcus, Jonathan I. Maletic, King-Ip Lin
CIKM
2006
Springer
13 years 9 months ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
TSE
2008
99views more  TSE 2008»
13 years 5 months ago
Modular Information Hiding and Type-Safe Linking for C
This paper presents CMOD, a novel tool that provides a sound module system for C. CMOD works by enforcing a set of four rules that are based on principles of modular reasoning and...
Saurabh Srivastava, Michael Hicks, Jeffrey S. Fost...
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 5 months ago
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
: In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non...
Florentin Smarandache, Jean Dezert
BMCBI
2005
116views more  BMCBI 2005»
13 years 5 months ago
Automating Genomic Data Mining via a Sequence-based Matrix Format and Associative Rule Set
There is an enormous amount of information encoded in each genome
Jonathan D. Wren, David Johnson, Le Gruenwald