973 resultados para Análisis Cluster
Resumo:
Adaptive cluster sampling (ACS) has been the subject of many publications about sampling aggregated populations. Choosing the criterion value that invokes ACS remains problematic. We address this problem using data from a June 1999 ACS survey for rockfish, specifically for Pacific ocean perch (Sebastes alutus), and for shortraker (S. borealis) and rougheye (S. aleutianus) rockfish combined. Our hypotheses were that ACS would outperform simple random sampling (SRS) for S. alutus and would be more applicable for S. alutus than for S. borealis and S. aleutianus combined because populations of S. alutus are thought to be more aggregated. Three alternatives for choosing a criterion value were investigated. We chose the strategy that yielded the lowest criterion value and simulated the higher criterion values with the data after the survey. Systematic random sampling was conducted across the whole area to determine the lowest criterion value, and then a new systematic random sample was taken with adaptive sampling around each tow that exceeded the fixed criterion value. ACS yielded gains in precision (SE) over SRS. Bootstrapping showed that the distribution of an ACS estimator is approximately normal, whereas the SRS sampling distribution is skewed and bimodal. Simulation showed that a higher criterion value results in substantially less adaptive sampling with little tradeoff in precision. When time-efficiency was examined, ACS quickly added more samples, but sampling edge units caused this efficiency to be lessened, and the gain in efficiency did not measurably affect our conclusions. ACS for S. alutus should be incorporated with a fixed criterion value equal to the top quartile of previously collected survey data. The second hypothesis was confirmed because ACS did not prove to be more effective for S. borealis-S. aleutianus. Overall, our ACS results were not as optimistic as those previously published in the literature, and indicate the need for further study of this sampling method.
Resumo:
Nanostructured carbon thin films have been grown by deposition of cluster beams produced by a supersonic expansion. Due to separation effects typical of supersonic beams, films with different nanostructures can be grown by the simple intercepting of different regions of the cluster beam with a substrate. Films show a low-density porous structure, which has been characterized by Raman and Brillouin spectroscopy. Film morphology suggests that growth processes are similar to those occurring in a ballistic deposition regime.
Resumo:
Cluster analysis of ranking data, which occurs in consumer questionnaires, voting forms or other inquiries of preferences, attempts to identify typical groups of rank choices. Empirically measured rankings are often incomplete, i.e. different numbers of filled rank positions cause heterogeneity in the data. We propose a mixture approach for clustering of heterogeneous rank data. Rankings of different lengths can be described and compared by means of a single probabilistic model. A maximum entropy approach avoids hidden assumptions about missing rank positions. Parameter estimators and an efficient EM algorithm for unsupervised inference are derived for the ranking mixture model. Experiments on both synthetic data and real-world data demonstrate significantly improved parameter estimates on heterogeneous data when the incomplete rankings are included in the inference process.
Resumo:
MicroRNAs (miRNAs) are a growing class of small RNAs ( about 22 nt) that play crucial regulatory roles in the genome by targeting mRNAs for cleavage or translational repression. Most of the identified miRNAs are highly conserved among species, indicating
Resumo:
Background: Polymorphisms of CLEC4M have been associated with predisposition for infection by the severe acute respiratory syndrome coronavirus (SARS-CoV). DC-SIGNR, a C-type lectin encoded by CLEC4M, is a receptor for the virus. A variable number tandem
Resumo:
A mixture of Gaussians fit to a single curved or heavy-tailed cluster will report that the data contains many clusters. To produce more appropriate clusterings, we introduce a model which warps a latent mixture of Gaussians to produce nonparametric cluster shapes. The possibly low-dimensional latent mixture model allows us to summarize the properties of the high-dimensional clusters (or density manifolds) describing the data. The number of manifolds, as well as the shape and dimension of each manifold is automatically inferred. We derive a simple inference scheme for this model which analytically integrates out both the mixture parameters and the warping function. We show that our model is effective for density estimation, performs better than infinite Gaussian mixture models at recovering the true number of clusters, and produces interpretable summaries of high-dimensional datasets.
Resumo:
The capability to automatically identify shapes, objects and materials from the image content through direct and indirect methodologies has enabled the development of several civil engineering related applications that assist in the design, construction and maintenance of construction projects. This capability is a product of the technological breakthroughs in the area of image processing that has allowed for the development of a large number of digital imaging applications in all industries. In this paper, an automated and content based construction site image retrieval method is presented. This method is based on image retrieval techniques, and specifically those related with material and object identification and matches known material samples with material clusters within the image content. The results demonstrate the suitability of this method for construction site image retrieval purposes and reveal the capability of existing image processing technologies to accurately identify a wealth of materials from construction site images.
Resumo:
We present a novel filtering algorithm for tracking multiple clusters of coordinated objects. Based on a Markov chain Monte Carlo (MCMC) mechanism, the new algorithm propagates a discrete approximation of the underlying filtering density. A dynamic Gaussian mixture model is utilized for representing the time-varying clustering structure. This involves point process formulations of typical behavioral moves such as birth and death of clusters as well as merging and splitting. For handling complex, possibly large scale scenarios, the sampling efficiency of the basic MCMC scheme is enhanced via the use of a Metropolis within Gibbs particle refinement step. As the proposed methodology essentially involves random set representations, a new type of estimator, termed the probability hypothesis density surface (PHDS), is derived for computing point estimates. It is further proved that this estimator is optimal in the sense of the mean relative entropy. Finally, the algorithm's performance is assessed and demonstrated in both synthetic and realistic tracking scenarios. © 2012 Elsevier Ltd. All rights reserved.