Automated Classification System for Blooms Cognitive Levels

SSRG International Journal of Computer Science and Engineering- (ICET’17) - Special Issue - March 2017
Automated Classification System for Blooms
Cognitive Levels
Ms.R.Mynavathi., Assistant Professor (Sl.Gr.)
Department of Information Technology
Velalar College of Engineering and Technology Thindal, Erode, India
S.Bhavatharini,
J.Gogula Nandhini
M.S.Kiran Kumar
Department of Information Technology
Velalar College of Engineering and Technology Thindal, Erode, India
Abstract—Bloom's Taxonomy is a method used for
classification of learning objectives within
educational institutions where educators use it for
assessing students. For evaluating student’s cognitive
level, cognitive domain is designed within Bloom’s
Taxonomy. There may be challenge in analyzing
whether the examination questions satisfy the
requirements of the Bloom’s taxonomy cognitive
levels. This paper discusses about automatic analysis
of the exam questions to determine the appropriate
taxonomy category. Here the rule-based approach
uses Support Vector Machine classification
techniques to identify the category of a question. Our
work focuses on the domain of Computer Networks
and Mobile Computing. Presently, a set of 500
questions is used both as training and test data.
Experimental results proves the successful
classification of questions based on blooms taxonomy
for the specified domain.
Keywords— Bloom’s taxonomy; Support Vector
Machine; rule-based
I. INTRODUCTION
Students learning methodology can be assessed
using different types of techniques. Common method
used for identifying student‟s knowledge level is
written examination. The student‟s overall cognitive
level for each semester is determined by questions in
the question paper. Questioning style described by
Swart (2010) is an issue to reach the desired learning
outcome. To make it effective, it is must in swart (
2010) to balance between lower and higher-level
questions. Bloom's Taxonomy with its cognitive
domain is a globally accepted guideline for designing
examination questions of different cognitive levels.
The hierarchical model is used for designing
questions in order to balance effectively. The
taxonomy as mentioned (scoot, 2003) improves
curricular assessment and design from the computer
network domain. Manual categorization of cognitive
level is commonly followed by academicians.
According to Yusof and Chai (2010), absolute
identification of cognitive level cannot be achieved
ISSN: 2348 – 8387
.This reduces the standardization of examination by
miscategorizing the exam questions. And also some
academicians are not aware of using Bloom's
taxonomy in assessing student ability (Johnson &
Fuller, 2006).
The aim of this paper is to propose a rule-based
approach in determining the Bloom‟s taxonomy
cognitive level of examination questions through
SVM classification. Exam questions will be analyzed
and each question will be categorized based on the
Bloom‟s taxonomy cognitive level. The scope of the
work is limited to Computer Networks and Mobile
Computing domain. This will assist the academicians
in setting up suitable exam questions according to the
requirements.
II. BACKGROUND STUDY
Blooms taxonomy classification to classify exam
questions was dealt by Swart, 2010 and Scott, 2003;
Thompson et al., 2008; Chang & Chung, 2009. A
system with natural language processing however has
not yet been in approach. An approach to classify
English questions based on the cognitive levels was
presented by Chang & Chung (2009). The method is
to accept the exam question as input that is then
segmented. Bloom's taxonomy verbs are stored in a
database. Verbs with both uppercase and lower case
letters are stored. The verbs are checked in all the
tenses. A match in the test item identified that the
particular question belongs to the keyword. For each
question, weightage is calculated. Four different
categories are dealt here: Perfect match, Partial
match, no match and no keyword match. This is
based on only the knowledge levels. Artificial neural
network model is also proposed by various
researchers to classify questions with different feature
method (Yusof & Chai, 2010). The model uses scaled
conjugate gradient learning algorithm. Feature set is
collected using data processing techniques and
content is framed into feature vector. In order to
perform text classification, three types of feature set
are used i.e. whole feature set, the Document
Frequency (DF) and Category Frequency-Document
www.internationaljournalssrg.org
Page 48
SSRG International Journal of Computer Science and Engineering- (ICET’17) - Special Issue - March 2017
Frequency (CF-DF). Question items consisting of 274
questions were selected for processing. From the
system, out of the three feature sets, DF reductions
gave more efficient result with the combination of
classification and convergence time. Cutrone &
Chang, 2010 proposed an auto marking system, a
learning management system, which is capable of
marking the levels once students submit their
answers. The answers are evaluated with meaning
using natural language processing. Semantic
processing is done through text pre-processing. The
product of pre-processing phase is the canonical
form. To find the level of similarity, the canonical
form is compared with the response from the
students. Accordingly, results are given. The
drawback is that the system could not analyse
multiple sentences based on the overall meaning.
Most of the works incorporate Bloom‟s taxonomy
but failed to provide classification based on the
meaning of the sentence. Chang and Chung (2009)
proposed a work which is based on keyword
matching while keywords are varied over researchers.
Categorization of the questions should consider the
nature of the question and how the questions can help
educators to identify the learner's cognitive level
III. COGNITIVE LEVELS – BLOOM‟S TAXONOMY
Bloom‟s Taxonomy domain was introduced by
Benjamin Bloom in 1950s. The domain was started
with the design of verifying the cognitive levels of
students in the written examination. Bloom‟s
taxonomy consists of six levels i.e. knowledge,
comprehension, application, analysis, synthesis and
evaluation (Bloom, 1956). The following describe
each levels of Bloom's Taxonomy.
A. Knowledge-Level
It refers to „rote learning‟ or „memorization‟. This
level is considered as the lower level or the beginning
level of the hierarchy. In this level, students
remember or memorize subject facts and recall the
same.
The questions of this category includes conditions
for recalling specific input from previous lessons,
defining or describing computing terms, methodology
and process, stating relevance description for a
subject area, concept or term and listing explicitly
information from questions (Scott, 2003).
Examples:



