Association rule learning in neuropsychological data analysis for Alzheimer’s disease

Efficient methods of analysis readily available for clinicians continue to be limited within neuropsychological assessment at the raw data level. Here, a novel approach for generating predictive response patterns and analysing neuropsychological raw data is offered. In order to assess the usefulness of association rule learning as an analysis tool for neuropsychological raw data, Frequent Pattern Growth (FP-Growth) was used to mine patterns from the Consortium to Establish a Registry for Alzheimer’s Disease Neuropsychological Battery (CERAD-NB) database. Complete assessment data for 84 post-mortem confirmed Alzheimer’s disease (AD) cases and 294 age, race, and education matched controls were analysed across baseline and one-year follow-up using FP-Growth, for the purpose of assessing the clinical utility of a finer analysis at the raw data level and the feasibility of predicting response patterns for clinical/control groups. Output from FP-Growth, in terms of the number of frequent itemsets retained across both evaluation timepoints, was discernable between controls, mild, and moderate to severe Alzheimer’s disease cases (p < .001, and η² = .488). Patterns within raw data scores, both in terms of frequent itemsets and predictive association rules, appear to be differentiable across groups within neuropsychological analysis, which indicates that FP-Growth is applicable as a supplementary analysis tool for neuropsychological assessment by means of offering an additional level of data analysis, predictive item response capabilities, and aiding in clinical decision making.     

Local supersaturation during melting in a temperature gradient

A homogeneous single-phase Al–Cu alloy was exposed to a steep temperature gradient for a short time interval, melting of the sample at the hot end was interrupted at intermediate stages. In the resolidified microstructure, the local supersaturation was determined by analysing concentration profiles across former liquid films at grain boundaries and adjacent zones in the grain interior. Already at moderate heating rates (3 K/s) significant supersaturations occurred and were quantified.     

Revealing texture architecture in a surface gradient nanostructured Al-Cu-Mg alloy

ABSTRACT

A multiscale crystallographic texture architecture in a surface gradient nanostructured Al-Cu-Mg alloy after surface sliding friction treatment (SSFT) has been revealed by a combination of electron backscatter diffraction and precession electron diffraction (PED)-assisted transmission electron microscopy (TEM) orientation mapping. Accompanying a grain structure variation from lamellar coarse grains to equiaxed nanograins, the major texture components evolve from brass {110}<112> in the coarse-grain matrix, Goss {110}<001> at a depth of ～80?μm, E {111}<011> and F {111}<112> at a depth of ～20?μm, to a mixture of rotated cube {001}<110>, E and F in the topmost surface layer. The through-thickness textural development and evolution are attributed to the cyclic loading of concurrent shear and compression during the SSFT processing. The PED-assisted orientation mapping shows good capability in mapping severe plastic-deformation-induced nanostructures with large residual strains and high defect density.     

New experimental test of strain-gradient plasticity theory: metal foil sandwich structures in flexure

Experimental tests of strain-gradient plasticity theory rely on studies of the size effect (smaller is stronger) in micromechanical testing. The plastic strain gradient is varied by varying the size of the specimen. This confounds the direct effects of the size and the effects of the strain gradient. We propose experiments on foil sandwich structures in which these parameters are separated. Preliminary results suggest that it is the foil thickness that determines the strength, not the strain gradient.     

Trade‐off ranking method for multi‐criteria decision analysis

Multi‐criteria decision analysis presumes trade‐off between different criteria. As a result, the optimal solution is not unique and can be represented by the Pareto frontier in the objective space. Each Pareto solution is a compromise between different objectives. Despite a limited number of Pareto optimal solutions, the decision‐maker eventually has to choose only one option. Such a choice has to be made with the use of additional preferences not included in the original formulation of the optimization problem. The paper represents a new approach to an automatic ranking that can help the decision‐maker. In contrast to the other methodologies, the proposed method is based on the minimization of trade‐off between different Pareto solutions. To be realized, the approach presumes the existence of a well‐distributed Pareto set representing the entire Pareto frontier. In the paper, such a set is generated with the use of the directed search domain algorithm. The method is applied to a number of test cases and compared against two existing alternative approaches.     

Methodology to select solutions for multiobjective optimization problems: Weighted stress function method

The weighted stress function method is proposed here as a new way of identifying the best solution from a set of nondominated solutions according to the decision maker's preferences, expressed in terms of weights. The method was tested using several benchmark problems from the literature, and the results obtained were compared with those of other methods, namely, the reference point evolutionary multiobjective optimization (EMO), the weighted Tchebycheff metric, and a goal programming method. The weighted stress function method can be seen to exhibit a more direct correspondence between the weights set by the decision maker and the final solutions obtained than the other methods tested.     

改进的MCMC算法及其在估计IRT模型参数中的应用

本文首先简要的阐述了MCMC算法的思想及在IRT参数估计中的操作过程;其次,针对该算法存在的一些问题,提出相应的改进建议;然后,分别运用传统的和改进型的MCMC算法进行模拟数据分析和比较,结果显示新的方法表现更好;最后总结新方法的优点所在,并指出下一步的研究方向。     

Bayesian Analysis of Nonlinear Structural Equation Models with Nonignorable Missing Data

A Bayesian approach is developed for analyzing nonlinear structural equation models with nonignorable missing data. The nonignorable missingness mechanism is specified by a logistic regression model. A hybrid algorithm that combines the Gibbs sampler and the Metropolis–Hastings algorithm is used to produce the joint Bayesian estimates of structural parameters, latent variables, parameters in the nonignorable missing model, as well as their standard errors estimates. A goodness-of-fit statistic for assessing the plausibility of the posited nonlinear structural equation model is introduced, and a procedure for computing the Bayes factor for model comparison is developed via path sampling. Results obtained with respect to different missing data models, and different prior inputs are compared via simulation studies. In particular, it is shown that in the presence of nonignorable missing data, results obtained by the proposed method with a nonignorable missing data model are significantly better than those that are obtained under the missing at random assumption. A real example is presented to illustrate the newly developed Bayesian methodologies. This research is fully supported by a grant (CUHK 4243/03H) from the Research Grant Council of the Hong Kong Special Administration Region. The authors are thankful to the editor and reviewers for valuable comments for improving the paper, and also to ICPSR and the relevant funding agency for allowing the use of the data. Requests for reprints should be sent to Professor S.Y. Lee, Department of Statistics, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong.     

Bayesian adaptive estimation: The next dimension

We propose a new psychometric model for two-dimensional stimuli, such as color differences, based on parameterizing the threshold of a one-dimensional psychometric function as an ellipse. The Ψ Bayesian adaptive estimation method applied to this model yields trials that vary in multiple stimulus dimensions simultaneously. Simulations indicate that this new procedure can be much more efficient than the more conventional procedure of estimating the psychometric function on one-dimensional lines independently, requiring only one-fourth or less the number of trials for equivalent performance in typical situations. In a real psychophysical experiment with a yes-no task, as few as 22 trials per estimated threshold ellipse were enough to consistently demonstrate certain color appearance phenomena. We discuss the practical implications of the multidimensional adaptation. In order to make the application of the model practical, we present two significantly faster algorithms for running the Ψ method: a discretized algorithm utilizing the Fast Fourier Transform for better scaling with the sampling rates and a Monte Carlo particle filter algorithm that should be able to scale into even more dimensions.