Sciweavers

712 search results - page 87 / 143
» cluster 2003
Sort
View
112
Voted
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
15 years 5 months ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon
ICCBR
2003
Springer
15 years 5 months ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
IJCAI
2007
15 years 2 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
86
Voted
NIPS
2003
15 years 1 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
87
Voted
ICIP
2003
IEEE
16 years 2 months ago
Using polarimetric imaging for material classification
In this paper we are mainly interested in the classification of images into different clusters, each corresponding to an object material in the imaged scene. For that purpose, the...
Jihad Zallat, Pierre Grabbling, Yoshitate Takakura