다중혈관 관상동맥 환자에서 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

Virtual Observatory: Plate Content Digitization, Archive Mining and Image Sequence Processing

Objective: To study the clinical value of the determination of serum S-100 protein as a single tumor marker or in combination with tyrosinase RT-PCR in patients with melanoma receiv

Serum protein s-100 predicts clinical outcome in patients with melanoma treated with adjuvant interferon--comparison with tyrosinase rt-PCR.

In this paper, we propose a novel algorithm for image reconstruction from compressive measurements of wavelet coefficients. By incorporating independent Laplace priors on separate wavelet sub-bands, the inhomogeneity of wavelet coefficient distributions and therefore the structural sparsity within images are modeled effectively. We model the problem by adopting a Bayesian formulation, and develop a fast greedy reconstruction algorithm. Experimental results demonstrate that the reconstruction performance of the proposed algorithm is competitive with state-of-the-art methods while outperforming them in terms of running times.

/pdf/bayesian-compressive-sensing-of-wavelet-coefficients-using-4ocroausk6.pdf

Bayesian compressive sensing of wavelet coefficients using multiscale Laplacian priors

This paper deals with the problem of reconstructing high-resolution text images from an incomplete set of under-sampled, blurred, and noisy images shifted with subpixel displacement. We derive mathematical expressions for the calculation of the maximum a posteriori estimate of the high resolution image and the estimation of the parameters involved in the model. The method is tested on real text images and car plates, examining the impact of blurring and the number of available low resolution images on the final estimate.

/pdf/bayesian-super-resolution-of-text-image-sequences-from-low-9o09lulq07.pdf

Rafael Molina

Papers

Virtual Observatory: Plate Content Digitization, Archive Mining and Image Sequence Processing

Serum protein s-100 predicts clinical outcome in patients with melanoma treated with adjuvant interferon--comparison with tyrosinase rt-PCR.

Bayesian compressive sensing of wavelet coefficients using multiscale Laplacian priors

Bayesian super-resolution of text image sequences from low resolution observations

Fast Bayesian blind deconvolution with Huber Super Gaussian priors