20 November 2019 in IEEE Transactions on Sustainable Computing
Online education and e-learning have vigorously sprung up and produced massive educational data in a streaming way. It is very challenging to acquire the most appropriate learning resources and suitable learning partners from the streaming-updated educational big data. This paper aims to provide sustainable smart educational services including precise personalized recommendation and adaptive clustering under different contexts by correlatively analyzing the global educational data from multiple dimensions via incremental tensor decomposition. First, a tensor-based recommendation and service framework for the steaming educational big data is developed. Then three local tensors concerning learners, resources, and learning records are constructed and further fused to an integrated global learner-resource tensor. Afterward, we present an incremental tensor-based correlative analysis and personalized recommendation (ITCA-PR) algorithm to recommend appropriate resources under various contexts. Besides, we also propose an incremental tensor-based adaptive clustering and community recommendation (ITAC-CR) algorithm to recommend suitable learning partners under various contexts and accordingly construct adaptive learning communities. Extensive experimental results demonstrate that ITCA-PR algorithm outperforms state-of-the-art improved collaborative filtering algorithms by F-score measurement and ITAC-CR algorithm has a better clustering performance by DVI measurement. These precise educational services shall promote the development of sustainable smart education.
2 July 2019 in IEEE Transactions on Engineering Management
By leveraging neoteric analytical techniques associated with big data, numerous new data-focused computation and service models have flourished in service computing systems. Accurate future predictions based on tensor-based multivariate Markov models can vigorously support enterprise decisions. However, the computation efficiency and quick response of tensor-based multimodal prediction approach are seriously restricted by the curse of dimensionality arising from high-order tensor. Therefore, to alleviate the problem, this paper focuses on proposing a tensor-train (TT)-based computation approach with its scalable implementation for high-order dominant eigen decomposition (HODED) in multivariate Markov models. First, we present a TT-based Einstein product directly based on decomposed TT cores and guarantee that the result remains TT format. Then, we put forward a scalable implementation for TT-based Einstein product in a distributed or parallel manner. Afterwards, we propose a scalable TT-based HODED (TT-HODED) algorithm and a multimodal accurate prediction algorithm. Furthermore, a TT-based big data processing and services framework is presented to provide accurate proactive services. Experimental results based on real-world GPS trajectory dataset demonstrate that TT-HODED algorithm can significantly improve the computation efficiency and reduce the running memory on the premise of guaranteeing the almost consistent prediction accuracy compared to the original HODED algorithm.
20 January 2024 in Information Processing & Management
16 November 2022 in IEEE Transactions on Industrial Informatics
Combining data-driven approaches and physical laws for industrial trajectory prediction can improve the performance of industrial applications such as path planning of robots and route selection of vehicles in transportation systems. In the era of industrial Big Data, the application of industrial trajectory prediction based on the physical Markov process and tensor model has attracted much attention. To synchronously improve the prediction accuracy and computational efficiency, this article proposes a tensor-train (TT)-based multiuser multivariate multiorder (3M) physical Markov prediction approach for multimodal industrial trajectory pattern mining. First, we propose a TT-based unified product calculation rule with its scalable computation approach based on decomposed TT cores to speed up the execution efficiency. Then, a TT-based 3M (TT-3M) Markov transition approach is presented. Furthermore, we put forward a TT-based power method to calculate the stationary joint eigentensor (SJE) and an SJE-based multimodal prediction algorithm to mine concealed trajectory patterns. Experimental results based on real GPS trajectory dataset show that compared with the original tensor-based 3M approach, the TT-3M approach can improve the computational efficiency up to three times and reduce the storage space proportion to a minimum of 1‰ while ensuring basically consistent prediction accuracy.
29 September 2020 in IEEE Transactions on Network Science and Engineering
Accurate multi-modal predictions can vigorously support people's wise decisions. Predicting the future by leveraging eigentensor based multivariate Markov model or Z-eigenvector based multi-order Markov model has been flourished in recent years. However, there is no integrated solution by combining multivariate Markov model and multi-order Markov model with tensor-based calculation approach. Besides, the computation efficiency and quick response of tensor-based calculation approach are seriously restricted by the curse of dimensionality arising from higher-order tensor. Therefore, this paper focuses on proposing a scalable tensor train (TT) based higher order dominant Z-eigen decomposition (HODZED) for multivariate multi-order Markov models under cloud/edge computing environment to provide quick accurate predictions. First, we propose a multivariate multi-order Markov model and extend dominant Z-eigen decomposition to HODZED for calculating the dominant Z-eigentensor. Then, we propose two scalable TT-based HODZED (TT-HODZED) and improved TT-based HODZED (ITT-HODZED) algorithms to improve the computation efficiency. Afterwards, we present a multi-modal prediction algorithm based on the dominant Z-eigentensor. Experimental results based on random and real-world GPS trajectory datasets demonstrate that TT-HODZED and ITT-HODZED algorithms can significantly improve the computation efficiency and reduce the running memory on the premise of guaranteeing the almost consistent prediction accuracy compared to the original HODZED algorithm.