English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109948/140897 (78%)
Visitors : 46092210      Online Users : 1219
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/113990


    Title: 利用關聯法則支援數位學習自動化檢索系統之設計
    Authors: 劉豐榮
    施百俊
    朱建仁
    張博堯
    鄭義霖
    謝孟庭
    Keywords: 搜尋引擎;數位學習;關聯法則;協同過濾
    Search Engine;e-Learning;Association Rule;collaborative filtering;LDAP;JAXB
    Date: 2006
    Issue Date: 2017-10-23 14:56:54 (UTC+8)
    Abstract: 從1990年初的Archie、Gopher到現在的Google、Yahoo等,隨著網際網路的發展,搜尋引擎的技術也日新月異。近年來,資料探勘的技術被廣泛的應用在資訊產業上,例如:資料分群(data clustering)、決策樹學習(decision tree learning)和關聯法則(association rule)等。此外,線上數位學習也隨著網路技術逐漸成熟而更加蓬勃發展,若能在數位學習中應用資料探勘技術的話,必然能使學習效果事半功倍。本系統期望整合LDAP與JAXB來降低搜尋系統開發時,對文字剖析的複雜度,透過分析使用者的搜尋記錄過濾出課程關鍵字及挖掘資料間的關聯法則,並將不同平台的教材資訊整合在同一伺服器中,以期增進學生學習功效及讓教材內容更為豐富。
    Gopher tools at the beginning of 1990 to the present Google, Yahoo etc, along with the increasing development of Internet, the technologies of the search engine also change each passing day. In recent years, many searching engines have been implemented for the dedicated areas such as google image, medsite etc. But, it is still a big issue how to retrieve the valuable information to the individual from the explosive data refined by the searching engines. Thus, there are many techniques proposed for improving the searching results. Data mining is one of these proposed techniques. Currently, the technologies of data mining have been widely applied to the information-related industries, such as the data clustering, decision tree learning and association rule etc. In addition, e-learning gets more popular as well as the Internet technology becomes more mature. If adopting the concept of data mining to e-learning system, it will be good to make learning more efficient. Thus, we plan to utilize the techniques of LDAP and JAXB to reduce the load of development of search engine and the complexity of the learning contents parsing. Through analyzing the logs of users` searching behaviors, the keywords and the association among the learning materials for the users will be conducted or figured out. And then, we integrate with the related metadata of the learning materials in different platforms and maintain them in the dedicated server. We hope, with such the deployment, to achieve the goals of promoting the efficiency of studying and making the contents of the teaching materials more abundant.
    Relation: TANET 2006 台灣網際網路研討會論文集
    網際網路創意與應用
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    626.pdf118KbAdobe PDF2252View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback