Sciweavers

33 search results - page 4 / 7
» Finding All Frequent Patterns Starting from the Closure
Sort
View
IJFCS
2008
102views more  IJFCS 2008»
14 years 9 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 7 months ago
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to ...
Bolin Ding, David Lo, Jiawei Han, Siau-Cheng Khoo
RECOMB
2004
Springer
15 years 9 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
AE
2007
Springer
15 years 3 months ago
Minimal and Necessary Conditions for the Emergence of Species-Specific Recognition Patterns
A simple mechanism is presented for the emergence of recognition patterns that are used by individuals to find each other and mate. The genetic component determines the brain of an...
Nicolas Brodu
153
Voted
POPL
2002
ACM
15 years 9 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...