A semantic annotation model for indexing and retrieving learning objects

Smine, Boutheina; Faiz, Rim; Desclés, Jean-Pierre
August 2011
Journal of Digital Information Management;Aug2011, Vol. 9 Issue 4, p159
Academic Journal
The internet is an important part of our world. Offering a large and increasing amount of information, people can use it for learning, teaching, etc. Automatic tools for learning information retrieval based on semantic tags have not been effective yet. We propose here a model which aims at automatically annotating texts with semantic metadata. These metadata would allow us to index and extract learning objects from texts. This model is composed of two parts. While the first part consists of a semantic annotation of learning objects according to their categories (definition, example, exercise, etc.), the second one uses automatic semantic annotation. Generated by the first part, the latter aims at creating a semantic inverted index able to find relevant learning objects for queries. To sort the results according to their relevance, we apply the Rocchio's classification technique to the learning objects. We have implemented a system called SRIDoP, on the basis of the proposed model and we have verified its effectiveness.


Related Articles

  • Maintaining frequent closed itemsets over a sliding window. Cheng, James; Yiping Ke; Ng, Wilfred // Journal of Intelligent Information Systems;Dec2008, Vol. 31 Issue 3, p191 

    In this paper, we study the incremental update of Frequent Closed Itemsets ( FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to progressively increase the minimum support threshold for an itemset as it is retained longer in the window,...

  • Finite Automata Approach to Computing All Seeds of Strings with the Smallest Hamming Distance. Guth, Ondřej; Melichar, Bořivoj // IAENG International Journal of Computer Science;May2009, Vol. 36 Issue 2, p1 

    Seed is a type of a regularity of strings. A restricted approximate seed w of string T is a factor of T such that w covers a superstring of T under some distance rule. In this paper, the problem of all restricted seeds with the smallest Hamming distance is studied and a polynomial time and space...

  • An Efficient Explanation of Individual Classifications using Game Theory. Štrumbelj, Erik; Kononenko, Igor // Journal of Machine Learning Research;1/1/2010, Vol. 11 Issue 1, p1 

    We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and predictions are explained with contributions of individual feature values. We overcome the method's initial exponential time...

  • An improved incremental learning algorithm for text categorization using support vector machine. Cao Jianfang; Wang Hongbin // Journal of Chemical & Pharmaceutical Research;2014, Vol. 6 Issue 6, p210 

    Text categorization which assigns natural language texts to one or more predefined categories based on their content is an important component in many information organization and management tasks. Different automatic learning algorithms for text categorization have different classification...

  • Optimal Cascade Linguistic Attribute Hierarchies for Information Propagation. He, Hongmei; Lawry, Jonathan // IAENG International Journal of Computer Science;May2009, Vol. 36 Issue 2, p1 

    A hierarchical approach, in which a highdimensional model is decomposed into series of low-dimensional sub-models connected in cascade, has been shown to be an effective way to overcome the 'curse of dimensionality' problem. The upwards propagation of information through a cascade hierarchy of...

  • Temporal Logic To Query Semantic Graphs Using The Model Checking Method. Gueffaz, Mahdi; Rampacek, Sylvain; Nicolle, Christophe // Journal of Software (1796217X);Jul2012, Vol. 7 Issue 7, p1462 

    Semantic interoperability problems have found their solutions due to the use of languages and techniques from the Semantic Web. The proliferations of ontologies and meta-information have improved the understanding of information and the relevance of search engine responses. However, the...

  • Discernibility matrix simplification with new attribute dependency functions for incomplete information systems. Lang, Guangming; Li, Qingguo; Guo, Lankun // Knowledge & Information Systems;Dec2013, Vol. 37 Issue 3, p611 

    Recently, many researches have been done on attribute dependency degree models. In this work, we bring forward three attribute dependency functions for incomplete information systems and investigate their basic properties in detail. Afterward, we apply the proposed models to twelve data sets...

  • Government refines metadata initiative.  // Information World Review;Jun2001, Issue 170, p1 

    Deals with the metadata frameworks of the Cabinet Office of Great Britain which aim to improve the online information retrieval system of the government. E-Government Metadata Framework; Interoperability Framework version 2.

  • A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases. Loh, Woong-Kee; Kim, Sang-Wook; Whang, Kyu-Young // Data Mining & Knowledge Discovery;Jul2004, Vol. 9 Issue 1, p5 

    In this paper, an algorithm is proposed for subsequence matching that supports normalization transform in time-series databases. Normalization transform enables finding sequences with similar fluctuation patterns even though they are not close to each other before the normalization transform....


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics