An L-tree based analysis of E-lessons

被引:0
|
作者
Bahrami, Azita [1 ]
机构
[1] Armstrong Atlantic State Univ, Dept Informat Technol, Savannah, GA 31419 USA
关键词
E-learning; logical structure of E-lessons; logical structure redundancy; learner preparedness; and breaking points in E-lessons;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Logical structure of an e-lesson may be viewed from three different perspectives of Absolute, Teacher and Learner, which may be represented as A-tree, T-tree, and L-tree, respectively. Building an A-tree is extremely difficult, if not impossible. A T-tree can be built by a teacherfor a class. An L-tree can be built by a learner with guidance of a teacher. In this paper, the inherent properties of A and L trees are utilized to answer some crucial questions any e-lesson developer encounters. These questions are: (a) How are needed new modules for an e-lesson identified and used, (b) How are redundant modules in an e-lesson identified and discarded, (c) How and when should an e-lesson be broken into two or more e-lessons, and (d) How is the level ofpreparedness of two groups of learners for receiving a new e-lesson compared.
引用
收藏
页码:329 / 334
页数:6
相关论文
共 50 条
  • [1] Enhancing laboratory experience through e-lessons
    Gautam, Satyen
    Qin, Zhen
    Loh, Kai Chee
    EDUCATION FOR CHEMICAL ENGINEERS, 2016, 15 : 19 - 22
  • [2] L-Tree: A Local-Area-Learning-Based Tree Induction Algorithm for Image Classification
    Choi, Jaesung
    Song, Eungyeol
    Lee, Sangyoun
    SENSORS, 2018, 18 (01)
  • [3] Introducing Adaptivity to e-Lessons to Enhance Student Learning
    Komlenov, Zivana
    Budimac, Zoran
    Ivanovic, Mirjana
    7TH EUROPEAN CONFERENCE ON E-LEARNING, VOL 1, 2008, : 571 - 580
  • [4] A standalone software for real-time facial analysis in online conferences and e-lessons
    Churaev, Egor
    Savchenko, Andrey, V
    SOFTWARE IMPACTS, 2023, 16
  • [5] L-tree: A dynamic labeling structure for ordered XML data
    Chen, Y
    Mihaila, G
    Bordawekar, R
    Padmanabhan, S
    CURRENT TRENDS IN DATABASE TECHNOLOGY - EDBT 2004 WORKSHOPS, PROCEEDINGS, 2004, 3268 : 209 - 218
  • [6] An extremal problem on graphic sequences with a realization containing every l-tree on k vertices
    Zeng, De-Yan
    Yin, Jian-Hua
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 337 : 487 - 493
  • [7] L-Tree Match: A New Data Extraction Model and Algorithm for Huge Text Stream with Noises
    Xu-Bin Deng
    Yang-Yong Zhu
    Journal of Computer Science and Technology, 2005, 20 : 763 - 773
  • [8] L-tree match: A new data extraction model and algorithm for huge text stream with noises
    Deng, XB
    Zhu, YY
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (06) : 763 - 773
  • [9] The Analysis of Customer Churns in E-commerce based on Decision Tree
    Guo, Feng
    Qin, Hui-lin
    2015 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND APPLICATIONS (CSA), 2015, : 199 - 203
  • [10] Fault Tree Based Architectural Analysis for E-Business Systems
    Chu, Wang
    Feng, Yanli
    PROCEEDINGS OF INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND COMPUTATIONAL TECHNOLOGY (ISCSCT 2009), 2009, : 52 - 57