Sciweavers

63 search results - page 6 / 13
» A novel approach to the clustering of microarray data via no...
Sort
View
TIP
2010
141views more  TIP 2010»
13 years 1 months ago
Efficient Particle Filtering via Sparse Kernel Density Estimation
Particle filters (PFs) are Bayesian filters capable of modeling nonlinear, non-Gaussian, and nonstationary dynamical systems. Recent research in PFs has investigated ways to approp...
Amit Banerjee, Philippe Burlina
CVPR
2005
IEEE
14 years 8 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok
WILF
2007
Springer
98views Fuzzy Logic» more  WILF 2007»
14 years 24 days ago
Possibilistic Clustering in Feature Space
In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
ICPR
2008
IEEE
14 years 7 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
ICANN
2007
Springer
14 years 25 days ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...