Sciweavers

1313 search results - page 110 / 263
» Data Discretization Unification
Sort
View
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
14 years 2 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 10 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 10 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
LSSC
2001
Springer
14 years 2 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
BMCBI
2010
102views more  BMCBI 2010»
13 years 10 months ago
Quantized correlation coefficient for measuring reproducibility of ChIP-chip data
Background: Chromatin immunoprecipitation followed by microarray hybridization (ChIP-chip) is used to study protein-DNA interactions and histone modifications on a genome-scale. T...
Shouyong Peng, Mitzi I. Kuroda, Peter J. Park