3699 search results - page 92 / 740 » Clustering with Qualitative Information |
SSDBM
2007
IEEE
14 years 3 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
ISI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract--Releasing person-specific data could potentially reveal sensitive information of individuals. k-anonymization is a promising privacy protection mechanism in data publishi...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...
PERCOM
2008
ACM
14 years 8 months ago
2008
ACM
As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an im...