Thesis (Ph. D.)--Ohio State University, 2005. / Title from first page of PDF file. Includes bibliographical references (p. 115-117).

No description available.

published_or_final_version / Statistics / Doctoral / Doctor of Philosophy

published_or_final_version / Statistics and Actuarial Science / Doctoral / Doctor of Philosophy

published_or_final_version / abstract / Computer Science / Master / Master of Philosophy

by Jian-Wei Chen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 84-86). / Chapter Chapter 1 --- Introduction / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Bayesian approach to single variable sampling plan for the exponential distribution --- p.3 / Chapter 1.3 --- Outline of the thesis --- p.7 / Chapter Chapter 2 --- Single Variable Sampling Plan With Type II Censoring / Chapter 2.1 --- Model --- p.10 / Chapter 2.2 --- Loss function and finite algorithm --- p.13 / Chapter 2.3 --- Numerical examples and sensitivity analysis --- p.17 / Chapter Chapter 3 --- Double Variable Sampling Plan With Type II Censoring / Chapter 3.1 --- Model --- p.25 / Chapter 3.2 --- Loss function and Bayes risk --- p.27 / Chapter 3.3 --- Discretization method and numerical analysis --- p.33 / Chapter Chapter 4 --- Bayesian Approach to Single Variable Sampling Plans for General Life Distribution with Type I Censoring / Chapter 4.1 --- Model --- p.42 / Chapter 4.2 --- The case of the Weibull distribution --- p.47 / Chapter 4.3 --- The case of the two-parameter exponential distribution --- p.49 / Chapter 4.4 --- The case of the gamma distribution --- p.52 / Chapter 4.5 --- Numerical examples and sensitivity analysis --- p.54 / Chapter Chapter 5 --- Discussions / Chapter 5.1 --- Comparison between Bayesian variable sampling plans and OC curve sampling plans --- p.63 / Chapter 5.2 --- Comparison between single and double sampling plans --- p.64 / Chapter 5.3 --- Comparison of both models --- p.66 / Chapter 5.4 --- Choice of parameters and coefficients --- p.66 / Appendix --- p.78 / References --- p.84

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Among the these proposed methods (i.e., random subspace, bagging, and pairwise classification), the pairwise classification method produces the highest accuracy at the expense of more computation time for training classifiers. The random subspace method and bagging approach have similar performance. To recognize a testing plankton pattern, the computational costs of the these methods are alike. / Due to the complexity of plankton recognition problem, it is difficult to pursue a single optimal classifier to meet all the requirements. In this work, instead of developing a single sophisticated classifier, we propose an ensemble learning framework based on the random sampling techniques including random subspace and bagging. In the random subspace method, a set of low-dimensional subspaces are generated by randomly sampling on the feature space, and multiple classifiers constructed from these random subspaces are combined to yield a powerful classifier. In the bagging approach, a number of independent bootstrap replicates are generated by randomly sampling with replacement on the training set. A classifier is trained on each replicate, and the final result is produced by integrating all the classifiers using majority voting. Using random sampling, the constructed classifiers are stable and multiple classifiers cover the entire feature space or the whole training set without losing discriminative information. Thus, good performance can be achieved. Experimental results demonstrate the effectiveness of the random sampling techniques for improving the system performance. / On the other hand, in previous approaches, normally the samples of all the plankton classes are used for a single classifier training. It may be difficult to select one feature space to optimally represent and classify all the patterns. Therefore, the overall accuracy rate may be low. In this work, we propose a pairwise classification framework, in which the complex multi-class plankton recognition problem is transformed into a set of two-class problems. Such a problem decomposition leads to a number of simpler classification problems to be solved, and it provides an approach for independent feature selection for each pair of classes. This is the first time for such a framework introduced in plankton recognition. We achieve nearly perfect classification accuracy on every pairwise classifier with less number of selected features, since it is easier to select an optimal feature vector to discriminate the two-class patterns. The ensemble of these pairwise classifiers will increase the overall performance. A high accuracy rate of 94.49% is obtained from a collection of more than 3000 plankton images, making it comparable with what a trained biologist can achieve by using conventional manual techniques. / Plankton including phytoplankton and zooplankton form the base of the food chain in the ocean and are a fundamental component of marine ecosystem dynamics. The rapid mapping of plankton abundance together with taxonomic and size composition can help the oceanographic researchers understand how climate change and human activities affect marine ecosystems. / Recently the University of South Florida developed the Shadowed Image Particle Profiling and Evaluation Recorder (SIPPER), an underwater video system which can continuously capture the magnified plankton images in the ocean. The SIPPER images differ from those used for most previous research in four aspects: (i) the images are much noisier, (ii) the objects are deformable and often partially occluded, (iii) the images are projection variant, i.e., the images are video records of three-dimensional objects in arbitrary positions and orientations, and (iv) the images are binary thus are lack of texture information. To deal with these difficulties, we implement three most valuable general features (i.e., moment invariants, Fourier descriptors, and granulometries) and propose a set of specific features such as circular projections, boundary smoothness, and object density to form a more complete description of the binary plankton patterns. These features are translation, scale, and rotation invariant. Moreover, they are less sensitive to noise. High-quality features will surely benefit the overall performance of the plankton recognition system. / Since all the features are extracted from the same plankton pattern, they may contain much redundant information and noise as well. Different types of features are incompatible in length and scale and the combined feature vector has a higher dimensionality. To make the best of these features for the binary SIPPER plankton image classification, we propose a two-stage PCA based scheme for feature selection, combination, and normalization. The first-stage PCA is used to compact every long feature vector by removing the redundant information and reduce noise as well, and the second-stage PCA is employed to compact the combined feature vector by eliminating the correlative information among different types of features. In addition, we normalize every component in the combined feature vector to the same scale according to its mean value and variance. In doing so, we reduce the computation time for the later recognition stage, and improve the classification accuracy. / Zhao Feng. / "May 2006." / Adviser: Xiaoou Tang. / Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6666. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (p. 121-136). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Mak, Man Yung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 115-117). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Conventional Censoring Schemes --- p.2 / Chapter 1.3 --- Type-II Progressively Hybrid Censoring Scheme --- p.4 / Chapter 1.4 --- Adaptive Type-II Progressively Hybrid Censoring Scheme --- p.6 / Chapter 1.5 --- Extreme Value Distribution --- p.8 / Chapter 1.6 --- The Scope of the Thesis --- p.11 / Chapter 2 --- Estimation methods --- p.12 / Chapter 2.1 --- Introduction --- p.12 / Chapter 2.2 --- Maximum Likelihood Estimators --- p.13 / Chapter 2.2.1 --- Type-II Progressively Hybrid Censoring Scheme --- p.13 / Chapter 2.2.2 --- Adaptive Type-II Progressively Hybrid Censoring Scheme --- p.15 / Chapter 2.3 --- Approximate Maximum Likelihood Estimators --- p.18 / Chapter 2.3.1 --- Type-II Progressively Hybrid Censoring Scheme --- p.18 / Chapter 2.3.2 --- Adaptive Type-II Progressively Hybrid Censoring Scheme --- p.20 / Chapter 2.4 --- Monte Carlo Simulation and Result --- p.23 / Chapter 2.4.1 --- Numerical Comparisons --- p.33 / Chapter 3 --- Construction of Confidence Intervals --- p.35 / Chapter 3.1 --- Introduction --- p.35 / Chapter 3.2 --- Asymptotic Confidence Interval --- p.36 / Chapter 3.2.1 --- Type-II Progressively Hybrid Censoring Scheme --- p.37 / Chapter 3.2.2 --- Adaptive Type-II Progressively Hybrid Censoring Scheme --- p.39 / Chapter 3.3 --- Parametric Percentile Bootstrap Confidence Interval --- p.56 / Chapter 3.3.1 --- Parametric Percentile Bootstrap Confidence Interval based on Maximum Likelihood Estimation method --- p.57 / Chapter 3.3.2 --- Parametric Percentile Bootstrap Confidence Interval based on Approximate Maximum Likelihood Estimation method --- p.65 / Chapter 3.4 --- Parametric Bootstrap-t Confidence Interval --- p.71 / Chapter 3.4.1 --- Parametric Bootstrap-t Confidence Interval based on Maximum Likelihood Estimation method --- p.72 / Chapter 3.4.2 --- Parametric Bootstrap-t Confidence Interval based on Approxi mate Maximum Likelihood Estimation method --- p.79 / Chapter 3.5 --- Numerical Comparisons --- p.86 / Chapter 4 --- Expected Total Test Time --- p.88 / Chapter 4.1 --- Introduction --- p.88 / Chapter 4.2 --- Type-II Progressively Hybrid Censoring Scheme --- p.89 / Chapter 4.3 --- Adaptive Type-II Progressively Hybrid Censoring Scheme --- p.92 / Chapter 4.4 --- Numerical Comparisons --- p.99 / Chapter 5 --- Optimality Criteria and Censoring Schemes --- p.100 / Chapter 5.1 --- Introduction --- p.100 / Chapter 5.2 --- Optimality Criteria --- p.101 / Chapter 5.3 --- Expected Fisher Information Matrix --- p.102 / Chapter 5.3.1 --- Type-II Progressively Hybrid Censoring Scheme --- p.103 / Chapter 5.4 --- Optimal Censoring Scheme for Progressively Hybrid Censoring --- p.106 / Chapter 6 --- Conclusions and Further Research --- p.113 / Bibliography --- p.115

There has been widespread concern expressed by members of the statistics education community in the past few years about the lack of any real understanding demonstrated by many students completing courses in introductory statistics. This deficiency in understanding has been particularly noted in the area of inferential statistics, where students, particularly those studying statistics as a service course, have been inclined to view statistical inference as a set of unrelated recipes. As such, these students have developed skills that have little practical application and are easily forgotten. This thesis is concerned with the development of understanding in statistical inference for beginning students of statistics at the post-secondary level. This involves consideration of the nature of understanding in introductory statistical inference, and how understanding can be measured in the context of statistical inference. In particular, the study has examined the role of the sampling distribution in the students? schemas for statistical inference, and its relationship to both conceptual and procedural understanding. The results of the study have shown that, as anticipated, students will construct highly individual schemas for statistical inference but that the degree of integration of the concept of sampling distribution within this schema is indicative of the level of development of conceptual understanding in that student. The results of the study have practical implications for the teaching of courses in introductory statistics, in terms of content, delivery and assessment.