Sciweavers

1227 search results - page 13 / 246
» Approximate Kernel Clustering
Sort
View
72
Voted
ICPR
2008
IEEE
15 years 4 months ago
Kernel Bisecting k-means clustering for SVM training sample reduction
This paper presents a new algorithm named Kernel Bisecting k-means and Sample Removal (KBK-SR) as a sampling preprocessing for SVM training to improve the scalability. The novel c...
Xiao-Zhang Liu, Guo-Can Feng
83
Voted
ICML
2005
IEEE
15 years 10 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
15 years 10 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
JMLR
2010
129views more  JMLR 2010»
14 years 4 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
100
Voted
MST
2007
90views more  MST 2007»
14 years 9 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins