Bayesian network is a probabilistic graphical model that has wide applications in various domains due to its peculiarity of knowledge representation and reasoning under uncertainty. This research aims at Bayesian network structure learning and how the learned model can be used for reasoning. Learning the structure of Bayesian network from data is…

Place-based initiatives often use resident surveys to inform and evaluate interventions. Sampling based on well-defined sampling frames is important but challenging for initiatives that target subpopulations. Databases that enumerate total population counts can produce overinclusive sampling frames, resulting in costly outreach to ineligible…

This thesis studies four independent resource allocation problems with different assumptions on information available to the central planner, and strategic considerations of the agents present in the system. We start off with an online, non-strategic agents setting in Chapter 1, where we study the dynamic pricing and learning problem under the…

The adaptive learning problem concerns how to create an individualized learning plan (also referred to as a learning policy) that chooses the most appropriate learning materials based on a learner's latent traits. In this article, we study an important yet less-addressed adaptive learning problem--one that assumes continuous latent traits.…

This study shows that residual variation can cause problems related to scaling in exponential random graph models (ERGM). Residual variation is likely to exist when there are unmeasured variables in a model--even those uncorrelated with other predictors--or when the logistic form of the model is inappropriate. As a consequence, coefficients cannot…

Discussion of text compression focuses on a method to reduce the amount of storage needed to represent a Markov model with an extended alphabet, by applying a clustering scheme that brings together similar states. Highlights include probability vectors; algorithms; implementation details; and experimental data with natural languages. (Author/LRW)

ORDMET is applicable to structures obtained from additive conjoint measurement designs, unfolding theory, general Fechnerian scaling, types of multidimensional scaling, and ordinal multiple regression. A description is obtained of the space containing all possible numerical representations which can satisfy the structure, size, and shape of which…

Generalizing Boolean matrix decomposition to a larger class of matrix decomposition models is demonstrated, and probability matrix decomposition (PMD) models are introduced as a probabilistic version of the larger class. An algorithm is presented for the computation of maximum likelihood and maximum a posteriori estimates of the parameters of PMD…

Presents a coordination level matching algorithm to be used in document retrieval systems that incorporate relevance feedback strategies. It is argued that this algorithm may eliminate the need for the frequent reevaluation of documents that is currently found in such systems, and conditions under which reranking is unnecessary are given.…

This article gives a comprehensive description of a theory for efficient assessment of knowledge. The essential concept is that the knowledge state of a subject, with regard to a specified field of information, can be represented by a particular subset of problems that the subject is capable of solving. (SLD)