다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLAR-ANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.

A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLARANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.

/pdf/a-density-based-algorithm-for-discovering-clusters-in-large-1o5u8sf38m.pdf

A density-based algorithm for discovering clusters in large spatial Databases with Noise

[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

[Tumor markers: theory or reality?].

In this paper we address supervised learning problems where, instead of having a single annotator who provides the ground truth, multiple annotators, usually with varying degrees of expertise, provide conflicting labels for the same sample. Once Gaussian Process classification has been adapted to this problem we propose and describe how Variational Bayes inference can be used to, given the observed labels, approximate the posterior distribution of the latent classifier and also estimate each annotator's reliability. In the experimental section, we evaluate the proposed method on both generated synthetic and real data, and compare it with state of the art crowd-sourcing methods.

Classification of multiple annotator data using variational Gaussian process inference

Bayesian K-SVD for H and E blind color deconvolution. Applications to stain normalization, data augmentation and cancer classification

We examine the use of compound Gauss Markov random fields (CGMRF) to restore severely blurred high range images. For this deblurring problem, the convergence of the simulated annealing (SA) and iterative conditional mode (ICM) algorithms has not been established. We propose two new iterative restoration algorithms which extend the classical SA and ICM approaches. Their convergence is established and they are tested on real and synthetic images.

Restoration of severely blurred high range images using compound models

In this paper a new combination of image priors is introduced and applied to Bayesian image restoration. Total Variation (TV) image prior preserves edge structure while imposing smoothness on the solutions. However, it does not perform well in textured areas. To alleviate this problem we propose to combine TV with the Poisson Singular Integral (PSI) image prior, which is able to preserve image textures. The proposed method utilizes a bound for the TV image model based on the majorization-minimization principle, and performs maximum a posteriori Bayesian inference. In the experimental section the proposed approach is tested on synthetically degraded images with different levels of spatial activity and areas with different types of texture. Since the proposed method depends on a set of parameters, an analysis, about their impact on the final restorations, is carried out.

Rafael Molina

Papers

[Tumor markers: theory or reality?].

Classification of multiple annotator data using variational Gaussian process inference

Bayesian K-SVD for H and E blind color deconvolution. Applications to stain normalization, data augmentation and cancer classification

Restoration of severely blurred high range images using compound models

Image deblurring combining poisson singular integral and total variation prior models