期刊文献+

专家分配问题的KMP优化求解方法研究 被引量:1

Research on KMP Optimization Algorithm for Expert Assignment Problem
下载PDF
导出
摘要 专家分配问题是项目申报系统中评审环节(盲审)重点解决的问题.根据系统模型,针对项目和专家的多因素匹配问题,对专家分配问题进行研究,建立了专家分配问题的模型.应用KM P方法和索引顺序查找的求解方法,提出了基于多信息因素的专家分配优化求解方法.通过测试与应用表明,该系统的专家分配算法能实现专家与申请书的匹配,结果有较高的准确性和合理性,该方法将评审工作的效率提高了8~12倍,同时将传统人工操作过程中的出错概率降至0.15%~0%. Expert assignment is a key problem in the assessment of project application system (blind trial) .According to the system model ,the issue of matching projects and experts was studied ,with the model of ,expert assignment established .Using KM P and indexes order ,an optimization algorithm for expert assignment based on multiple factors was proposed .Its testing and application shows that this algorithm can realize the match of experts and w ritten applications , with high accuracy and reasonability .T his method can improve the efficiency of the assessment by 8~12 times and reduce the error rate to 0 .15% ~0% .
出处 《西安工业大学学报》 CAS 2014年第5期355-359,共5页 Journal of Xi’an Technological University
基金 西安市科技计划项目(CXY-1257-4 CXY-1340-6 CXY1118(4)) 西安工业大学校长基金(XGXJJ-1018)
关键词 专家分配 KMP方法 索引顺序查找 多因素 优化求解方法 experts assignment knuth-morris-pratt string matching(KMP) indexes ordermultiple factor optimization algorithm
  • 相关文献

参考文献6

  • 1严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社.2010:192.
  • 2GLENN J. Brookshear[M].计算机科学概论.北京:人民邮电出版社,2011.
  • 3RICAROD A. Baeza-Yates. String Searching Algo- rithms Revisited[J]. Algorithms and Data Structures, 2012,8(3) :75.
  • 4DE G, SMITH V. A Comparison of Three String Matching Algorithms[J]. Software: Practice and Ex- perience, 2006,12 ( 1 ) : 57.
  • 5许家铭,李晓东,金键,马盈.一种高效的多模式字符串匹配算法[J].计算机工程,2014,40(3):315-320. 被引量:6
  • 6NELSON S A, ROGER J R, BARGAS, et al. Distrib- uted Work Flow Framework: US,US8635331BZ[P]. (2014-01-21)[2014-02-10].

二级参考文献13

  • 1Knuth D E, Morris J H, Pratt V R. Fast Pattern Matching in Strings[J]. SIAM Journal on Computing, 1977, 6(2): 323-350.
  • 2Boyer R S, Moore J S. A Fast String Searching Algorithm[J]. Communications of the ACM, 1977, 20(10): 762-772.
  • 3Horspool R N. Practical Fast Searching in Strings[J]. Software Practice & Experience, 1980, 10(6): 501-506.
  • 4Sunday D M. A Very Fast Substring Searching Algorithm[J]. Communications of the ACM, 1990, 33(8): 132-142.
  • 5Aho A V, Corasick M J. Efficient String Matching: An Aid to Bibliographic Search[J]. Communications of the ACM, 1975, 18(6): 333-340.
  • 6Walter B C. A String Matching Algorithm Fast on the Ave- rage[C]//Proc, of the 6th International Colloquium on Automata, Languages, and Programming. Graz, Austria: Is. rL], 1979.
  • 7Fan Jang-Jong, Su Keh-Yih. An Efficient Algorithm for Matching Multiple Patterns[J]. IEEE Transactions on Knowledge and Data Engineering, 1993, 5(2): 339-351.
  • 8Coit C J, Staniford S, McAlemey J. Towards Faster String Matching for Intrusion Detection or Exceeding the Speed of Snort[C]//Proc. of DARPA Information Survivability Conference. [S. 1.]: IEEE Press, 2001.
  • 9Lecroq T. Experimental Results on String Matching Algorithms[J]. Software Practice & Experience, 1995, 25(7): 727-765.
  • 10Lewis D. Reuters-21578 Text Categorization Collection[EB/OL] (1999-02-16). http://kdd.ics.uci.edu/databases/reuters21578/ reuters21578.html.

共引文献11

同被引文献3

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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