Sciweavers

195 search results - page 28 / 39
» Clustering-Based K-Anonymisation Algorithms
Sort
View
CCECE
2009
IEEE
15 years 2 months ago
Cluster head selection using RF signal strength
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
Scott Fazackerley, Alan Paeth, Ramon Lawrence
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
15 years 10 months ago
Event detection from evolution of click-through data
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...
Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei...
CIKM
2005
Springer
15 years 3 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
72
Voted
IPPS
2009
IEEE
15 years 4 months ago
A metascalable computing framework for large spatiotemporal-scale atomistic simulations
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
Ken-ichi Nomura, Richard Seymour, Weiqiang Wang, H...