English  |  正體中文  |  简体中文  |  Items with full text/Total items : 55025/89277 (62%)
Visitors : 10606909      Online Users : 21
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    機構典藏 > Office of Physical Education > Proceeding >  Item 987654321/73624
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/73624

    Title: The best Learning Order Inference Based on Blue-Red Trees of Rule-Space Model for Social Network-Case in ITE Course
    Authors: 陳永輝;Chen, Yung-hui;鄧有光;Deng, Lawrence Y.;黃谷臣;Huang, Ku-chen
    Contributors: 淡江大學體育事務處
    Keywords: Rule-Space Model;Blue-Red tree;Relation weight;Confidence Leve;Learning Path
    Date: 2011-11-30
    Issue Date: 2011-12-21 09:00:56 (UTC+8)
    Publisher: Fukuoka Institute of Technology (FIT)
    Abstract: Network Learning is becoming increasingly popular today. It is getting important to develop adaptive learning by social network that can be applied in intelligent e-learning systems, and provide learners with efficient learning paths and learning orders for learning objects. Therefore, we use the Rule-Space Model to infer reasonable learning effects of Blue-Red trees and their definitions through analyzing all learning objects of courses within system. We can also define all part learning of sub-binary trees from a course and derive all learning paths from each part learning of sub-binary tree based on the premise that we had inferred nine learning groups of social network grouping algorithms. Most importantly, we can define the Relation Weight of every learning object associated with the other learning objects, and separately calculate the Confidence Level values of between two adjacent learning objects from all learning paths. And finally, we can find the optimal learning orders among all learning paths from a sub-binary tree in the case of ITE course.
    Relation: the 13-th International Symposium on Multimedia Network Systems and Applications (MNSA-2011) in conjunction with the Third IEEE International Conference on Intelligent Networking and Collaborative Systems (IEEE INCos 2011), Fukuoka, Japan, pp.466-471
    Appears in Collections:[Office of Physical Education] Proceeding

    Files in This Item:

    File Description SizeFormat
    C41_The best Learning Order Inference Based on Blue-Red Trees of Rule-Space Model for Social Network-Case in ITE Course.pdf1012KbAdobe PDF2View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback