Sciweavers

79 search results - page 9 / 16
» Disjoint pattern database heuristics
Sort
View
ICDE
2007
IEEE
179views Database» more  ICDE 2007»
15 years 3 months ago
A New ILP-based Concept Discovery Method for Business Intelligence
In this work, we propose a multi-relational concept discovery method for business intelligence applications. Multi-relational data mining finds interesting patterns that span ove...
Seda Daglar Toprak, Pinar Senkul, Yusuf Kavurucu, ...
CIKM
2004
Springer
15 years 1 months ago
Energy management schemes for memory-resident database systems
With the tremendous growth of system memories, memoryresident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
CSR
2006
Springer
15 years 1 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
15 years 1 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye