matrix decomposition
Recently Published Documents

With the increasing abundance of network teaching resources, the recommendation technology based on network is becoming more and more mature. There are differences in the effect of recommendation, which leads to great differences in the effect of recommendation algorithms for teaching resources. The existing teaching resource recommendation algorithm either takes insufficient consideration of the students’ personality characteristics, cannot well distinguish the students’ users through the students’ personality, and pushes the same teaching resources or considers the student user personality not sufficient and cannot well meet the individualized learning needs of students. Therefore, in view of the above problem, combining TDINA model by the user for the students to build cognitive diagnosis model, we put forward a model based on convolution (CUPMF) joint probability matrix decomposition method of teaching resources to recommend the method combined with the history of the students answer, cognitive ability, knowledge to master the situation, and forgetting effect factors. At the same time, CNN is used to deeply excavate the test question resources in the teaching resources, and the nonlinear transformation of the test question resources output by CNN is carried out to integrate them into the joint probability matrix decomposition model to predict students’ performance on the resources. Finally, the students’ knowledge mastery matrix obtained by TDINA model is combined to recommend corresponding teaching resources to students, so as to improve learning efficiency and help students improve their performance.

With the improvement of living standards, more and more people are pursuing personalized routes. This paper uses personalized mining of interest points of ethnic minority tourism demand groups, extracts customer data features in social networks, and constructs data features of interesting topic factors, geographic location factors, and user access frequency factors, using LDA topic models and matrix decomposition models to perform feature vectorization processing on user sign-in records and build deep learning recommendation model (DLM). Using this model to compare with the traditional recommendation model and the recommendation model of a single data feature module, the experimental results show the following: (1) The fitting error of DLM recommendation results is significantly reduced, and its recommendation accuracy rate is 50% higher than that of traditional recommendation algorithms. The experimental results show that the DLM constructed in this paper has good learning and training performance, and the recommendation effect is good. (2) In this method, the performance of the DLM is significantly higher than other POI recommendation methods in terms of the accuracy or recall rate of the recommendation algorithm. Among them, the accuracy rates of the top five, top ten, and top twenty recommended POIs are increased by 9.9%, 7.4%, and 7%, respectively, and the recall rate is increased by 4.2%, 7.5%, and 14.4%, respectively.

To overcome the low accuracy, poor reliability, and delay in the current drought prediction models, we propose a new extreme learning machine (ELM) based on an improved variational mode decomposition (VMD). The model first redefines the output of the hidden layer of the ELM model with orthogonal triangular matrix decomposition (QR) to construct an orthogonal triangular ELM (QR-ELM), and then introduces an online sequence learning mechanism (OS) into the QR-ELM to construct an online sequence OR-ELM (OS-QR-ELM), which effectively improves the efficiency of the ELM model. The mutual information extension method was then used to extend both ends of the original signal to improve the VMD end effect. Finally, VMD and OS-QR-ELM were combined to construct a drought prediction method based on the VMD-OS-QR-ELM. The reliability and accuracy of the VMD-OS-QR-ELM model were improved by 86.19% and 93.20%, respectively, compared with those of the support vector regression model combined with empirical mode decomposition. Furthermore, the calculation efficiency of the OS-QR-ELM model was increased by 88.65% and 85.32% compared with that of the ELM and QR-ELM models, respectively.

The oxidative condensation of benzidine has been carried out in acetic acid media using potassium peroxydisulfate as the oxidizing agent. Using different monomer–oxidant molar ratios, benzidine dimer, trimer, and polymer have been synthesized for the first time. It was established that the polybenzidine structure is composed from a sequence of benzidinediimine and diphenylene units with amino/amino end groups and thus proves the possibility of ammonia elimination during the oxidative polymerization of aromatic diamines. The method seems to be common for the synthesis of polymers with the sequence of aromatic diimine and arylene units. TGA analysis of the obtained trimer and polymer was investigated, and the high thermostability of both the polymer and trimer was revealed. According to the obtained data, both polymer and trimer matrix decomposition started at 300 °C, and at 600 °C, 75.94% and of 69.40% of the initial weight remained, correspondingly. Conductivities of the polymer and trimer show a semiconductor-type change from temperature and after doping show an increase in conductivity up to 10−4 Sm/cm.

