FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation

DOI10.1016/J.PATCOG.2007.09.013MaRDI QIDQ2469731zbMATH OpenOpenAlexFDO

Authors Zhaohong Deng, Shitong Wang, Fu-lai Chung

Publication date 7 February 2008

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2007.09.013

zbMATH Keywords

core-setdata condensationreduced set density estimatorminimal enclosing ball

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• A Fast Non-Parametric Density Estimation Algorithm
• Improved coresets for kernel density estimates
• A fast kernel density estimation theorem and the scaling up graph based relaxed clustering method
• Dm-KDE: dynamical kernel density estimation by sequences of KDE estimators with fixed number of components over data streams
• KDE paring and a faster mean shift algorithm

Cites work

• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• Approximate clustering via core-sets
• Approximate minimum enclosing balls in high dimensions using core-sets
• Computational Science and Its Applications – ICCSA 2004
• Core vector machines: fast SVM training on very large data sets
• Density estimation by wavelet thresholding
• Enhancing Density-Based Data Reduction Using Entropy
• Estimating the support of a high-dimensional distribution
• On Estimation of a Probability Density Function and Mode
• Optimal core-sets for balls
• The accuracy and the computational complexity of a multivariate binned kernel density estima\-tor.

Cited in

(13)

• Semi-supervised classification method through oversampling and common hidden space
• On minimum class locality preserving variance support vector machine
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
• Multivariate online kernel density estimation with Gaussian kernels
• The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine
• On bandwidth selection using minimal spanning tree for kernel density estimation
• An algorithm for reducing the dimension and size of a sample for data exploration procedures
• Scaling up minimum enclosing ball with total soft margin for training on large datasets
• Dm-KDE: dynamical kernel density estimation by sequences of KDE estimators with fixed number of components over data streams
• Multi-view L2-SVM and its multi-view core vector machine
• Scalable learning method for feedforward neural networks using minimal-enclosing-ball approximation
• Privacy preserving and fast decision for novelty detection using support vector data description
• Evolutionary sampling: a novel way of machine learning within a probabilistic framework

Describes a project that uses

Uses Software

• FRSDE

This page was built for publication: FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469731)