Sciweavers

5595 search results - page 206 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
KDD
2009
ACM
208views Data Mining» more  KDD 2009»
16 years 6 months ago
A principled and flexible framework for finding alternative clusterings
The aim of data mining is to find novel and actionable insights in data. However, most algorithms typically just find a single (possibly non-novel/actionable) interpretation of th...
Zijie Qi, Ian Davidson
CVPR
1997
IEEE
16 years 8 months ago
Tracking non-rigid, moving objects based on color cluster flow
In this contribution we present an algorithm for tracking non-rigid, moving objects in a sequence of colored images, which were recorded by a non-stationary camera. The applicatio...
Bernd Heisele, Ulrich Kressel, W. Ritter
HT
1996
ACM
15 years 10 months ago
HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...
Ron Weiss, Bienvenido Vélez, Mark A. Sheldo...
PR
2008
123views more  PR 2008»
15 years 6 months ago
Extensions of vector quantization for incremental clustering
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
Edwin Lughofer
VTC
2006
IEEE
129views Communications» more  VTC 2006»
16 years 8 days ago
A Framework for Automatic Clustering of Parametric MIMO Channel Data Including Path Powers
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
Nicolai Czink, Pierluigi Cera, Jari Salo, Ernst Bo...