Sciweavers

JMLR
2010
225views more  JMLR 2010»
12 years 11 months ago
Hartigan's Method: k-means Clustering without Voronoi
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
Matus Telgarsky, Andrea Vattani
COMPSAC
2006
IEEE
13 years 10 months ago
Data Structure and Algorithm in Data Mining: Granular Computing View
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partit...
Shusaku Tsumoto
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
14 years 4 months ago
Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...