2014
DOI: 10.2174/1874444301406010262
|View full text |Cite
|
Sign up to set email alerts
|

Similarity Measure of Test Questions Based on Ontology and VSM

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…The success results of the ontology-based relational product recommendation system were compared with the success results of an alternative approach using the Markov chain model. This model was chosen for comparison because it has been demonstrated in numerous studies [ 19 ] that it is successful in recommending products. The Markov chain model is a recommendation algorithm based on the similarity of user movements recorded in web server access logs.…”
Section: Resultsmentioning
confidence: 99%
“…The success results of the ontology-based relational product recommendation system were compared with the success results of an alternative approach using the Markov chain model. This model was chosen for comparison because it has been demonstrated in numerous studies [ 19 ] that it is successful in recommending products. The Markov chain model is a recommendation algorithm based on the similarity of user movements recorded in web server access logs.…”
Section: Resultsmentioning
confidence: 99%
“…2) To avoid information confusion semantic embedding representation, known information is removed, such as acceleration As shown in Table 1, we labeled the test questions with completely different knowledge points as '0' and those with partially identical knowledge points as '1'. For questions with identical knowledge points, we label them by cross-labeling, and for questions that are judged as duplicates by cross-labeling, we set their labeling range to be between (2,3), and finally the remaining questions with identical knowledge points but not judged as duplicates are labeled as '2'. Through this design, the semantic embedding can contain both the knowledge point information and the text information of the test questions, and also learn a similarity measure among the test questions.…”
Section: Dataset and Label Settingmentioning
confidence: 99%
“…In addition, existing information retrieval models are difficult to retrieve test questions with different text contents but similar semantics. For example, tang et al [1] used TF-IDF [2] vector representation combined with a K-nearest neighbor algorithm to calculate the similarity between test questions. Tsinakos et al propose using ovsm-TQSM [3] to improve the previous method by combining domain ontology and VSM to calculate the similarity between test question texts more accurately.…”
Section: Introductionmentioning
confidence: 99%
“…e goal of similar exercise recommendation is to use similar exercises to identify whether a learner has mastered a certain kind of exercises. Traditional recommendation of similar exercises is almost an unsupervised task [15,16,26], which is hard to check the accuracy. e HGKT provides a new perspective that we could nd the problem schema which is the most suitable to generalize a kind of similar exercises through the training of knowledge tracing.…”
Section: Student Diagnosismentioning
confidence: 99%