766 search results - page 81 / 154 » Clustering high dimensional data using subspace and projecte... |
TKDE
2012
11 years 11 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
ICDCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—Content-based document image retrieval is a new and promising research area. Without OCR, document indexing directly based on image content is more general and convenient. Howev...
ICDE
2007
IEEE
14 years 10 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 ...