436 search results - page 38 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
AUSDM
2008
Springer
13 years 9 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
CVPR
2010
IEEE
13 years 11 months ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Classification is a core task in knowledge discovery and data mining, and there has been substantial research effort in developing sophisticated classification models. In a parall...