期刊文献+

基于核加权KNN和多目标优化的众包平台定价系统设计 被引量:2

Pricing System Design of Crowdsourcing Platform Based on Kernel Weighted KNN and Multi-objective Optimization
下载PDF
导出
摘要 随着科技的发展,众包模式越来越受到人们欢迎,而任务定价合理程度关乎众包平台的发展。因此,本文针对任务定价问题,结合数据挖掘和多目标优化理论,设计了基于核加权KNN和多目标优化的众包平台定价系统。首先,分析影响任务定价的相关指标,构建基于核加权KNN的接单判别模型,并利用PSO算法优化参数,增加模型预测精度与鲁棒性。其次,以任务完成率最大、任务总价最小为目标函数,构建多目标优化模型。通过贪心法得出每增加1%任务完成率所需要最少的加价额度,采用有序样品最优聚类,根据最优分割点确定最佳定价方案,保证众包平台能在最小的代价下得到最好的发展。最后,提供众包平台定价系统的设计建议与改进方向。 With development of science and technology,crowdsourcing mode is more and more popular,and reasonable degree of task pricing is related to development of crowdsourcing platform.Therefore,the article designs a crowdsourcing platform pricing system based on kernel weighted KNN and multi-objective optimization aiming at problems of task pricing,and combining data mining and multi-objective optimization theory.First of all,to analyze related indicators affecting task pricing,construct order discriminant model based on kernel weighted KNN,and optimize parameters with PSO algorithm to increase accuracy and robustness of the model.Secondly,to construct multi-objective optimization model with objective function of maximum task completion rate and minimum total task cost.With greedy method,to obtaine minimum price adding amount for 1%increase each of task completion rate,to determine the best pricing scheme according to optimal segmentation point,with ordinal samples optimal clustering to ensure the best development of crowdsourcing platform at the minimum cost.Finally,to provide design proposal and improvement direction of pricing system of crowdsourcing platform.
作者 彭云聪 任心晴 石浩森 PENG Yun-cong;REN Xin-qing;SHI Hao-sen(Nanjing University of Posts and Telecommunications,Nanjing,Jiangsu 210046)
机构地区 南京邮电大学
出处 《软件》 2018年第6期150-154,共5页 Software
关键词 众包平台任务定价 核加权KNN 多目标优化 有序样品最优聚类 Crowdsourcing platform ask pricing Kernel weighted KNN Multi-objective optimization Ordinal sample optimal clustering
  • 相关文献

参考文献6

二级参考文献165

  • 1苏金树,张博锋,徐昕.基于机器学习的文本分类技术研究进展[J].软件学报,2006,17(9):1848-1859. 被引量:378
  • 2Japkowicz N. Learning from imbalanced data sets: A comparison of various strategies, WS-00-05 [R]. Menlo Park, CA: AAAI Press, 2000
  • 3Chawla N V, Japkowicz N, Kotcz A. Editorial: Special issue on learning from imbalaneed data sets [J]. Sigkdd Explorations Newsletters, 2004, 6( 1 ) : 1-6
  • 4Weiss Gary M. Mining with rarity: A unifying frameworks [J]. SIGKDD Explorations Newsletters, 2004, 6(1): 7-19
  • 5Maloof M A. Learning when data sets are imbalanced and when costs are unequal and unknown [OL]. [2008-01-06]. http://www. site. uottawa. ca/-nat/workshop2003/workshop 2003. html
  • 6Chawla N V, Hall L O, Bowyer K W, et al. SMOTE: Synthetic minority oversampling technique [J]. Journal of Artificial Intelligence Research, 2002, 16 : 321-357
  • 7Jo Taeho, Japkowicz Nathalie. Class imbalances versus small disjunets [J]. SIGKDD Explorations Newsletters, 2004, 6 (1): 40-49
  • 8Batista E A P A, Prati R C, Monard M C. A study of the behavior of several methods for halaneing machine learning training data [J]. SIGKDD Explorations Newsletters, 2004, 6(1): 20-29
  • 9Guo Hongyu, Viktor Herna L. Learning from imbalanced data sets with boosting and data generation: The DataBoostIM approach [J]. SIGKDD Explorations Newsletters, 2004, 6(1): 30-39
  • 10Chawla N V, Lazarevic A, Hall L O, et al. Smoteboost: Improving prediction of the minority class in boosting [C] // Proc of the Seventh European Conf on Principles and Practice of Knowledge Discovery in Databases. Berlin: Springer, 2003:107-119

共引文献201

同被引文献14

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部