Sciweavers

6087 search results - page 938 / 1218
» Knowledge discovery methods
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Constrained spectral clustering through affinity propagation
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
Miguel Á. Carreira-Perpiñán, ...
RECOMB
2005
Springer
16 years 7 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
EDBT
2010
ACM
177views Database» more  EDBT 2010»
16 years 1 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
ECSQARU
2009
Springer
16 years 1 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
16 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson