Loading…
EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION
Assessment through written examination is a traditional method but it is a universal test method practiced in most of the educational institutions today. This study proposed a new method to classify exam questions automatically according to the cognitive levels of Bloom's taxonomy by implementi...
Saved in:
Published in: | Journal of Theoretical and Applied Information Technology 2015-08, Vol.78 (3), p.447-447 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 447 |
container_issue | 3 |
container_start_page | 447 |
container_title | Journal of Theoretical and Applied Information Technology |
container_volume | 78 |
creator | Abduljabbar, Dhuha Abdulhadi Omar, Nazlia |
description | Assessment through written examination is a traditional method but it is a universal test method practiced in most of the educational institutions today. This study proposed a new method to classify exam questions automatically according to the cognitive levels of Bloom's taxonomy by implementing a combination strategy based on voting algorithm that combines three machine learning classifiers. In this work, several classifiers are taken into consideration. The classifiers are, Support Vector Machine (SVM), Nai've Bayes (NB), and k-Nearest Neighbour (k-NN) that are used to classify the question with or without feature selection methods, namely Chi-Square, Mutual Information and Odd Ratio. Then a combination algorithm is used to integrate the overall strength of the three classifiers (SVM, NB, and k-NN). The classification model achieves highest result through the combination strategy by applying Mutual Information, which proved to be promising and comparable to other similar models. These experiments aimed to efficiently integrate different feature selection methods and classification algorithms to synthesize a classification procedure more accurately. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1855394445</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4017410901</sourcerecordid><originalsourceid>FETCH-LOGICAL-p131t-292eeb93f9157b0fc0e0e2588fd7d165f9961c66b106c94ac1911cd747e842bd3</originalsourceid><addsrcrecordid>eNpdjk1Pg0AQhjloYq3-h0086IWEYb_YI8UtbgJsdKGpJ8LHkthgqaX8_1I1HjzNTPK8z7xXzgIC4C4GQW-c23HceR7ziaALx8ptmKLXQppc6cygKAmNUWsVhZcbrUIjn9FlSbROHw3Kw63OdPqOIh1nKlcbiRK5kQkqjMriv7h8m1U6Xans23PnXHdVP9r737l0irXMoxc30fH8KnEPgOHk-sK3tha4E0B57XWNZz3r0yDoWt4Co50QDBrGavBYI0jVgABoWk64DYhft3jpPP14D8fha7Ljqfz8GBvb99XeDtNYQkApFoQQOqMP_9DdMB33c7sSOBcCM8I4PgMXyVYV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1779936467</pqid></control><display><type>article</type><title>EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION</title><source>EZB Electronic Journals Library</source><creator>Abduljabbar, Dhuha Abdulhadi ; Omar, Nazlia</creator><creatorcontrib>Abduljabbar, Dhuha Abdulhadi ; Omar, Nazlia</creatorcontrib><description>Assessment through written examination is a traditional method but it is a universal test method practiced in most of the educational institutions today. This study proposed a new method to classify exam questions automatically according to the cognitive levels of Bloom's taxonomy by implementing a combination strategy based on voting algorithm that combines three machine learning classifiers. In this work, several classifiers are taken into consideration. The classifiers are, Support Vector Machine (SVM), Nai've Bayes (NB), and k-Nearest Neighbour (k-NN) that are used to classify the question with or without feature selection methods, namely Chi-Square, Mutual Information and Odd Ratio. Then a combination algorithm is used to integrate the overall strength of the three classifiers (SVM, NB, and k-NN). The classification model achieves highest result through the combination strategy by applying Mutual Information, which proved to be promising and comparable to other similar models. These experiments aimed to efficiently integrate different feature selection methods and classification algorithms to synthesize a classification procedure more accurately.</description><identifier>ISSN: 1817-3195</identifier><language>eng</language><publisher>Islamabad: Journal of Theoretical and Applied Information</publisher><subject>Algorithms ; Classification ; Classifiers ; Information technology ; Strategy ; Support vector machines ; Taxonomy ; Test procedures</subject><ispartof>Journal of Theoretical and Applied Information Technology, 2015-08, Vol.78 (3), p.447-447</ispartof><rights>Copyright Journal of Theoretical and Applied Information Aug 2015</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Abduljabbar, Dhuha Abdulhadi</creatorcontrib><creatorcontrib>Omar, Nazlia</creatorcontrib><title>EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION</title><title>Journal of Theoretical and Applied Information Technology</title><description>Assessment through written examination is a traditional method but it is a universal test method practiced in most of the educational institutions today. This study proposed a new method to classify exam questions automatically according to the cognitive levels of Bloom's taxonomy by implementing a combination strategy based on voting algorithm that combines three machine learning classifiers. In this work, several classifiers are taken into consideration. The classifiers are, Support Vector Machine (SVM), Nai've Bayes (NB), and k-Nearest Neighbour (k-NN) that are used to classify the question with or without feature selection methods, namely Chi-Square, Mutual Information and Odd Ratio. Then a combination algorithm is used to integrate the overall strength of the three classifiers (SVM, NB, and k-NN). The classification model achieves highest result through the combination strategy by applying Mutual Information, which proved to be promising and comparable to other similar models. These experiments aimed to efficiently integrate different feature selection methods and classification algorithms to synthesize a classification procedure more accurately.</description><subject>Algorithms</subject><subject>Classification</subject><subject>Classifiers</subject><subject>Information technology</subject><subject>Strategy</subject><subject>Support vector machines</subject><subject>Taxonomy</subject><subject>Test procedures</subject><issn>1817-3195</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNpdjk1Pg0AQhjloYq3-h0086IWEYb_YI8UtbgJsdKGpJ8LHkthgqaX8_1I1HjzNTPK8z7xXzgIC4C4GQW-c23HceR7ziaALx8ptmKLXQppc6cygKAmNUWsVhZcbrUIjn9FlSbROHw3Kw63OdPqOIh1nKlcbiRK5kQkqjMriv7h8m1U6Xans23PnXHdVP9r737l0irXMoxc30fH8KnEPgOHk-sK3tha4E0B57XWNZz3r0yDoWt4Co50QDBrGavBYI0jVgABoWk64DYhft3jpPP14D8fha7Ljqfz8GBvb99XeDtNYQkApFoQQOqMP_9DdMB33c7sSOBcCM8I4PgMXyVYV</recordid><startdate>20150801</startdate><enddate>20150801</enddate><creator>Abduljabbar, Dhuha Abdulhadi</creator><creator>Omar, Nazlia</creator><general>Journal of Theoretical and Applied Information</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150801</creationdate><title>EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION</title><author>Abduljabbar, Dhuha Abdulhadi ; Omar, Nazlia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p131t-292eeb93f9157b0fc0e0e2588fd7d165f9961c66b106c94ac1911cd747e842bd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Classification</topic><topic>Classifiers</topic><topic>Information technology</topic><topic>Strategy</topic><topic>Support vector machines</topic><topic>Taxonomy</topic><topic>Test procedures</topic><toplevel>online_resources</toplevel><creatorcontrib>Abduljabbar, Dhuha Abdulhadi</creatorcontrib><creatorcontrib>Omar, Nazlia</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of Theoretical and Applied Information Technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abduljabbar, Dhuha Abdulhadi</au><au>Omar, Nazlia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION</atitle><jtitle>Journal of Theoretical and Applied Information Technology</jtitle><date>2015-08-01</date><risdate>2015</risdate><volume>78</volume><issue>3</issue><spage>447</spage><epage>447</epage><pages>447-447</pages><issn>1817-3195</issn><abstract>Assessment through written examination is a traditional method but it is a universal test method practiced in most of the educational institutions today. This study proposed a new method to classify exam questions automatically according to the cognitive levels of Bloom's taxonomy by implementing a combination strategy based on voting algorithm that combines three machine learning classifiers. In this work, several classifiers are taken into consideration. The classifiers are, Support Vector Machine (SVM), Nai've Bayes (NB), and k-Nearest Neighbour (k-NN) that are used to classify the question with or without feature selection methods, namely Chi-Square, Mutual Information and Odd Ratio. Then a combination algorithm is used to integrate the overall strength of the three classifiers (SVM, NB, and k-NN). The classification model achieves highest result through the combination strategy by applying Mutual Information, which proved to be promising and comparable to other similar models. These experiments aimed to efficiently integrate different feature selection methods and classification algorithms to synthesize a classification procedure more accurately.</abstract><cop>Islamabad</cop><pub>Journal of Theoretical and Applied Information</pub><tpages>1</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1817-3195 |
ispartof | Journal of Theoretical and Applied Information Technology, 2015-08, Vol.78 (3), p.447-447 |
issn | 1817-3195 |
language | eng |
recordid | cdi_proquest_miscellaneous_1855394445 |
source | EZB Electronic Journals Library |
subjects | Algorithms Classification Classifiers Information technology Strategy Support vector machines Taxonomy Test procedures |
title | EXAM QUESTIONS CLASSIFICATION BASED ON BLOOM'S TAXONOMY COGNITIVE LEVEL USING CLASSIFIERS COMBINATION |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T09%3A28%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=EXAM%20QUESTIONS%20CLASSIFICATION%20BASED%20ON%20BLOOM'S%20TAXONOMY%20COGNITIVE%20LEVEL%20USING%20CLASSIFIERS%20COMBINATION&rft.jtitle=Journal%20of%20Theoretical%20and%20Applied%20Information%20Technology&rft.au=Abduljabbar,%20Dhuha%20Abdulhadi&rft.date=2015-08-01&rft.volume=78&rft.issue=3&rft.spage=447&rft.epage=447&rft.pages=447-447&rft.issn=1817-3195&rft_id=info:doi/&rft_dat=%3Cproquest%3E4017410901%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p131t-292eeb93f9157b0fc0e0e2588fd7d165f9961c66b106c94ac1911cd747e842bd3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1779936467&rft_id=info:pmid/&rfr_iscdi=true |