Sciweavers

178 search results - page 19 / 36
» Measuring quality of similarity functions in approximate dat...
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Robust matching and recognition using context-dependent kernels
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
Hichem Sahbi, Jean-Yves Audibert, Jaonary Rabariso...
NIPS
2007
13 years 9 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
EMMCVPR
2001
Springer
14 years 18 hour ago
Path Based Pairwise Data Clustering with Application to Texture Segmentation
Most cost function based clustering or partitioning methods measure the compactness of groups of data. In contrast to this picture of a point source in feature space, some data sou...
Bernd Fischer, Thomas Zöller, Joachim M. Buhm...
BMCBI
2006
134views more  BMCBI 2006»
13 years 7 months ago
A statistical score for assessing the quality of multiple sequence alignments
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...
Virpi Ahola, Tero Aittokallio, Mauno Vihinen, Esa ...
KAIS
2006
110views more  KAIS 2006»
13 years 7 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...