Sciweavers

128 search results - page 11 / 26
» Noise-Tolerant Conceptual Clustering
Sort
View
NIPS
2003
13 years 10 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
ECCV
2008
Springer
14 years 10 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello
CIBB
2008
13 years 10 months ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
IROS
2009
IEEE
170views Robotics» more  IROS 2009»
14 years 3 months ago
Entrapment/escorting and patrolling missions in multi-robot cluster space control
— The tasks of entrapping/escorting and patrolling around an autonomous target are presented making use of the multi-robot cluster space control approach. The cluster space contr...
Ignacio Mas, Steven Li, Jose Acain, Christopher Ki...
ICCD
2003
IEEE
145views Hardware» more  ICCD 2003»
14 years 5 months ago
Care Bit Density and Test Cube Clusters: Multi-Level Compression Opportunities
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
Bernd Könemann