A BAYESIAN SHRINKAGE MODEL FOR INCOMPLETE LONGITUDINAL BINARY DATA WITH APPLICATION TO THE BREAST CANCER PREVENTION TRIAL

We consider inference in randomized studies, in which repeatedly measured outcomes may be informatively missing due to drop out. In this setting, it is well known that full data estimands are not identified unless unverified assumptions are imposed. We assume a non-future dependence model for the drop-out mechanism and posit an exponential tilt model that links non-identifiable and identifiable distributions. This model is indexed by non-identified parameters, which are assumed to have an informative prior distribution, elicited from subject-matter experts. Under this model, full data estimands are shown to be expressed as functionals of the distribution of the observed data. To avoid the curse of dimensionality, we model the distribution of the observed data using a Bayesian shrinkage model. In a simulation study, we compare our approach to a fully parametric and a fully saturated model for the distribution of the observed data. Our methodology is motivated and applied to data from the Breast Cancer Prevention Trial.

A unified approach to modeling multivariate binary data using copulas over partitions

Many seemingly disparate approaches for marginal modeling have been developed in recent years. We demonstrate that many current approaches for marginal modeling of correlated binary outcomes produce likelihoods that are equivalent to the proposed copula-based models herein. These general copula models of underlying latent threshold random variables yield likelihood based models for marginal fixed effects estimation and interpretation in the analysis of correlated binary data. Moreover, we propose a nomenclature and set of model relationships that substantially elucidates the complex area of marginalized models for binary data. A diverse collection of didactic mathematical and numerical examples are given to illustrate concepts.

Variation in habitat choice and delayed reproduction: Adaptive queuing strategies or individual quality differences?

In most species, some individuals delay reproduction or occupy inferior breeding positions. The queue hypothesis tries to explain both patterns by proposing that individuals strategically delay breeding (queue) to acquire better breeding or social positions. In 1995, Ens, Weissing, and Drent addressed evolutionarily stable queuing strategies in situations with habitat heterogeneity. However, their model did not consider the non - mutually exclusive individual quality hypothesis, which suggests that some individuals delay breeding or occupy inferior breeding positions because they are poor competitors. Here we extend their model with individual differences in competitive abilities, which are probably plentiful in nature. We show that including even the smallest competitive asymmetries will result in individuals using queuing strategies completely different from those in models that assume equal competitors. Subsequently, we investigate how well our models can explain settlement patterns in the wild, using a long-term study on oystercatchers. This long-lived shorebird exhibits strong variation in age of first reproduction and territory quality. We show that only models that include competitive asymmetries can explain why oystercatchers' settlement patterns depend on natal origin. We conclude that predictions from queuing models are very sensitive to assumptions about competitive asymmetries, while detecting such differences in the wild is often problematic.

USING PROBABILISTIC GRAPHICAL MODELS TO DRAW INFERENCES IN SENSOR NETWORKS WITH TRACKING APPLICATIONS

Sensor networks have been an active research area in the past decade due to the variety of their applications. Many research studies have been conducted to solve the problems underlying the middleware services of sensor networks, such as self-deployment, self-localization, and synchronization. With the provided middleware services, sensor networks have grown into a mature technology to be used as a detection and surveillance paradigm for many real-world applications. The individual sensors are small in size. Thus, they can be deployed in areas with limited space to make unobstructed measurements in locations where the traditional centralized systems would have trouble to reach. However, there are a few physical limitations to sensor networks, which can prevent sensors from performing at their maximum potential. Individual sensors have limited power supply, the wireless band can get very cluttered when multiple sensors try to transmit at the same time. Furthermore, the individual sensors have limited communication range, so the network may not have a 1-hop communication topology and routing can be a problem in many cases. Carefully designed algorithms can alleviate the physical limitations of sensor networks, and allow them to be utilized to their full potential. Graphical models are an intuitive choice for designing sensor network algorithms. This thesis focuses on a classic application in sensor networks, detecting and tracking of targets. It develops feasible inference techniques for sensor networks using statistical graphical model inference, binary sensor detection, events isolation and dynamic clustering. The main strategy is to use only binary data for rough global inferences, and then dynamically form small scale clusters around the target for detailed computations. This framework is then extended to network topology manipulation, so that the framework developed can be applied to tracking in different network topology settings. Finally the system was tested in both simulation and real-world environments. The simulations were performed on various network topologies, from regularly distributed networks to randomly distributed networks. The results show that the algorithm performs well in randomly distributed networks, and hence requires minimum deployment effort. The experiments were carried out in both corridor and open space settings. A in-home falling detection system was simulated with real-world settings, it was setup with 30 bumblebee radars and 30 ultrasonic sensors driven by TI EZ430-RF2500 boards scanning a typical 800 sqft apartment. Bumblebee radars are calibrated to detect the falling of human body, and the two-tier tracking algorithm is used on the ultrasonic sensors to track the location of the elderly people.

On Graphically Checking Goodness-of-fit of Binary Logistic Regression Models

OBJECTIVES: This paper is concerned with checking goodness-of-fit of binary logistic regression models. For the practitioners of data analysis, the broad classes of procedures for checking goodness-of-fit available in the literature are described. The challenges of model checking in the context of binary logistic regression are reviewed. As a viable solution, a simple graphical procedure for checking goodness-of-fit is proposed. METHODS: The graphical procedure proposed relies on pieces of information available from any logistic analysis; the focus is on combining and presenting these in an informative way. RESULTS: The information gained using this approach is presented with three examples. In the discussion, the proposed method is put into context and compared with other graphical procedures for checking goodness-of-fit of binary logistic models available in the literature. CONCLUSION: A simple graphical method can significantly improve the understanding of any logistic regression analysis and help to prevent faulty conclusions.

Diffusion-weighted imaging of the parotid gland: Influence of the choice of b-values on the apparent diffusion coefficient value

PURPOSE: To determine how the ADC value of parotid glands is influenced by the choice of b-values. MATERIALS AND METHODS: In eight healthy volunteers, diffusion-weighted echo-planar imaging (DW-EPI) was performed on a 1.5 T system, with b-values (in seconds/mm2) of 0, 50, 100, 150, 200, 250, 300, 500, 750, and 1000. ADC values were calculated by two alternative methods (exponential vs. logarithmic fit) from five different sets of b-values: (A) all b-values; (B) b=0, 50, and 100; (C) b=0 and 750; (D) b=0, 500, and 1000; and (E) b=500, 750, and 1000. RESULTS: The mean ADC values for the different settings were (in 10(-3) mm2/second, exponential fit): (A) 0.732+/-0.019, (B) 2.074+/-0.084, (C) 0.947+/-0.020, (D) 0.890+/-0.023, and (E) 0.581+/-0.021. ADC values were significantly (P <0.001) different for all pairwise comparisons of settings (A-E) of b-values, except for A vs. D (P=0.172) and C vs. D (P=0.380). The ADC(B) was significantly higher than ADC(C) or ADC(D), which was significantly higher than ADC(E). ADC values from exponential vs. logarithmic fit (P=0.542), as well as left vs. right parotid gland (P=0.962), were indistinguishable. CONCLUSION: The ADC values calculated from low b-value settings were significantly higher than those calculated from high b-value settings. These results suggest that not only true diffusion but also perfusion and saliva flow may contribute to the ADC.