Sciweavers

1110 search results - page 61 / 222
» Clustering with the Connectivity Kernel
Sort
View
TAMC
2007
Springer
14 years 4 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
ICDM
2010
IEEE
200views Data Mining» more  ICDM 2010»
13 years 7 months ago
Bayesian Maximum Margin Clustering
Abstract--Most well-known discriminative clustering models, such as spectral clustering (SC) and maximum margin clustering (MMC), are non-Bayesian. Moreover, they merely considered...
Bo Dai, Baogang Hu, Gang Niu
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 1 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
PAMI
2008
146views more  PAMI 2008»
13 years 10 months ago
Video Event Recognition Using Kernel Methods with Multilevel Temporal Alignment
In this work, we systematically study the problem of event recognition in unconstrained news video sequences. We adopt the discriminative kernel-based method for which video clip s...
Dong Xu, Shih-Fu Chang
ECML
2004
Springer
14 years 3 months ago
Associative Clustering
This report contains derivations which did not fit into the paper [3]. Associative clustering (AC) is a method for separately clustering two data sets when one-to-one association...
Janne Sinkkonen, Janne Nikkilä, Leo Lahti, Sa...