Interval-Valued data structures and their application to e-learning

  • Authors:
  • Adam Niewiadomski

  • Affiliations:
  • Institute of Computer Science, Technical University of Lodz, Lodz, Poland

  • Venue:
  • SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper is devoted to the problem of replacing crisp numbers with interval numbers in soft computations. The original concept of an interval-valued vector (IVV) is introduced, and the new extensions of classic similarity measures are proposed to handle IVV matching. Finally, the presented data structure and the matching methods are used in the process of an automated evaluation of tests in e-learning (distance learning within the Internet).