Sciweavers

56 search results - page 2 / 12
» DBDC: Density Based Distributed Clustering
Sort
View
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
14 years 14 days ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
ICASSP
2011
IEEE
12 years 10 months ago
On selecting the hyperparameters of the DPM models for the density estimation of observation errors
The Dirichlet Process Mixture (DPM) models represent an attractive approach to modeling latent distributions parametrically. In DPM models the Dirichlet process (DP) is applied es...
Asma Rabaoui, Nicolas Viandier, Juliette Marais, E...
CVPR
2005
IEEE
14 years 9 months ago
A Bayesian Approach to Unsupervised Feature Selection and Density Estimation Using Expectation Propagation
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
Shaorong Chang, Nilanjan Dasgupta, Lawrence Carin
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 18 days ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
ICPR
2008
IEEE
14 years 8 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