English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4028309      Online Users : 570
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
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/23062


    Title: 有效率的分散式關聯規則探勘系統
    Authors: 張昭憲;王星凱
    Contributors: 淡江大學資訊管理學系
    Keywords: 資料探勘;分散式系統;關聯規則;分散式探勘系統;Apriori演算法;Data Mining;Distributed System;Association Rule;Efficient Distributed Association Rules Mining System;Apriori Algorithm
    Date: 2003-07
    Issue Date: 2009-11-30 14:31:08 (UTC+8)
    Publisher: 資管學會; 中正大學
    Abstract: 本研究針對大型交易資料庫的關聯規則探勘,發展了一套有效率的分散式探勘系統-EDAMS (An efficient distributed association rules mining system)。由於分散式探勘的效能瓶頸通常發生在節點間探勘結果之整合,因此我們捨棄傳統點對點的資料交換方式,將特定節點改為資料伺服器(只負責資料整合與分發,不從事探勘工作),有效地將傳訊次數由O(n/sup 2/)大幅度縮減至O(n)。此外,本研究採用DHP做為基礎演算法,充分利用其在二階段項目集的良好縮減能力,進一步降低總體資料傳輸量。我們使用八部電腦針對十萬筆至七十萬筆的模擬交易資料進行分散探勘。實驗結果充分說明系統之有效性。
    Relation: 第十四屆國際資訊管理學術研討會:網際網路新世紀:組織、市場及社會之挑戰與機會論文集【Ⅱ】=Proceedings of The 14th International Conference on Information Management:The Net-Enabled Age : Challenges and Opportunities for Organizations, Markets, and Society【Ⅱ】,頁1152-1159
    Appears in Collections:[Graduate Institute & Department of Information Management] Proceeding

    Files in This Item:

    File SizeFormat
    有效率的分散式關聯規則探勘系統_中文摘要.docx14KbMicrosoft Word104View/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