Research and application of virtual user context information security strategy based on group intelligent computing

This article first introduced the current technology of the privacy protection model, and analyzed their characteristics and deficiencies. Afterwards, from the point of view of revenue, the shortcomings of the traditional privacy protection model have analyzed through the group intelligent computing method. Based on this, this paper proposes a research and application of virtual user information of security strategy based on group intelligent computing, through the collection of visitor's private information historical access data, intelligent calculation of the strategy group between the visitor and the interviewee. The setting of the threshold of the visited person can protect the privacy information of the user more effectively. In this paper, the implementation flow, algorithm implementation process, and specific architecture design of the proposed virtual user of privacy protection model based on group intelligent computing are introduced respectively. The specific algorithms include PCA, BP neural network, and genetic algorithm. Finally, the proposed privacy has verified through experiments. Protection model can protect user privacy more effectively than traditional privacy protection model. In the future, we will further expand and improve the privacy protection model of virtual users based on group intelligent computing, including considering the dynamic and inconsistency of access to the privacy information, that is, accessing different private information will produce different overlay effects and parallelism. We will also study how to apply this model to actual systems such as shopping websites and social platforms, and use commercial data to evaluate the performance of the model and further improve it.     

First-Order Learning Models With the GDINA: Estimation With the EM Algorithm and Applications

In learning environments, understanding the longitudinal path of learning is one of the main goals. Cognitive diagnostic models (CDMs) for measurement combined with a transition model for mastery may be beneficial for providing fine-grained information about students’ knowledge profiles over time. An efficient algorithm to estimate model parameters would augment the practicality of this combination. In this study, the Expectation–Maximization (EM) algorithm is presented for the estimation of student learning trajectories with the GDINA (generalized deterministic inputs, noisy, “and” gate) and some of its submodels for the measurement component, and a first-order Markov model for learning transitions is implemented. A simulation study is conducted to investigate the efficiency of the algorithm in estimation accuracy of student and model parameters under several factors—sample size, number of attributes, number of time points in a test, and complexity of the measurement model. Attribute- and vector-level agreement rates as well as the root mean square error rates of the model parameters are investigated. In addition, the computer run times for converging are recorded. The result shows that for a majority of the conditions, the accuracy rates of the parameters are quite promising in conjunction with relatively short computation times. Only for the conditions with relatively low sample sizes and high numbers of attributes, the computation time increases with a reduction parameter recovery rate. An application using spatial reasoning data is given. Based on the Bayesian information criterion (BIC), the model fit analysis shows that the DINA (deterministic inputs, noisy, “and” gate) model is preferable to the GDINA with these data.     

卡方自动交叉检验在人群细分中的应用

卡方自动交叉检验（CHi-squaredAutomaticInteractionDetector,CHAID）是一种定性的统计分类技术,主要解决根据一个因变量的不同反应确定若干预测变量的特征问题。这种算法模型可广泛应用于社会调查和市场细分中,根据不同的目的细分人群。该文主要介绍了CHAID算法模型的概念和发展,理论基础和应用过程,以及其效度检验方法,并将其与Logit模型等作了比较,指出其优势和局限。最后提出了研究展望     

不同链接函数下多级评分认知诊断模型的比较及应用研究

认知诊断测验因具有传统测验所不具备的诊断功能而日益受到重视。当前多级评分认知诊断模型开发中,研究者采用不同的链接函数（Link Function）开发出不同的多级评分认知诊断模型。本研究基于局部或相邻类别链接函数(Local or Adjacent Categories Link Function)的思想,开发出多级评分认知诊断模型LC-DINA研究采用Monte Carlo模拟研究与实证应用研究相结合的方法,将新开发模型与已有模型进行比较并应用于国际数学与科学评估（TIMMS）中,为实际应用者提供了借鉴。     

A pseudo-dynamic search ant colony optimization algorithm with improved negative feedback mechanism

To solve low convergence precision and slow convergence speed, a pseudo-dynamic search ant colony optimization algorithm with improved negative feedback mechanism (PACON) is proposed. Firstly, the algorithm introduces an angle in the pheromone transfer rule. Through the rule for calculating the angle, multiple cities with smaller angles are also included in the next candidate city list. It affects the probability of city selection and enhances the algorithm’ performance to avoid local optimization. Secondly, the algorithm updates the pheromone concentrations on the worst and optimal path simultaneously, and enhances the weights of the pheromone concentrations on the optimal path. It improves the convergence speed of the algorithm. Based on experiments adopting TSPLIB data sets, the results demonstrate the improved algorithm improves the convergence accuracy by at least 1.26% and increases the convergence speed by at least 9.5%, both on large-scale and small-scale urban data. The novel algorithm will improve convergence precision and speed better.     

机器学习在抑郁症领域的应用

抑郁症患者疾病意识的不足以及早期筛查方法的缺乏导致患者在被诊断时大多已发展至重性抑郁障碍。为改善现状, 近年来机器学习被逐渐应用到抑郁症的早期预测、早期识别、辅助诊断和治疗决策中。在应用中, 机器学习模型准确性的影响因素包括样本集种类及规模、特征工程、算法类型等。建议未来将机器学习进一步融入医疗健康系统及移动应用程序等, 不断优化机器学习模型, 通过充分挖掘患者健康数据来改善抑郁症的预防、识别、诊断和治疗等相关问题。     

Exploratory analysis of contingency tables by loglinear formulation and generalizations of correspondence analysis

Goodman's (1979, 1981, 1985) loglinear formulation for bi-way contingency tables is extended to tables with or without missing cells and is used for exploratory purposes. A similar formulation is done for three-way tables and generalizations of correspondence analysis are deduced. A generalized version of Goodman's algorithm, based on Newton's elementary unidimensional method is used to estimate the scores in all cases.This research was partially supported by National Science and Engineering Research Council of Canada, Grant No. A8724. The author is grateful to the reviewers and the editor for helpful comments.     

Principals versus osmod: A comment on saito and otsu

Saito and Otsu (1988) compared their OSMOD method of nonmetric principal-component analysis to an early and incorrect implementation of the PRINCIPALS algorithm of Young, Takane, and de Leeuw (1978). In this comment we present results from the current, correct implementations of the algorithm.     

Full-information item bi-factor analysis

A plausibles-factor solution for many types of psychological and educational tests is one that exhibits a general factor ands − 1 group or method related factors. The bi-factor solution results from the constraint that each item has a nonzero loading on the primary dimension and at most one of thes − 1 group factors. This paper derives a bi-factor item-response model for binary response data. In marginal maximum likelihood estimation of item parameters, the bi-factor restriction leads to a major simplification of likelihood equations and (a) permits analysis of models with large numbers of group factors; (b) permits conditional dependence within identified subsets of items; and (c) provides more parsimonious factor solutions than an unrestricted full-information item factor analysis in some cases. Supported by the Cognitive Science Program, Office of Naval Research, Under grant #N00014-89-J-1104. We would like to thank Darrell Bock for several helpful suggestions.     

A Bayesian approach to nonlinear latent variable models using the Gibbs sampler and the metropolis-hastings algorithm

Nonlinear latent variable models are specified that include quadratic forms and interactions of latent regressor variables as special cases. To estimate the parameters, the models are put in a Bayesian framework with conjugate priors for the parameters. The posterior distributions of the parameters and the latent variables are estimated using Markov chain Monte Carlo methods such as the Gibbs sampler and the Metropolis-Hastings algorithm. The proposed estimation methods are illustrated by two simulation studies and by the estimation of a non-linear model for the dependence of performance on task complexity and goal specificity using empirical data.