Sciweavers

2600 search results - page 43 / 520
» Clustering with or without the Approximation
Sort
View
FLAIRS
2004
13 years 10 months ago
Clustering Spatial Data in the Presence of Obstacles
Clustering is a form of unsupervised machine learning. In this paper, we proposed the DBRS_O method to identify clusters in the presence of intersected obstacles. Without doing an...
Xin Wang, Howard J. Hamilton
ACL
2000
13 years 10 months ago
A Morphologically Sensitive Clustering Algorithm for Identifying Arabic Roots
We present a clustering algorithm for Arabic words sharing the same root. Root based clusters can substitute dictionaries in indexing for IR. Modifying Adamson and Boreham (1974),...
Anne N. De Roeck, Waleed Al-Fares
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 9 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
COMGEO
2010
ACM
13 years 9 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
CLUSTER
2001
IEEE
14 years 19 days ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi