Sciweavers

1768 search results - page 6 / 354
» Mining Very Large Databases
Sort
View
IS
2007
13 years 9 months ago
Mining association rules in very large clustered domains
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
Alexandros Nanopoulos, Apostolos N. Papadopoulos, ...
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
13 years 11 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
AI
2005
Springer
14 years 3 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
ICDM
2005
IEEE
153views Data Mining» more  ICDM 2005»
14 years 3 months ago
Privacy-Preserving Frequent Pattern Mining across Private Databases
Privacy consideration has much significance in the application of data mining. It is very important that the privacy of individual parties will not be exposed when data mining te...
Ada Wai-Chee Fu, Raymond Chi-Wing Wong, Ke Wang