Sciweavers

1217 search results - page 194 / 244
» On compressing frequent patterns
Sort
View
BMCBI
2004
115views more  BMCBI 2004»
15 years 3 months ago
An SVD-based comparison of nine whole eukaryotic genomes supports a coelomate rather than ecdysozoan lineage
Background: Eukaryotic whole genome sequences are accumulating at an impressive rate. Effective methods for comparing multiple whole eukaryotic genomes on a large scale are needed...
Gary W. Stuart, Michael W. Berry
FAST
2011
14 years 7 months ago
Emulating Goliath Storage Systems with David
Benchmarking file and storage systems on large filesystem images is important, but difficult and often infeasible. Typically, running benchmarks on such large disk setups is a ...
Nitin Agrawal, Leo Arulraj, Andrea C. Arpaci-Dusse...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 4 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
KDD
2003
ACM
142views Data Mining» more  KDD 2003»
16 years 4 months ago
Frequent-subsequence-based prediction of outer membrane proteins
A number of medically important disease-causing bacteria (collectively called Gram-negative bacteria) are noted for the extra "outer" membrane that surrounds their cell....
Rong She, Fei Chen 0002, Ke Wang, Martin Ester, Je...
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
16 years 4 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler