Sciweavers

2383 search results - page 159 / 477
» Finding Representative Set from Massive Data
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 5 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
170
Voted
BMCBI
2004
180views more  BMCBI 2004»
15 years 4 months ago
Noise filtering and nonparametric analysis of microarray data underscores discriminating markers of oral, prostate, lung, ovaria
Background: A major goal of cancer research is to identify discrete biomarkers that specifically characterize a given malignancy. These markers are useful in diagnosis, may identi...
Virginie M. Aris, Michael J. Cody, Jeff Cheng, Jam...
121
Voted
IIS
2004
15 years 6 months ago
Query Selectivity Estimation via Data Mining
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
Jarek Gryz, Dongming Liang
JIPS
2007
134views more  JIPS 2007»
15 years 4 months ago
An Efficient Functional Analysis Method for Micro-array Data Using Gene Ontology
: Microarray data includes tens of thousands of gene expressions simultaneously, so it can be effectively used in identifying the phenotypes of diseases. However, the retrieval of ...
Dong-wan Hong, Jong-keun Lee, Sung-soo Park, Sang-...
171
Voted
SIGKDD
2010
126views more  SIGKDD 2010»
14 years 11 months ago
MultiClust 2010: discovering, summarizing and using multiple clusterings
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
Xiaoli Z. Fern, Ian Davidson, Jennifer G. Dy