Abstract The growth of serial remote sensing images (SRSI) offers abundant information for determining sequential spatial patterns in several fields like vegetation cover, urban development, and agricultural monitoring. Or else, traditional sequential pattern-mining algorithms cannot be applied efficiently or directly to remote sensing images. Here a new technique is proposed for enhancing the mining efficacy of spatial sequential patterns from raster serial remote sensing images (SRSI) based on pixel grouping approach. The modified extrema pattern is employed to offering grey-scale invariant transform of intensity values unlike previously employed local ternary pattern. The pattern features are computed by transformation process from which the multilinear matrix decomposition of the image is made by computing the covariance estimation on recognizing their orthogonal component. The matrix decomposition is then attained based on run length encoding process (RLC). The two rows of RLC vectors are intersected to attain pixel group matrix. Finally, the compressed image is attained in an efficient manner with effective mining time. The performance outcome reveals that the technique offered in this paper is capable of extracting spatial sequential patterns from SRSI effectively. The proposed system ensures that the entire patterns are extracted at a lower time consumption.

With the development of the Big Data sphere, as well as those fields of study that we can relate to artificial intelligence, the need for fast and efficient computing has become one of the most important tasks nowadays. That is why in the recent decade, graphics processing unit computations have been actively developing to provide an ability for scientists and developers to use thousands of cores GPUs have in order to perform intensive computations. The goal of this research is to implement orthogonal decomposition of a matrix by applying a series of Householder transformations in Java language using JCuda library to conduct a research on its benefits. Several related papers were examined. Malaschonok and Savchenko in their work have introduced an improved version of QR algorithm for this purpose [4] and achieved better results, however Householder algorithm is more promising for GPUs according to another team of researchers – Lahabar and Narayanan [6]. However, they were using Float numbers, while we are using Double, and apart from that we are working on a new BigDecimal type for CUDA. Apart from that, there is still no solution for handling huge matrices where errors in calculations might occur. The algorithm of orthogonal matrix decomposition, which is the first part of SVD algorithm, is researched and implemented in this work. The implementation of matrix bidiagonalization and calculation of orthogonal factors by the Hausholder method in the jCUDA environment on a graphics processor is presented, and the algorithm for the central processor for comparisons is also implemented. Research of the received results where we experimentally measured acceleration of calculations with the use of the graphic processor in comparison with the implementation on the central processor are carried out. We show a speedup up to 53 times compared to CPU implementation on a big matrix size, specifically 2048, and even better results when using more advanced GPUs. At the same time, we still experience bigger errors in calculations while using graphic processing units due to synchronization problems. We compared execution on different platforms (Windows 10 and Arch Linux) and discovered that they are almost the same, taking the computation speed into account. The results have shown that on GPU we can achieve better performance, however there are more implementation difficulties with this approach.

Abstract The growth of serial remote sensing images (SRSI) offers abundant information for determining sequential spatial patterns in several fields like vegetation cover, urban development, and agricultural monitoring. Or else, traditional sequential pattern-mining algorithms cannot be applied efficiently or directly to remote sensing images. Here a new technique is proposed for enhancing the mining efficacy of spatial sequential patterns from raster serial remote sensing images (SRSI) based on pixel grouping approach. The modified extrema pattern is employed to offering grey-scale invariant transform of intensity values unlike previously employed local ternary pattern. The pattern features are computed by transformation process from which the multilinear matrix decomposition of the image is made by computing the covariance estimation on recognizing their orthogonal component. The matrix decomposition is then attained based on run length encoding process (RLC). The two rows of RLC vectors are intersected to attain pixel group matrix. Finally, the compressed image is attained in an efficient manner with effective mining time. The performance outcome reveals that the technique offered in this paper is capable of extracting spatial sequential patterns from SRSI effectively. The proposed system ensures that the entire patterns are extracted at a lower time consumption.