Sciweavers

1227 search results - page 35 / 246
» Approximate Kernel Clustering
Sort
View
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
15 years 11 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
ICML
2004
IEEE
15 years 10 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
COMPGEOM
2007
ACM
15 years 1 months ago
A space-optimal data-stream algorithm for coresets in the plane
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
Pankaj K. Agarwal, Hai Yu
PPSN
2010
Springer
14 years 8 months ago
Comparison-Based Optimizers Need Comparison-Based Surrogates
Abstract. Taking inspiration from approximate ranking, this paper investigates the use of rank-based Support Vector Machine as surrogate model within CMA-ES, enforcing the invarian...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
NIPS
2004
14 years 11 months ago
Efficient Kernel Machines Using the Improved Fast Gauss Transform
The computation and memory required for kernel machines with N training samples is at least O(N2 ). Such a complexity is significant even for moderate size problems and is prohibi...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis