Sciweavers

5096 search results - page 142 / 1020
» Landscape of Clustering Algorithms
Sort
View
122
Voted
NIPS
2008
15 years 6 months ago
An Efficient Sequential Monte Carlo Algorithm for Coalescent Clustering
We propose an efficient sequential Monte Carlo inference scheme for the recently proposed coalescent clustering model [1]. Our algorithm has a quadratic runtime while those in [1]...
Dilan Görür, Yee Whye Teh
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 5 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
152
Voted
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 9 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
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 6 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
CAINE
2007
15 years 6 months ago
Parameter Estimation via Analysis of Fuzzy Clusters (PEAF): An Algorithm to Estimate Parameters of Agent-Based Models
Biologically focused, agent-based models need many parameters in order to simulate system dynamics. It is often essential to explore the consequences of many parameter vectors bef...
Shahab Sheikh-Bahaei, C. Anthony Hunt