English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64180/96952 (66%)
造訪人次 : 11332751      線上人數 : 86
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/35016


    題名: 諮詢系統自我評量能力的建立與探討
    其他題名: Establish self-assessment consultant system by data mining approach
    作者: 曾伊禪;Tseng, Yi-chan
    貢獻者: 淡江大學資訊工程學系碩士在職專班
    蔣定安;Chiang, Ding-an
    關鍵詞: 決策樹;關聯式法則;決策分析;自我評量表;Decision Trees;Association rules;Decision analysis;Self-Assessment Table
    日期: 2007
    上傳時間: 2010-01-11 05:54:26 (UTC+8)
    摘要: 評量表是一種可以快速了解,我們輔導對象目前狀況的一個工具,而目前評量大部分均以固定型式問卷來表示,這樣評量表不但較為空洞泛味,而且也常常流於形式,而大大的降低評量表的功效為了要讓問卷可以更有效發揮功能,縮短問卷問答題數或者加強重要題目的比重是必要的,為了達到這個目的我們期望,可以透過資料採礦的技術與問卷結果的搜集,進而分析計算出一份問卷題型最佳組合,為了要計算出最佳組合,我們透過IM8(Intelligent Miner for Data 8.2)將資料以決策樹(Decision Trees)及關聯式分析
    (Association riles)分別做出相關分析,對於問卷我們先將問卷題目以分類向做一群比,更把整份問卷的回答過程模擬為樹的尋訪根據資料採礦的分析結果作為樹尋訪時,選擇節點的依據,如此一來便能以最佳路徑的演算法得一個最佳的組合。
    關鍵字:決策樹、關聯式法則、決策分析、自我評量表
    Assessment sheet is one kind of tools to quickly understand the present situations of the counseling object. Most assessment sheets are presented by the fixed questionnaire nowadays; however, it is a tedious and modal way. This would lower the efficiency of the assessment. In order to let the questionnaire have the most efficiency, it is necessary to decrease the number of questions or increase the proportion of the important questions. To achieve the target, we expect to use the technique of Data Mining and the collection of the poll results; then to analyze and obtain the optimized combination of assessment sheet. We finished the related analysis by using decision trees and association riles methods through IM8 (Intelligent Miner for Data 8.2). We first group the assessment sheets by the subjects and then simulated the filling procedure to be the searching base of tree. The analysis result of Data Mining is used to be the reference of selection nodes when searching the trees. Consequently, the optimized combination is obtained with the algorism of optimized path.
    顯示於類別:[資訊工程學系暨研究所] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    0KbUnknown281檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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