Sciweavers

692 search results - page 47 / 139
» A new clustering algorithm for coordinate-free data
Sort
View
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
14 years 1 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
STACS
2007
Springer
14 years 2 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
BMCBI
2010
139views more  BMCBI 2010»
13 years 8 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
CLUSTER
2006
IEEE
14 years 2 months ago
A Simple Synchronous Distributed-Memory Algorithm for the HPCC RandomAccess Benchmark
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
Steven J. Plimpton, Ron Brightwell, Courtenay Vaug...
TKDE
2008
111views more  TKDE 2008»
13 years 8 months ago
Text Clustering with Feature Selection by Using Statistical Data
Abstract-- Feature selection is an important method for improving the efficiency and accuracy of text categorization algorithms by removing redundant and irrelevant terms from the ...
Yanjun Li, Congnan Luo, Soon M. Chung