随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使...随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使用二进制值来表示用户是否访问一个兴趣点;2)基于矩阵分解的兴趣点推荐算法把签到频率数据和传统推荐系统中的评分数据等同看待,使用高斯分布模型建模用户的签到行为;3)忽视用户签到数据的隐式反馈属性.为解决以上问题,提出一个基于Ranking的泊松矩阵分解兴趣点推荐算法.首先,根据LBSN中用户的签到行为特点,利用泊松分布模型替代高斯分布模型建模用户在兴趣点上签到行为;然后采用BPR(Bayesian personalized ranking)标准优化泊松矩阵分解的损失函数,拟合用户在兴趣点对上的偏序关系;最后,利用包含地域影响力的正则化因子约束泊松矩阵分解的过程.在真实数据集上的实验结果表明:基于Ranking的泊松矩阵分解兴趣点推荐算法的性能优于传统的兴趣点推荐算法.展开更多
Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a...Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a sparse algorithm for adaptive pruning LSSVR algorithm based on global representative point ranking(GRPR-AP-LSSVR)is proposed.At first,the global representative point ranking(GRPR)algorithm is given,and relevant data analysis experiment is implemented which depicts the importance ranking of data points.Furthermore,the pruning strategy of removing two samples in the decremental learning procedure is designed to accelerate the training speed and ensure the sparsity.The removed data points are utilized to test the temporary learning model which ensures the regression accuracy.Finally,the proposed algorithm is verified on artificial datasets and UCI regression datasets,and experimental results indicate that,compared with several benchmark algorithms,the GRPR-AP-LSSVR algorithm has excellent sparsity and prediction speed without impairing the generalization performance.展开更多
In the traditional data envelopment analysis （DEA） structure, the efficiency score for one decision making unit （DMU） is calculated by measuring the distance of the evaluated DMU to the best practice frontier. Rec...In the traditional data envelopment analysis （DEA） structure, the efficiency score for one decision making unit （DMU） is calculated by measuring the distance of the evaluated DMU to the best practice frontier. Recent researches have provided the reasonability of considering the worst practice frontier as a supple- ment to the traditional DEA techniques. The existing researches take only one type of frontier into account, and they cannot com- pare the evaluated DMU with both the best and the worst perform- ing DMUs. A DEA-based procedure is developed to consider the best and the worst frontiers in the same scenario where the ratio of two distances （RDS） measure is proposed. The principal appli- cation of this approach is for ranking, and, as a complement tool, for performance evaluation. The proposed approach can be used in a wide range of applications such as the performance evaluation of employees and others. Finally, a bookstore data set is used to illustrate the proposed approach.展开更多
With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental qua...With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental quality and economic benefits is an important problem for the decision makers. The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria. A model for ranking the projects of municipal sewage treatment plants is proposed by using exports＇ information and the data of the real projects. And, the ranking result is given based on the PROMETHEE method. Furthermore, by means of the concept of the weight stability intervals （WSI）, the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed. The result shows that some criteria, such as “proportion of benefit to project cost”, will influence the ranking result of alternatives very strong while others not. The influence are not only from the value of criterion but also from the changing the weight of criterion. So, some criteria such as “proportion of benefit to project cost” are key critera for ranking the projects. Decision makers must be cautious to them.展开更多
Traditional DEA-based ranking techniques have some pitfalls such as ignoring the inherent differences among decision making units （DMUs）, or lacking a common weight-based ranking, etc. To overcome these obstacles, t...Traditional DEA-based ranking techniques have some pitfalls such as ignoring the inherent differences among decision making units （DMUs）, or lacking a common weight-based ranking, etc. To overcome these obstacles, the paper first examines the possible differences among all DMUs such as the technical efficiency difference, the preference structure difference and the within-group position difference. Based upon the above differences this paper induces an integrated ranking measurement which helps to give a fair and full ranking for all DMUs under evaluation. Following the three types of differences, this approach behaves greatly elaborately, accurately and reasonably. Finally, the results from the Olympics achievement evaluation approve the acceptability of this approach.展开更多
The group decision making problem with linguistic pref- erence relations is studied. The concept of additive consistent linguistic preference relation is defined, and then some properties of the additive consistent li...The group decision making problem with linguistic pref- erence relations is studied. The concept of additive consistent linguistic preference relation is defined, and then some properties of the additive consistent linguistic preference relation are studied. In order to rank the alternatives in the group decision making with the linguistic preference relations, the weighted average is first utilized to combine the group linguistic preference relations to one linguistic preference relation, and then the transformation function is proposed to transform the linguistic preference relation to the multiplicative preference relation, and thus the Saaty＇s eigenvec- tor method （EM） of multiplicative preference relation is utilized to rank the alternatives in group decision making with the linguistic preference relations. Finally, an illustrative numerical example is given to verify the proposed method. A comparative study to the linguistic ordered weighted averaging （LOWA） operator method is also demonstrated.展开更多
Destination prediction has attracted widespread attention because it can help vehicle-aid systems recommend related services in advance to improve user driving experience.However,the relevant research is mainly based ...Destination prediction has attracted widespread attention because it can help vehicle-aid systems recommend related services in advance to improve user driving experience.However,the relevant research is mainly based on driving trajectory of vehicles to predict the destinations,which is challenging to achieve the early destination prediction.To this end,we propose a model of early destination prediction,DP-BPR,to predict the destinations by users’travel time and locations.There are three challenges to accomplish the model:1)the extremely sparse historical data make it challenge to predict destinations directly from raw historical data;2)the destinations are related to not only departure points but also departure time so that both of them should be taken into consideration in prediction;3)how to learn destination preferences from historical data.To deal with these challenges,we map sparse high-dimensional data to a dense low-dimensional space through embedding learning using deep neural networks.We learn the embeddings not only for users but also for locations and time under the supervision of historical data,and then use Bayesian personalized ranking(BPR)to learn to rank destinations.Experimental results on the Zebra dataset show the effectiveness of DP-BPR.展开更多
Based on the characteristics of high-end products,crowd-sourcing user stories can be seen as an effective means of gathering requirements,involving a large user base and generating a substantial amount of unstructured...Based on the characteristics of high-end products,crowd-sourcing user stories can be seen as an effective means of gathering requirements,involving a large user base and generating a substantial amount of unstructured feedback.The key challenge lies in transforming abstract user needs into specific ones,requiring integration and analysis.Therefore,we propose a topic mining-based approach to categorize,summarize,and rank product requirements from user stories.Specifically,after determining the number of story categories based on py LDAvis,we initially classify“I want to”phrases within user stories.Subsequently,classic topic models are applied to each category to generate their names,defining each post-classification user story category as a requirement.Furthermore,a weighted ranking function is devised to calculate the importance of each requirement.Finally,we validate the effectiveness and feasibility of the proposed method using 2966 crowd-sourced user stories related to smart home systems.展开更多
文摘随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使用二进制值来表示用户是否访问一个兴趣点;2)基于矩阵分解的兴趣点推荐算法把签到频率数据和传统推荐系统中的评分数据等同看待,使用高斯分布模型建模用户的签到行为;3)忽视用户签到数据的隐式反馈属性.为解决以上问题,提出一个基于Ranking的泊松矩阵分解兴趣点推荐算法.首先,根据LBSN中用户的签到行为特点,利用泊松分布模型替代高斯分布模型建模用户在兴趣点上签到行为;然后采用BPR(Bayesian personalized ranking)标准优化泊松矩阵分解的损失函数,拟合用户在兴趣点对上的偏序关系;最后,利用包含地域影响力的正则化因子约束泊松矩阵分解的过程.在真实数据集上的实验结果表明:基于Ranking的泊松矩阵分解兴趣点推荐算法的性能优于传统的兴趣点推荐算法.
基金supported by the Science and Technology on Space Intelligent Control Laboratory for National Defense(KGJZDSYS-2018-08)。
文摘Least square support vector regression(LSSVR)is a method for function approximation,whose solutions are typically non-sparse,which limits its application especially in some occasions of fast prediction.In this paper,a sparse algorithm for adaptive pruning LSSVR algorithm based on global representative point ranking(GRPR-AP-LSSVR)is proposed.At first,the global representative point ranking(GRPR)algorithm is given,and relevant data analysis experiment is implemented which depicts the importance ranking of data points.Furthermore,the pruning strategy of removing two samples in the decremental learning procedure is designed to accelerate the training speed and ensure the sparsity.The removed data points are utilized to test the temporary learning model which ensures the regression accuracy.Finally,the proposed algorithm is verified on artificial datasets and UCI regression datasets,and experimental results indicate that,compared with several benchmark algorithms,the GRPR-AP-LSSVR algorithm has excellent sparsity and prediction speed without impairing the generalization performance.
基金supported by the National Natural Science Foundation of China(7112106171271195+2 种基金71322101)the National Social Science Fund of China(13CTQ042)the USTC Foundation for Innovative Research Team(WK2040160008)
文摘In the traditional data envelopment analysis （DEA） structure, the efficiency score for one decision making unit （DMU） is calculated by measuring the distance of the evaluated DMU to the best practice frontier. Recent researches have provided the reasonability of considering the worst practice frontier as a supple- ment to the traditional DEA techniques. The existing researches take only one type of frontier into account, and they cannot com- pare the evaluated DMU with both the best and the worst perform- ing DMUs. A DEA-based procedure is developed to consider the best and the worst frontiers in the same scenario where the ratio of two distances （RDS） measure is proposed. The principal appli- cation of this approach is for ranking, and, as a complement tool, for performance evaluation. The proposed approach can be used in a wide range of applications such as the performance evaluation of employees and others. Finally, a bookstore data set is used to illustrate the proposed approach.
基金Shanghai Leading Academic Discipline Project (T0502)Shanghai Municipal Educational Commission Project (05EZ32).
文摘With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental quality and economic benefits is an important problem for the decision makers. The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria. A model for ranking the projects of municipal sewage treatment plants is proposed by using exports＇ information and the data of the real projects. And, the ranking result is given based on the PROMETHEE method. Furthermore, by means of the concept of the weight stability intervals （WSI）, the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed. The result shows that some criteria, such as “proportion of benefit to project cost”, will influence the ranking result of alternatives very strong while others not. The influence are not only from the value of criterion but also from the changing the weight of criterion. So, some criteria such as “proportion of benefit to project cost” are key critera for ranking the projects. Decision makers must be cautious to them.
基金supported partly by the National Natural Science Fundation of China for Innovative Research Groups(T0821001)the National Natural Science Fundation of China(70801056)University of Science and Technology of China Science Funds for Young Scholars.
文摘Traditional DEA-based ranking techniques have some pitfalls such as ignoring the inherent differences among decision making units （DMUs）, or lacking a common weight-based ranking, etc. To overcome these obstacles, the paper first examines the possible differences among all DMUs such as the technical efficiency difference, the preference structure difference and the within-group position difference. Based upon the above differences this paper induces an integrated ranking measurement which helps to give a fair and full ranking for all DMUs under evaluation. Following the three types of differences, this approach behaves greatly elaborately, accurately and reasonably. Finally, the results from the Olympics achievement evaluation approve the acceptability of this approach.
基金supported by the National Natural Science Foundation of China(70771025)Hohai University Central University Special Fund Basic Scientific Research and Operational Costs
文摘The group decision making problem with linguistic pref- erence relations is studied. The concept of additive consistent linguistic preference relation is defined, and then some properties of the additive consistent linguistic preference relation are studied. In order to rank the alternatives in the group decision making with the linguistic preference relations, the weighted average is first utilized to combine the group linguistic preference relations to one linguistic preference relation, and then the transformation function is proposed to transform the linguistic preference relation to the multiplicative preference relation, and thus the Saaty＇s eigenvec- tor method （EM） of multiplicative preference relation is utilized to rank the alternatives in group decision making with the linguistic preference relations. Finally, an illustrative numerical example is given to verify the proposed method. A comparative study to the linguistic ordered weighted averaging （LOWA） operator method is also demonstrated.
基金Project(2018YFF0214706)supported by the National Key Research and Development Program of ChinaProject(cstc2020jcyj-msxmX0690)supported by the Natural Science Foundation of Chongqing,China+1 种基金Project(2020CDJ-LHZZ-039)supported by the Fundamental Research Funds for the Central Universities of Chongqing,ChinaProject(cstc2019jscx-fxydX0012)supported by the Key Research Program of Chongqing Technology Innovation and Application Development,China。
文摘Destination prediction has attracted widespread attention because it can help vehicle-aid systems recommend related services in advance to improve user driving experience.However,the relevant research is mainly based on driving trajectory of vehicles to predict the destinations,which is challenging to achieve the early destination prediction.To this end,we propose a model of early destination prediction,DP-BPR,to predict the destinations by users’travel time and locations.There are three challenges to accomplish the model:1)the extremely sparse historical data make it challenge to predict destinations directly from raw historical data;2)the destinations are related to not only departure points but also departure time so that both of them should be taken into consideration in prediction;3)how to learn destination preferences from historical data.To deal with these challenges,we map sparse high-dimensional data to a dense low-dimensional space through embedding learning using deep neural networks.We learn the embeddings not only for users but also for locations and time under the supervision of historical data,and then use Bayesian personalized ranking(BPR)to learn to rank destinations.Experimental results on the Zebra dataset show the effectiveness of DP-BPR.
基金supported by the National Natural Science Foundation of China(71690233,71901214)。
文摘Based on the characteristics of high-end products,crowd-sourcing user stories can be seen as an effective means of gathering requirements,involving a large user base and generating a substantial amount of unstructured feedback.The key challenge lies in transforming abstract user needs into specific ones,requiring integration and analysis.Therefore,we propose a topic mining-based approach to categorize,summarize,and rank product requirements from user stories.Specifically,after determining the number of story categories based on py LDAvis,we initially classify“I want to”phrases within user stories.Subsequently,classic topic models are applied to each category to generate their names,defining each post-classification user story category as a requirement.Furthermore,a weighted ranking function is devised to calculate the importance of each requirement.Finally,we validate the effectiveness and feasibility of the proposed method using 2966 crowd-sourced user stories related to smart home systems.
