期刊文献+

基于结构相似匹配的SQL程序自动评估模型研究 被引量:3

A Study of the Automated Programming Assessment Model for SQL Based on Structure Similarity Matching
下载PDF
导出
摘要 针对SQL语言编程能力评估的多因素影响、界限模糊特性造成的难度和偏差问题,本文提出了基于结构相似度匹配的评估模型(SQL-APAM)。结合静态评估与动态评估方法,给出了模型的整体框架;模型对提交的SQL语句进行规范化、分词处理后,将其转换成等价的单词序列对,进而构建对应的结构树S-tree;使用于代价模型、子结构贡献因子两方面上有所改进的树编辑距离算法计算与目标树的相似性值;最后利用正态分布思想将相似度值映射到成绩区间,并通过相似度阈值来调整影响因素所带来的偏差,给出SQL程序的定量评判结果。最后对模型作了基于数据的实验分析与验证,训练数据集进行参数调整,对模型进行优化。 In view of the difficulty and the diviation caused by the features of multi-factor and fuzzy boundaries of the au- tomated programming assessment model for SQL languages(SQLAPAM), this paper introduces an assessment model based on structure similarity matching. The overall framework of the model is proposed with the combination of static and dynamic assessment methods. After being processed by standardization and tokenization, the submitted SQL statements are trans- formed into the equivalent sequence of token pairs with which the model constructs a corresponding structure tree(S^tree). Next the model calculates similarity between the acquired tree and the target tree using the tree edit distance improved in the cost model and the sub-structure contribution factor,and gains a similarity threshold. Finally, the model maps similarity to the score intervals with reference to the normal distribution theory and adjusts the deviation brought by the impact factors with the help of the similarity threshold. Meanwhile the final assessment result for the SQL program is provided.
出处 《计算机工程与科学》 CSCD 北大核心 2010年第11期92-96,共5页 Computer Engineering & Science
基金 江苏省高技术研究资助项目(BG2007028)
关键词 相似性分析 自动评估 分词 树编辑距离 正态分布 similarily analysis automated assessment tokenization tree edit distance normal distribution
  • 相关文献

参考文献10

  • 1Zamin N, et al. WAGS; A Web-Based Automated Grading System for Programming Assignments lrom Users' Perspectives[C]//Proc of Int' l Conf on Programming Classes Communication of Science & Technology, 2006.
  • 2Prechelt L, Gmalphol G,Philippsen M. Finding Plagiarisms Among a Set of Programs with Jplag[J]. Journal of Universal Computer Science, 2002, 8(11) : 1016-1038.
  • 3Khirulnizam A R,Md J N,Che W S B C W A,et al. Development of an Automated Assessment for C Programming Exercises Using Pseudoeodes Comparison Teehnique[C]//Proc of Conf on Information Technology Research and Applications, 2007.
  • 4Feng M Yu, Mcallister A. A Tool for Automated GUI Program Grading[C]//Proc of ASEE/IEEE Frontiers in Education Conf, 2006 : 7-12.
  • 5Heng P S, Joy M, Boyatt R,et al. Evaluation of the BOSS Online Submission and Assessment System [D]. United Kingdom: Department of Computer Science University of Warwick, 2005.
  • 6Roberts G H B,Verbyla J L M. An Online Programming Assessment Tool[C]//Proc of Australasian Computing Education Conference in Research and Practice in Information Technology, 2003.
  • 7Petrovskiy M. A Data Mining Approach to Learning Probabilistic User Behavior Models from Database Access Log[C]// Proc of Portuguese Conf on Artificial Intelligence, 2003.
  • 8Klein P N. Computing the Edit-Distance Between Unrooted Ordered Trees[C]//Proc of the Annual European Syrup on Algorithms, 1998 : 91-102.
  • 9何玲娟,刘连臣,吴澄.一种改进的基于WSDL描述的操作相似性度量方法[J].计算机学报,2008,31(8):1331-1339. 被引量:17
  • 10Balakrishna N , Lai C D. Bivariate Normal Distribution [M]. New York: Springer, 2009 : 477-56.

二级参考文献10

  • 1Zhang Kai-Zhong, Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 1989, 18(6): 1245-1262
  • 2Zhang Kai-Zhong, A constrained edit distance between unordered labeled trees. Algorithmica, 1996, 15(3):205-222
  • 3Shvaiko P, Euzenat J. A survey of schema-based matching approaches. Journal on Data Semantics IV, 2005, LNCS 3730:146-171
  • 4Do H H, Rahm E. COMA--A system for flexible combination of schema matching approaches//Proceedings of the 27th VLDB Conference. Roma, Italy, 2001:610-621
  • 5Madhavan J, Bernstein P, Rahm E, Generic schema matching with cupid//Proceedings of the 27th VLDB Conference, Roma, Italy, 2001,, 49-58
  • 6Xin Dong et al, Similarity search for Web services//Proceedings of the 30th VLDB Conference. Toronto, Canada, 2004: 372-383
  • 7Wang Yi-Qiao, Stroulia E. Flexible interface matching for Web-service discovery//Proceedings of the 4th International Conference on Web Information Systems Engineering. Roma, Italy, 2003:147-156
  • 8Hao Yanan, Zhang Yan-Chun. Web services discovery based on schema matching//Proceedings of the 30th Australasian conference on Computer Science 2007. Ballarat, Australia, 2007:107-113
  • 9Cardoso J. Discovering semantic web services with and without a common ontology commitment//Proceedings of the IEEE Services Computing Workshops 2006. Chicago, USA, 2006,, 183-190
  • 10Gunay A, Yolum P. Structural and semantic similarity metrics for Web service matchmaking. E-Commerce and Web Technologies, 2007, LNCS 4655: 129-138

共引文献16

同被引文献29

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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