Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Stochastic Optimization Via Forward Slice, Bob A. Salim, Lurdes Y. T. Inoue May 2015

Stochastic Optimization Via Forward Slice, Bob A. Salim, Lurdes Y. T. Inoue

UW Biostatistics Working Paper Series

Optimization consists of maximizing or minimizing a real-valued objective function. In many problems, the objective function may not yield closed-form solutions. Over many decades, optimization methods, both deterministic and stochastic, have been developed to provide solutions to these problems. However, some common limitations of these methods are the sensitivity to the initial value and that often current methods only find a local (non-global) extremum. In this article, we propose an alternative stochastic optimization method, which we call "Forward Slice", and assess its performance relative to available optimization methods.


Optcluster : An R Package For Determining The Optimal Clustering Algorithm And Optimal Number Of Clusters., Michael N. Sekula May 2015

Optcluster : An R Package For Determining The Optimal Clustering Algorithm And Optimal Number Of Clusters., Michael N. Sekula

Electronic Theses and Dissertations

Determining the best clustering algorithm and ideal number of clusters for a particular dataset is a fundamental difficulty in unsupervised clustering analysis. In biological research, data generated from Next Generation Sequencing technology and microarray gene expression data are becoming more and more common, so new tools and resources are needed to group such high dimensional data using clustering analysis. Different clustering algorithms can group data very differently. Therefore, there is a need to determine the best groupings in a given dataset using the most suitable clustering algorithm for that data. This paper presents the R package optCluster as an efficient …


Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine Apr 2015

Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine

Doctoral Dissertations

Statistical analysis is influenced by implementation of the algorithms used to execute the computations associated with various statistical techniques. Over many years; very important criteria for model comparison has been studied and examined, and two algorithms on a single dataset have been performed numerous times. The goal of this research is not comparing two or more models on one dataset, but comparing models with numerical algorithms that have been used to solve them on the same dataset.

In this research, different models have been broadly applied in modeling and their contrasting which are affected by the numerical algorithms in different …


Spectral Gene Set Enrichment (Sgse), H Robert Frost, Zhigang Li, Jason H. Moore Mar 2015

Spectral Gene Set Enrichment (Sgse), H Robert Frost, Zhigang Li, Jason H. Moore

Dartmouth Scholarship

Gene set testing is typically performed in a supervised context to quantify the association between groups of genes and a clinical phenotype. In many cases, however, a gene set-based interpretation of genomic data is desired in the absence of a phenotype variable. Although methods exist for unsupervised gene set testing, they predominantly compute enrichment relative to clusters of the genomic variables with performance strongly dependent on the clustering algorithm and number of clusters. We propose a novel method, spectral gene set enrichment (SGSE), for unsupervised competitive testing of the association between gene sets and empirical data sources. SGSE first computes …