2497 search results - page 385 / 500 » A Partial-Repeatability Approach to Data Mining |
114
Voted
PVLDB
2010
15 years 2 months ago
2010
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
154
Voted
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
137
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
131
Voted
JCST
2008
15 years 3 months ago
2008
Abstract Clustering text data streams is an important issue in data mining community and has a number of applications such as news group filtering, text crawling, document organiza...
153
Voted
PKDD
2000
Springer
15 years 7 months ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...