Define computer network.
Describe the key properties of OSI reference
model.
State the characteristics of MANET.
B. Comprehension-Level
Comprehension level is considered to the level of
grasping the meaning of information. The main
concepts include the ability to understand, translating,
extrapolating, categorizing, and describing the
information.
ISSN: 2348 – 8387
The questions for networking environment in this
category could be usage of a model, explaining the
processes involved in a architectural framework and
providing examples to illustrate a concept of a
network.
Examples:

Distinguish between wireless networks and
mobile computing?

Explain the layers of OSI reference model.
C. Application-Level
Application is defined by applying the concept to
a specific scenario (Starr et al., 2008). The questions
for in this category have the following criteria:
applying the concept to a new scenario and
modifying the framework for certain cases.
Examples:
 Demonstrate the destination unreachable
message of ICMP..

Modify a given network and compute the
shortest path.
D. Analysis-Level
In this level information is divided into many
simpler parts and each part is analysed. This may
include hypothesis, make a distinction or classify
the parts. According to Thompson et al. (2008),
programming questions can contain programming
algorithm categorised as classes, components or
methods; systematize elements to achieve objective;
recognize components of a development and
distinguish nonrelated components or needs. In
addition to that, it must elucidate what exactly
happens to memory when the codes are executed
line by line.
Examples:

Analyze the two types of connections
provided by FTP.

Illustrate flow control and error control
mechanisms
E. Synthesis-Level
In Synthesis-level, a student should be able to
integrate ideas and combine the concepts by
arranging the modules into a whole. Network
questions for this level may include comparative
study over different architectures. It may also
include creating new alternative methods to solve a
routing problem.
Examples:
 Compare and contrast MANET and
VANET.
www.internationaljournalssrg.org
Page 49
SSRG International Journal of Computer Science and Engineering- (ICET’17) - Special Issue - March 2017

Describe the key mechanism used in mobile
payment system.
F. Evaluation-Level
Evaluation level includes analysis and criticism.
Thompson et al. (2008) discuss this level in Bloom's
Taxonomy for CS Assessment. According to them,
programming question is interpreted by checking
codes if the code fits the requirement for testing
strategy. This level also includes commenting
quality of codes based on standards or execution
criteria.
Example:
 Justify the need for security in MANET.
