Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 52 for “"Information Complexity"”.

  1. Information Complexity in Material Culture

    … of art, why humans invest in art, what information artworks carry and how art functions within the community still remain elusive. To address these unresolved questions, this present thesis integrates ethnographic accounts with data governance and statistical approaches to systematically …

    qucosa-diss

  2. Sparse Model Selection using Information Complexity

    … dissertation studies and uses the application of information complexity to statistical model selection through three different projects. Specifically, we design statistical models that incorporate sparsity features to make the models more explanatory and computationally efficient.</p> <p>In the …

    utk-theses Repository record for Sparse Model Selection using Information Complexity (opens in a new tab)

  3. Information, complexity and structure in convex optimization

    … algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the worst-case behavior of methods based on local oracles (a generalization of first-order oracle for smooth functions) for nonsmooth convex minimization, both in …

    gatech Repository record for Information, complexity and structure in convex optimization (opens in a new tab)

  4. Mixture model cluster analysis under different covariance structures using information complexity

    <p>In this thesis, a mixture-model cluster analysis technique under different covariance structures of the component densities is developed and presented, to capture the compactness, orientation, shape, and the volume of component clusters in one expert system to handle Gaussian high dimensional …

    ut-knoxville Repository record for Mixture model cluster analysis under different covariance structures using information complexity (opens in a new tab)

  5. Data adaptive kernal discriminant analysis using information complexity criterion and genetic algorithm

    … distribution. Our approach incorporates the information-theoretic measure of complexity (ICOMP) criterion with the genetic algorithm and kernel density estimators in discriminant analysis. This approach enables researchers to find both the optimal bandwidth matrix for the kernel density …

    utk-theses Repository record for Data adaptive kernal discriminant analysis using information complexity criterion and genetic algorithm (opens in a new tab)

  6. Multivariate Mixed Data Mining with Gifi System using Genetic Algorithm and Information Complexity

    … data using genetic algorithm and Bozdogan's information complexity, ICOMP. We show that the results of the maximum likelihood values are not just sufficient in determining the optimal number of mixtures. We also address the issue of high dimensional binary data using a genetic algorithm to …

    utk-theses Repository record for Multivariate Mixed Data Mining with Gifi System using Genetic Algorithm and Information Complexity (opens in a new tab)

  7. Data Mining with Multivariate Kernel Regression Using Information Complexity and the Genetic Algorithm

    … multivariate kernel density regression using information complexity and the genetic algorithm as a heuristic optimizer to choose the optimal bandwidth and the best predictors in kernel regression models. Simulated and real data will be used to cross validate the optimal bandwidth selectors …

    utk-theses Repository record for Data Mining with Multivariate Kernel Regression Using Information Complexity and the Genetic Algorithm (opens in a new tab)

  8. Robust and Misspecification Resistant Model Selection in Regression Models with Information Complexity and Genetic Algorithms

    … use a three-way hybrid method which employs the information theoretic measure of complexity (ICOMP) computed on robust M-estimators as model subset selection criteria, integrated with genetic algorithms (GA) as the subset model searching engine.</p> <p>Despite the rich literature on the robust …

    utk-theses Repository record for Robust and Misspecification Resistant Model Selection in Regression Models with Information Complexity and Genetic Algorithms (opens in a new tab)

  9. Model Selection Techniques for Kernel-Based Regression Analysis Using Information Complexity Measure and Genetic Algorithms

    … the use of a model selection criterion based on information complexity (ICOMP) measure for kernel-based regression analysis and its applications. ICOMP penalizes both the lack-of-fit and the complexity of the model to choose the optimal model with good generalization properties. ICOMP provides a …

    utk-theses Repository record for Model Selection Techniques for Kernel-Based Regression Analysis Using Information Complexity Measure and Genetic Algorithms (opens in a new tab)

  10. A New Generation of Mixture-Model Cluster Analysis with Information Complexity and the Genetic EM Algorithm

    … of the observations. We likewise extend various information criteria (Akaike, 1973; Bozdogan, 1994b; Schwarz, 1978) to the elliptically-contoured and kernel mixture models. Information criteria guide model selection and estimation based on various approximations to the Kullback-Liebler …

    utk-theses Repository record for A New Generation of Mixture-Model Cluster Analysis with Information Complexity and the Genetic EM Algorithm (opens in a new tab)

  11. Multivariate Nonnormal Regression Models, Information Complexity, and Genetic Algorithms: A Three Way Hybrid for Intelligent Data Mining

    … statistical modeling procedures based on the information-theoretic measure of complexity (ICOMP) criterion with genetic algorithm (GA) and multivariate nonnormal regression models with Power Exponential (PE) and fam- ily of elliptically contoured (EC) error distributions. This dissertation is …

    utk-theses Repository record for Multivariate Nonnormal Regression Models, Information Complexity, and Genetic Algorithms: A Three Way Hybrid for Intelligent Data Mining (opens in a new tab)

  12. Variable selection via penalized regression and the genetic algorithm using information complexity, with applications for high-dimensional -omics data

    … models. Chapters 1, 2, and 3 provide background information that will be used throughout the remaining chapters, on topics including but not limited to information complexity, model selection, covariance estimation, stepwise variable selection, penalized regression, and especially the genetic …

    utk-theses Repository record for Variable selection via penalized regression and the genetic algorithm using information complexity, with applications for high-dimensional -omics data (opens in a new tab)

  13. Topics in Classical and Quantum Optimization: Complexity and Algorithms

    … presents advances revolving around optimization, complexity, and applications of quantum computing. In particular, Part 1 studies information complexity, focusing on convex mixed-integer optimization through the contents of (Basu, Jiang, Kerger, Molinaro 2023), primarily. With new results on lower …

    jhu Repository record for Topics in Classical and Quantum Optimization: Complexity and Algorithms (opens in a new tab)

  14. Motion Segmentation Aided Super Resolution Image Reconstruction

    … on motion segmentation. The main thrust is Information Complexity guided Gaussian Mixture Models (GMMs) for Statistical Background Modeling. In the process of developing our framework we also focus on two other topics; motion trajectories estimation toward global and local scene change …

    utk-theses Repository record for Motion Segmentation Aided Super Resolution Image Reconstruction (opens in a new tab)

  15. An Information Approach to Regularization Parameter Selection for the Solution of Ill-Posed Inverse Problems Under Model Misspecification

    … selection methods through the use of the information complexity approach.</p> <p>The original contribution of the dissertation to the field of ill-posed inverse problems in engineering is a new robust regularization parameter selection method. This method is misspecification-resistant, …

    utk-theses Repository record for An Information Approach to Regularization Parameter Selection for the Solution of Ill-Posed Inverse Problems Under Model Misspecification (opens in a new tab)

  16. PATTERN SEEKING AND SERVICE SYSTEM DESIGN DRIVEN BY FACT-BASED DECISION-MAKING

    … scheduling problem using a parsimonious set of information on the consultation durations. The third topic explores how information complexity and pattern recognition affect the perception of randomness.

    nus Repository record for PATTERN SEEKING AND SERVICE SYSTEM DESIGN DRIVEN BY FACT-BASED DECISION-MAKING (opens in a new tab) Download file for PATTERN SEEKING AND SERVICE SYSTEM DESIGN DRIVEN BY FACT-BASED DECISION-MAKING (opens in a new tab)

  17. Complexity as a cause of environmental inaction : case studies of large-scale wind energy development in Saskatchewan

    … issues like this one is often the result of complexity, either the inherent complexity of the problem being targeted or the complexity of the communicated information surrounding the problem. Inherent complexity is managed chiefly by central decision-makers and influential stakeholders of the …

    sask Repository record for Complexity as a cause of environmental inaction : case studies of large-scale wind energy development in Saskatchewan (opens in a new tab)

  18. Understanding and Supporting Decision Making in Denied and Degraded Environments

    … in well-structured environments with perfect information. Tasks in the research most often focus on decisions made with complete information in an unlimited time-frame, and in cases where information is missing or uncertain, the current research stops short of addressing the effect of the …

    gatech Repository record for Understanding and Supporting Decision Making in Denied and Degraded Environments (opens in a new tab)

  19. Conditional Preference Networks: Learning and Optimization

    … Concerning the learning aspect, we determine the information complexity of learning acyclic CP-nets in di erent models. We also consider the problem of learning CP-nets from queries and provide query strategies that are shown to be near-optimal. With regard to the optimization part, we study the …

    regina Repository record for Conditional Preference Networks: Learning and Optimization (opens in a new tab) Download PDF for Conditional Preference Networks: Learning and Optimization (opens in a new tab)

Page 1 of 3