Article

Annotating educational discussion boards to help students who are blind

Int. J. Continuing Engineering Education and Life-Long Learning 01/2007; 175(17):294-318.

ABSTRACT Educational discussion boards are growing in use as they help students share knowledge and doubts in a working/studying environment. Although these interactive tools are highly effective in learning environments, their usability by blind students is very poor. In this paper we develop techniques to improve accessibility of educational content for students who are blind. Threads of messages in discussion boards evolve with new postings, thus just by investigating the subject headings or contents of earlier postings in a message thread, students may not be able to guess the contents of the postings deeper in the hierarchy. In order to overcome the navigation obstacle for users, it is essential to develop techniques that help identify how the content of a discussion board grows. We develop a technique to organise messages in a message board, by automatically classifying and annotating postings to guide users through discussion segments relevant to their navigational goals. she is currently an Associate Professor. Her initial contributions to computer science were in the area of logic programming and artificial intelligence, specifically in the semantics of negation, and in the abductive extensions of logic programs.

0 0
 · 
0 Bookmarks
 · 
28 Views
  • Source
    Article: Clustering and indexing of experience sequences for popularity-driven recommendations
    [show abstract] [hide abstract]
    ABSTRACT: As part of our iCare efforts, we are developing mechanisms that provide guidance to individuals who are blind in diverse contexts. A fundamental challenge in this context is to rep-resent and index experiences that can be used to provide recommendations. In this paper, we address the challenge of indexing experiences in order to retrieve them based on their popularities. In particular, we model experiences as sequences of propositional statements from a particular do-main (daily life, web browsing, etc.). We then show that knowledge about domain constraints (such as commutativ-ity between possible statements) need to be used for clus-tering and indexing experiences for popularity-search. We also highlight that don't cares (propositional statements not relevant to the user's query) make the task of popu-larity indexing challenging. Thus, we develop a canonical-sequence based approach that significantly reduces the ex-perience sequence retrieval time in the presence of commu-tations. We introduce rule-compression, which helps achieve further reductions in the retrieval cost. We propose a novel two-level index structure, EXPdex, to efficiently answer wild-card (don't care) queries. We compare the proposed ap-proach analytically and experimentally to a don't care-unaware solution, which does not take into account wild-cards in queries while constructing the popularity index. Ex-periments show that the proposed approach provides large savings in retrieval time when commutations between the elements of sequences are allowed.

Full-text

View
0 Downloads
Available from

Keywords

annotating postings
 
artificial intelligence
 
computer science
 
discussion board
 
discussion boards evolve
 
discussion segments relevant
 
educational content
 
Educational discussion boards
 
environments
 
initial contributions
 
interactive tools
 
logic programs
 
message board
 
navigation obstacle
 
navigational goals
 
new postings
 
postings deeper
 
students share knowledge
 
subject headings
 
working/studying environment