Sciweavers

334 search results - page 46 / 67
» Scalable complex pattern search in sequential data
Sort
View
SPAA
1997
ACM
14 years 1 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
CAMP
2005
IEEE
14 years 2 months ago
Virtual Astronomy, Information Technology, and the New Scientific Methodology
—All sciences, including astronomy, are now entering the era of information abundance. The exponentially increasing volume and complexity of modern data sets promises to transfor...
S. George Djorgovski
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 9 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
BMCBI
2010
189views more  BMCBI 2010»
13 years 9 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 9 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang