Effective Structure Matching Algorithm for Automatic Assessment of Use-Case Diagram

The demand for higher education keeps on increasing. The invention of information technology and e-learning have, to a large extent, solved the problem of shortage of skilled and qualified teachers. But there is no guarantee that this will ensure the high quality of learning. In spite of large numbe...

Full description

Saved in:
Bibliographic Details
Published in:International journal of distance education technologies 2020-10, Vol.18 (4), p.31-50
Main Authors: Vachharajani, Vinay, Pareek, Jyoti
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Computational linguistics
Computer Assisted Testing
Educational Quality
Educational Technology
Evaluation Methods
Graphs
Higher Education
Instructional Materials
Language processing
Matching
Mathematics
Natural language interfaces
Online education
Students
Technology application
Technology Uses in Education
Undergraduate Students
Visual Aids
Web sites
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The demand for higher education keeps on increasing. The invention of information technology and e-learning have, to a large extent, solved the problem of shortage of skilled and qualified teachers. But there is no guarantee that this will ensure the high quality of learning. In spite of large number of students, though the delivery of learning materials and tests to the students have become very easy by uploading the same on the web, assessment could be tedious. There is a need to develop tools and technologies for fully automated assessment. In this paper, an innovative algorithm has been proposed for matching structures of two use-case diagrams drawn by a student and an expert respectively for automatic assessment of the same. Zhang and Shasha's tree edit distance algorithm has been extended for assessing use-case diagrams. Results from 445 students' answers based on 14 different scenarios are analyzed to evaluate the performance of the proposed algorithm. No comparable study has been reported by any other diagram assessing algorithms in the research literature.
ISSN:1539-3100
1539-3119
DOI:10.4018/IJDET.2020100103