15 September 2014 in IEEE Transactions on Cloud Computing
As mobile computing increasingly interacts with the cloud, a number of approaches, e.g., MAUI and CloneCloud, have been proposed, aiming to offload parts of the mobile application execution to the cloud. To achieve a good performance by using these approaches, they particularly focus on the application partitioning problem, i.e., to decide which parts of an application should be offloaded to the cloud and which parts should be executed on mobile devices such that the execution cost is minimized. Most works on this problem assume that the offloading cost of each part of the application remains the same as the application is running. Unfortunately, this assumption does not hold in dynamic mobile cloud environments, where the device and network connection status may fluctuate, and thus affects the offloading cost. With the varying offloading cost, the one time partitioning of the application may yield significant performance degradations. In this paper, we study application repartitioning problem which considers updating the partition periodically during the course of application execution. We first propose a framework for run time application repartitioning in dynamic mobile cloud environments. Based on this framework, we take the dynamic network connection to clouds as a case study, and design an online solution, Foreseer, to solve the mobile cloud application repartitioning problem. We evaluate our solution based on real world data traces that are collected in a campus WiFi hotspot testbed. The result shows that our method can achieve significantly shorter completion time over previous approaches.
27 December 2014 in International Journal of Machine Learning and Cybernetics
23 August 2024 in International Review of Economics & Finance
14 April 2023 in IEEE Transactions on Artificial Intelligence
Nonnegative matrix factorization (NMF) algorithms are a series of dimensional reduction techniques widely used in data preprocessing. To improve the performance of clustering and the discrimination of the low-dimensional representation in NMF, we proposed a novel semi-supervised constrained nonnegative matrix factorization based on label propagation (LpCNMF). Specifically, the proposed LpCNMF adopts graph and label propagation as regularization terms, then makes use of a small amount of labeled data to predict the label information of the unlabeled data and finally obtains a predictive membership matrix with more label information. At the same time, we introduce an efficient alternating iterative algorithm to solve the optimization problem of the objective function in the LpCNMF. Unlike other NMF algorithms that only update the basis and coefficient matrices, the LpCNMF algorithm increases the update of the predictive membership matrix obtained by label propagation. Experimental results on various benchmark datasets demonstrate the superiority of our algorithm over existing state-of-the-art NMF algorithms. The code is publicly available at https://github.com/ycwang-libra/LpCNMF_github.git.
23 February 2024 in Engineering Applications of Artificial Intelligence
13 January 2024 in ACM Transactions on Knowledge Discovery From Data
Since the weight of a self-attention model is not affected by the sequence interval, it can more accurately and completely describe the user interests, so it is widely used in processing sequential recommendation. However, the mainstream self-attention model focuses on the similarity between items when calculating the attention weight of user behavioral patterns but fails to reflect the impact of user sudden drift decisions on the model in time. In this article, we introduce a bias strategy in the self-attention module, referred to as Learning Self-Attention Bias (LSAB) to more accurately learn the fast-changing user behavioral patterns. The introduction of LSAB allows for the adjustment of bias resulting from self-attention weights, leading to enhanced prediction performance in sequential recommendation. In addition, this article designs four attention-weight bias types catering to diverse user behavior preferences. After testing on the benchmark datasets, each bias strategy in LSAB is useful for state-of-the-art and can improve the performance of the models by nearly 5% on average. The source code listing is publicly available at https://gitee.com/kyle-liao/lsab .