Sciweavers

728 search results - page 4 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
11 years 10 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
SIGMOD
1998
ACM
271views Database» more  SIGMOD 1998»
13 years 7 months ago
Towards On-Line Analytical Mining in Large Databases
Great e orts have been paid in the Intelligent Database Systems Research Lab for the research and development of e cient data mining methods and construction of on-line analytical...
Jiawei Han
CGA
2004
13 years 7 months ago
Visual Data Mining in Large Geospatial Point Sets
Daniel A. Keim, Christian Panse, Mike Sips, Stephe...
KDD
2007
ACM
335views Data Mining» more  KDD 2007»
14 years 8 months ago
Detecting changes in large data sets of payment card data: a case study
An important problem in data mining is detecting changes in large data sets. Although there are a variety of change detection algorithms that have been developed, in practice it c...
Chris Curry, Robert L. Grossman, David Locke, Stev...
EUROPAR
1999
Springer
13 years 12 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene