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...
Abstract--Releasing person-specific data could potentially reveal sensitive information of individuals. k-anonymization is a promising privacy protection mechanism in data publishi...
Benjamin C. M. Fung, Ke Wang, Lingyu Wang, Mourad ...
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. ...
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...
Anil K. Jain, Pavan Kumar Mallapragada, Martin H. ...
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...