195 search results - page 19 / 39 » Clustering-Based K-Anonymisation Algorithms |
DAGM
2008
Springer
14 years 11 months ago
2008
Springer
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
55
Voted
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
JIPS
2006
14 years 9 months ago
2006
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
109
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
113
click to vote
ICN
2005
Springer
15 years 3 months ago
2005
Springer
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...