排序方式: 共有14条查询结果,搜索用时 0 毫秒
11.
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. 相似文献
12.
Transforming the core array in Tucker three-way component analysis to simplicity is an intriguing way of revealing structures
in between standard Tucker three-way PCA, where the core array is unconstrained, and CANDECOMP/PARAFAC, where the core array
has a generalized diagonal form. For certain classes of arrays, transformations to simplicity, that is, transformations that
produce a large number of zeros, can be obtained explicitly by solving sets of linear equations. The present paper extends
these results. First, a method is offered to simplifyJ ×J × 2 arrays. Next, it is shown that the transformation that simplifies anI ×J ×K array can be used to also simplify the (complementary) arrays of order (JK −I) ×J ×K, of orderI × (IK −J) ×K and of orderI ×J × (IJ −K). Finally, the question of what constitutes the maximal simplicity for arrays (the maximal number of zero elements) will
be considered. It is shown that cases of extreme simplicity, considered in the past, are, in fact, cases of maximal simplicity. 相似文献
13.
On a test of dimensionality in redundancy analysis 总被引:1,自引:0,他引:1
Lazraq and Cléroux (Psychometrika, 2002, 411–419) proposed a test for identifying the number of significant components in redundancy analysis. This test, however, is ill-conceived. A major problem is that it regards each redundancy component as if it were a single observed predictor variable, which cannot be justified except for the rare situations in which there is only one predictor variable. Consequently, the proposed test leads to drastically biased results, particularly when the number of predictor variables is large, and it cannot be recommended for use. This is shown both theoretically and by Monte Carlo studies.The work reported in this paper was supported by Grant A6394 to the first author from the Natural Sciences and Engineering Research Council of Canada. 相似文献
14.