Sciweavers

116 search results - page 4 / 24
» On Computing Condensed Frequent Pattern Bases
Sort
View
ESORICS
2004
Springer
14 years 26 days ago
Signature Bouquets: Immutability for Aggregated/Condensed Signatures
Database outsourcing is a popular industry trend which involves organizations delegating their data management needs to an external service provider. In this model, a service prov...
Einar Mykletun, Maithili Narasimha, Gene Tsudik
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
IDEAL
2003
Springer
14 years 20 days ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
14 years 22 days ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
DBA
2006
182views Database» more  DBA 2006»
13 years 8 months ago
Matrix Apriori: Speeding Up the Search for Frequent Patterns
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
Judith Pavón, Sidney Viana, Santiago G&oacu...