Various studies on evaluation level present the
ambiguity problem (Chang & Chung, 2009).
Keywords in this level will also appear in other
levels as well (Jones et al., 2009). Nevertheless,
there are no exact standard verb keywords for each
level so far. As a result, some researchers took their
own initiative to provide related keywords (Chang
& Chung, 2009). Mastering lower levels is a
prerequisite before students are able to move to
more difficult levels (Ranganathan&Nygard, 2010;
Chang & Chung, 2009). However, it is not a good
practice to directly assume a specific cognitive level
for a question simply because a similar verb is
found (Thompson et al.,2008). Consider the
following question: “Write a program that simulates
DSRV routing algorithm.”.
The above question has a verb “Write” , we
might assume that a question can be matched with
the keyword Write because the word „Write‟
appears in it. „Write‟ can either be in Knowledge or
Synthesis. If we take a closer look at it, the question
requires us to formulate a program. Therefore, the
suitable cognitive level for the question is Synthesis.
A student with this level of learning should take
previously learned concepts and apply them together
to create something new (Scott, 2003
IV. PROPOSED METHODOLOGY
V. PRE-PROCESSING
Pre-processing is usually done to make the
structure and content of the text in a standard manner.
It will allow us to make the text more readable and
easy to use for later process. Text preprocessing
involves processes such as stopwords removal,
stemming, lemmatization and POS tagging. In this
work, stopwords removal is applied to the question in
order to make the text more readable for later process.
Following this, each word will then be tagged using a
tagger. To illustrate the tagging process, consider the
question “ Define Computer Networks.” The tagged
output is: Define/VB Computer/N Networks/N .
The tagger will help to identify important nouns
and verbs, which may be important in determining
the question‟s category. In addition, the sentence
pattern may assist in the correct identification of the
question‟s category. After tagging, some rules will be
applied according to question's structure.
VI. WEIGHTAGE ASSIGNMENT
A Weightage-based approach is adopted in
determining the category of an examination question
based on the Bloom‟s taxonomy. The weights are
assigned to the training set which consists of 500
examination questions.
The following algorithm illustrates the process of
stop word removal
Start
{
Input:questions.txt
fileToString( ) //to convert text file to string
removeDuplicatesOfQuest(
removeStopWords( )
}
Stop
Output: Questions without stopword.
Figure 1 shows the overall process in determining
the Bloom‟s taxonomy category of a given question.
In this work, a classification based approach is
adopted in classifying the question items into their
corresponding Bloom‟s cognitive level. The training
and test data set questions are a collection of
examination questions in Computer Networks and
Mobile Computing. The training model is developed
with 500 examination questions. The system will
classify each of questions automatically to their
corresponding verbs from the Taxonomy with the
assistance of the developed rules. In order to
determine the category of questions, this work
excluded difficulty level of each question as a
measuring factor.
ISSN: 2348 – 8387
www.internationaljournalssrg.org
Page 50
SSRG International Journal of Computer Science and Engineering- (ICET’17) - Special Issue - March 2017
References
Questions text
file
[1]
Stopwords
removal
[2]
[3]
POS
Tagging
[4]
[5]
Apply
rules
Assign
Weight
Databas
e
Outpu
t
[6]
[7]
Fig 1: Overall Process for categorization
Simply relying on a keyword found in the
question does not necessarily means that a correct
Bloom‟s taxonomy category or cognitive level can be
determined automatically. Based on the given
scenario, a question may fall into more than one
category. Thus, to overcome this problem, weights
are assigned to the conflicting categories. The weight
is calculated based on question's category from
subject matter experts (SMEs)
[8]
[9]
[10]
VII. CONCLUSION
Bloom's Taxonomy is a classification of learning
objectives within education that educators set for
students. We depicted a concept to automate the
process of categorizing examination question
according to Bloom's Taxonomy based on its
cognitive levels. The formation of rules may improve
the accuracy of the result. For future work, more rules
will be developed and tested to enhance the system‟s
effectiveness. Thus, further testing has been our main
interest in the near future.
[11]
[12]
[13]
[14]
ISSN: 2348 – 8387
Bird, S., Klein, E., &Loper, E. (2009). Natural Language
Processing with Python, O‟Reilly Media, Inc., 1005
Gravenstein Highway North, Sebastopol, CA 95472.USA.
Bloom, B.S. Taxonomy of Educational Objectives –
Handbook 1 Cognitive Domain, London. Longman. (1956).
Cutrone, L., & Chang, M. (2010). Automarking: Automatic
Assessment of Open Questions, 2010 10th IEEE
International Conference on Advance Learning Technologies.
143-147.
Johnson C.G. & U. Fuller. (2006). Is Bloom's Taxonomy is
Appropriate for Computer Science, Koli Calling 2006, Koli
National Park, Finland.
Jones, K. O., Harland, J., Reid, J. M.V., Barlett, R. (2009) .
Relationship Between Examination Questions and Bloom's
Taxonomy, 39th ASEE/IEEE Frontiers in Education
Conference. October 18-21, 2009. San Antonio, TX. W1G-1
– W1G-6.
Lister, R., &Leaney, J. (2003). Introductory Programming,
Criterion-referencing and bloom. SIGCSE '03: Proceeding of
the 34th SIGCSE Technical Symposium on Computer Science
Education, ACM Press. 143-147.
Oliver, D., Dobele, T., Greber, M., & Roberts, T. (2004).
This course has a Bloom rating of 3.9, Proceedings of the
sixth conference on Australasian computing education,
Australasian Computing Society Inc – Volume 30, Dunedin,
New Zealand, 227-231.
Ranganathan, P., &Nygard, K. A. (2010). Bloom's Online
Assessment Test (BOAT) to assess student learning outcome
in a distance engineering education course. 2010 2nd
International Conference on Computer Engineering and
Technology. 159-161.
Scott, T. (2003). Bloom‟s Taxonomy Applied to Testing in
Computer Science Classes. Consortium for Computing
Science in Colleges: Rocky Mountain Conference. (October
2003) 267-274.
Starr, C.W., Manaris, B., &Stalvey, R.H. (2008). Bloom‟s
Taxonomy Revisited: Specifying Assessable Learning
Objectives in Computer Science. SIGCSE ’08. Portland,
Oregon, USA. March 12-15, 261-265.
Swart, A.J. (2010). Evaluation of Final Examination Papers
in Engineering: A Case Study Using Bloom's Taxonomy,
IEEE Transactions on Education, (May 2010) Vol. 53, No.2
257-264.
Thompson, E., Luxton-Reilly, A., Whalley, J. L. Hu, M., P.
Robbins. (2008). Bloom's Taxonomy for CS Assessment.
Proceeding Tenth Australasian Computing Education
Conference (ACE 2008), Wollongong, Australia. 155-162.
Wen-Chih Chang, Ming-Shun Chung. (2009). Automatic
Applying Bloom‟s Taxonomy to Classify and Analysis the
Cognition Level of English Question Items. IEEE. 727-733.
Yusof, N., & Chai, J. H. (2010). Determination of Bloom's
Cognitive Level of Question Items using Artificial Neural
Network. 2010 10th International Conference on Intelligent
Systems Design and Applications. 866-870
www.internationaljournalssrg.org
Page 51