Sciweavers

4085 search results - page 247 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICDM
2008
IEEE
128views Data Mining» more  ICDM 2008»
15 years 10 months ago
Cost-Sensitive Parsimonious Linear Regression
We examine linear regression problems where some features may only be observable at a cost (e.g., in medical domains where features may correspond to diagnostic tests that take ti...
Robby Goetschalckx, Kurt Driessens, Scott Sanner
123
Voted
KDD
2009
ACM
151views Data Mining» more  KDD 2009»
16 years 4 months ago
A LRT framework for fast spatial anomaly detection
Given a spatial data set placed on an n ? n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithm...
Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ran...
121
Voted
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 7 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
127
Voted
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 5 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
ESWS
2008
Springer
15 years 5 months ago
Integrating Open Sources and Relational Data with SPARQL
We believe that the possibility to use SPARQL as a front end to heterogeneous data without significant cost in performance or expressive power is key to RDF taking its rightful pla...
Orri Erling, Ivan Mikhailov