Sciweavers

9 search results - page 2 / 2
» Discovery of maximum length frequent itemsets
Sort
View
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 7 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
DASFAA
2005
IEEE
171views Database» more  DASFAA 2005»
13 years 11 months ago
Mining Succinct Systems of Minimal Generators of Formal Concepts
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li, Li...
BMCBI
2007
164views more  BMCBI 2007»
13 years 5 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
TCBB
2010
98views more  TCBB 2010»
12 years 12 months ago
VARUN: Discovering Extensible Motifs under Saturation Constraints
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
Alberto Apostolico, Matteo Comin, Laxmi Parida