Sciweavers

31 search results - page 5 / 7
» Frequent pattern discovery with memory constraint
Sort
View
FIMI
2004
212views Data Mining» more  FIMI 2004»
13 years 8 months ago
A Space Optimization for FP-Growth
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
Eray Özkural, Cevdet Aykanat
TCBB
2010
98views more  TCBB 2010»
13 years 1 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
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
13 years 12 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
13 years 7 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...