:::

詳目顯示

回上一頁
題名:挖掘關聯規則之階段搜尋演算法--GSA
書刊名:電子商務學報
作者:黃仁鵬 引用關係蔡季嵐
作者(外文):Huang, Jen-pengTsai, Chi-lan
出版日期:2007
卷期:9:4
頁次:頁823-845
主題關鍵詞:階段搜尋資料探勘關聯規則Gradational scanningData miningAssociation rule
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:1
  • 點閱點閱:31
期刊論文
1.Han, J.、Pei, J.、Yin, Y.、Mao, R.(2004)。Mining frequent patterns without candidate generation: a frequent pattern tree approach。Data Mining and Knowledge Discovery,8(1),53-87。  new window
2.Park, J. S.、Chen, M. S.、Yu, P. S.(1995)。An effective hash-based algorithm for mining association rules。Association for computing machinery special interest group on management of data,24(2),175-186。  new window
3.黃仁鵬、錢依佩、郭煌政(2006)。高效率之遞增式資料探勘演算法-ICI。電子商務學報,8(3),393-413。new window  延伸查詢new window
會議論文
1.Brin, S.、Motwani, R.、Ullman, J. D.、Tsur, S.(1997)。Dynamic Itemset Counting and Implication Rules for Market Basket Data。The 1997 ACM SIGMOD international conference on Management of data,255-264。  new window
2.Agrawal, R.、Srikant, R.(1994)。Fast algorithms for mining association rules in large database。The 20th International Conference on Very Large Data Bases。Morgan Kaufmann Publishers Inc.。478-499。  new window
3.Lin, D.、Kedem, Z. M.(1998)。Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set。0。105-119。  new window
4.Tseng, Fan-Chen、Hsu, Ching-Chi(2001)。Creating Frequent Patterns with the Frequent Pattern List。0。376-386。  new window
5.Lee, Chang-Hung、Lin, Cheng-Ru、陳銘憲(2001)。Sliding-window Filtering: An Efficient Algorithm for Incremental Mining。0。263-270。  new window
6.Liu, Junkiang、Pan, Yunhe、Wang, Ke、Han, Jiawei(2002)。Mining Frequent Item Sets by Opportunistic Projection。Edmonton。229-238。  new window
學位論文
1.熊浩志(2005)。快速資料探勘演算法與相關應用(碩士論文)。南台科技大學。  延伸查詢new window
2.黃南傑(2004)。高效率拆解之關聯規則探勘(碩士論文)。南台科技大學。  延伸查詢new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE