112 search results - page 10 / 23 » Compact Samples for Data Dissemination |
PAKDD
2000
ACM
13 years 11 months ago
2000
ACM
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
VISUALIZATION
2002
IEEE
14 years 11 days ago
2002
IEEE
We present a new algorithm for rendering very large volume data sets at interactive framerates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
—In Dirichlet process (DP) mixture models, the number of components is implicitly determined by the sampling parameters of Dirichlet process. However, this kind of models usually...
PR
2007
13 years 7 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
ITNG
2010
IEEE
14 years 17 days ago
2010
IEEE
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...