Sciweavers

1314 search results - page 3 / 263
» Approximate data mining in very large relational data
Sort
View
AI
2005
Springer
13 years 11 months ago
A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
Xin Wang, Howard J. Hamilton
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
13 years 7 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 10 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
BMCBI
2008
208views more  BMCBI 2008»
13 years 5 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
11 years 8 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh