In the mobile edge computing environments,Quality of Service(QoS)prediction plays a crucial role in web service recommendation.Because of distinct features of mobile edge computing,i.e.,the mobility of users and incom...In the mobile edge computing environments,Quality of Service(QoS)prediction plays a crucial role in web service recommendation.Because of distinct features of mobile edge computing,i.e.,the mobility of users and incomplete historical QoS data,traditional QoS prediction approaches may obtain less accurate results in the mobile edge computing environments.In this paper,we treat the historical QoS values at different time slots as a temporal sequence of QoS matrices.By incorporating the compressed matrices extracted from QoS matrices through truncated Singular Value Decomposition(SVD)with the classical ARIMA model,we extend the ARIMA model to predict multiple QoS values simultaneously and efficiently.Experimental results show that our proposed approach outperforms the other state-of-the-art approaches in accuracy and efficiency.展开更多
Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics...Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.展开更多
文摘In the mobile edge computing environments,Quality of Service(QoS)prediction plays a crucial role in web service recommendation.Because of distinct features of mobile edge computing,i.e.,the mobility of users and incomplete historical QoS data,traditional QoS prediction approaches may obtain less accurate results in the mobile edge computing environments.In this paper,we treat the historical QoS values at different time slots as a temporal sequence of QoS matrices.By incorporating the compressed matrices extracted from QoS matrices through truncated Singular Value Decomposition(SVD)with the classical ARIMA model,we extend the ARIMA model to predict multiple QoS values simultaneously and efficiently.Experimental results show that our proposed approach outperforms the other state-of-the-art approaches in accuracy and efficiency.
基金supported by Open Fund of Engineering Laboratory of Spatial Information Technology of Highway Geological Disaster Early Warning in Hunan Province(Changsha University of Science&Technology,kfj150602)Hunan Province Science and Technology Program Funded Projects,China(2015NK3035)+1 种基金the Land and Resources Department Scientific Research Project of Hunan Province,China(2013-27)the Education Department Scientific Research Project of Hunan Province,China(13C1011)
文摘Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.
