English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62796/95837 (66%)
造訪人次 : 3640346      線上人數 : 376
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/45504


    題名: Mining interval sequential patterns
    作者: Chiang, Rui-dong
    貢獻者: 淡江大學資訊工程學系
    日期: 2005-01-19
    上傳時間: 2010-03-26 19:26:03 (UTC+8)
    出版者: Wiley-Blackwell
    摘要: The main task of mining sequential patterns is to analyze the transaction database of a company in order to find out the priorities of items that most customers take when consuming. In this article, we propose a new method—the ISP Algorithm. With this method, we can find out not only the order of consumer items of each customer, but also offer the periodic interval of consumer items of each customer. Compared with other previous periodic association rules, the difference is that the period the algorithm provides is not the repeated purchases in a regular time, but the possible repurchases within a certain time frame. The algorithm utilizes the transaction time interval of individual customers and that of all the customers to find out when and who will buy goods, and what items of goods they will buy. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 359–373, 2005.
    關聯: International Journal of Intelligent Systems 20(3), p.359-373
    DOI: 10.1002/int.20070
    顯示於類別:[資訊工程學系暨研究所] 期刊論文

    文件中的檔案:

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

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

    TAIR相關文章

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