Sciweavers

4560 search results - page 284 / 912
» Finding Data in the Neighborhood
Sort
View
BMCBI
2011
15 years 1 months ago
Multiclass classification of microarray data samples with a reduced number of genes
Background: Multiclass classification of microarray data samples with a reduced number of genes is a rich and challenging problem in Bioinformatics research. The problem gets hard...
Elizabeth Tapia, Leonardo Ornella, Pilar Bulacio, ...
POPL
2006
ACM
16 years 7 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 6 months ago
Sampling cube: a framework for statistical olap over sampling data
Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are g...
Xiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Y...
DASFAA
2005
IEEE
157views Database» more  DASFAA 2005»
16 years 7 days ago
Adaptively Detecting Aggregation Bursts in Data Streams
Finding bursts in data streams is attracting much attention in research community due to its broad applications. Existing burst detection methods suffer the problems that 1) the p...
Aoying Zhou, Shouke Qin, Weining Qian
CIKM
2008
Springer
15 years 8 months ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...