Sciweavers

569 search results - page 24 / 114
» An efficient clustering method for k-anonymization
Sort
View
ICC
2007
IEEE
186views Communications» more  ICC 2007»
14 years 2 months ago
An Efficient Cluster-Based Proactive Secret Share Update Scheme for Mobile Ad Hoc Networks
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
Ying Dong, Ai Fen Sui, Siu-Ming Yiu, Victor O. K. ...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 9 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
ECML
2006
Springer
14 years 9 days ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
EDM
2010
129views Data Mining» more  EDM 2010»
13 years 10 months ago
Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers
While students' skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [...
Rebecca Nugent, Nema Dean, Elizabeth Ayers
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 10 months ago
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
Guimei Liu, Jinyan Li, Kelvin Sim, Limsoon Wong