Sciweavers

1227 search results - page 44 / 246
» Approximate Kernel Clustering
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 5 days ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
RSFDGRC
2005
Springer
100views Data Mining» more  RSFDGRC 2005»
15 years 3 months ago
A Hybrid Approach to MR Imaging Segmentation Using Unsupervised Clustering and Approximate Reducts
Abstract. We introduce a hybrid approach to magnetic resonance image segmentation using unsupervised clustering and the rules derived from approximate decision reducts. We utilize ...
Sebastian Widz, Kenneth Revett, Dominik Slezak
COMGEO
2004
ACM
14 years 9 months ago
A local search approximation algorithm for k-means clustering
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
MOBIHOC
2002
ACM
15 years 9 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman