Sciweavers

1950 search results - page 117 / 390
» Informative sampling for large unbalanced data sets
Sort
View
160
Voted
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
16 years 3 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 8 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
130
Voted
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
Automated market-making in the large: the gates hillman prediction market
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...
Abraham Othman, Tuomas Sandholm
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 8 months ago
A Genetic Approach for Gene Selection on Microarray Expression Data
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...
Yong-Hyuk Kim, Su-Yeon Lee, Byung Ro Moon
118
Voted
ICMLA
2008
15 years 4 months ago
Data Integration for Recommendation Systems
The quality of large-scale recommendation systems has been insufficient in terms of the accuracy of prediction. One of the major reasons is caused by the sparsity of the samples, ...
Zhonghang Xia, Houduo Qi, Manghui Tu, Wenke Zhang