:::

詳目顯示

回上一頁
題名:新的高效率之關聯規則探勘演算法
書刊名:樹德科技大學學報
作者:黃仁鵬 引用關係錢依佩
作者(外文):Huang, Jen-pengChien, I-pei
出版日期:2003
卷期:5:2
頁次:頁223-235
主題關鍵詞:資料探勘關聯規則高頻項目集拆解Data miningAssociation ruleFrequent itemsetDecomposition
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:1
期刊論文
1.Park, Jong-Soo、Chen, Ming-Syan、Yu, Philips S.(1997)。Using a hash-based method with transaction trimming for mining association rules。IEEE Transactions on Knowledge and Data Engineering,9(5),813-825。  new window
2.Chen, Ming-Syan、Han, Jiawei、Yu, Philip S.(1996)。Data Mining: An Overview from a Database Perspective。IEEE Transactions on Knowledge and Data Engineering,8(6),866-883。  new window
3.Quinlan, J. R.(1986)。Induction of Decision Trees。Machine Learning,1(1),81-106。  new window
會議論文
1.Agrawal, R.、Imielinski, T.、Swami, A.(1993)。Mining Association Rules Between Sets of Items in Large Databases。The ACM-SIGMOD international conference on management of data。Washington, DC。207-216。  new window
2.Agrawal, Rakesh、Srikant, Ramakrishnan(1995)。Mining Sequential Patterns。The 11th International Conference on Data Engineering。IEEE Computer Society Press。3-14。  new window
3.Ng, R.、Han, J.(1994)。Efficient and Effective Clustering Method for Spatial Data Mining。The 1994 International Conference on Very Large Data Bases。Santiago。144-155。  new window
4.Agrawal, Rakesh、Srikant, Ramakrishnan(1994)。Fast algorithms for mining association rules。The 20th International Conference on Very Large Data Bases,487-499。  new window
5.Kedem, Zvi M.、Lin, Dao-I(1998)。Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set。London:Springer-Verlag。105-119。  new window
圖書
1.Kaufman, Leonard、Rousseeuw, Peter J.(1990)。Finding Groups in Data: an Introduction to Cluster Analysis。John Wiley and Sons, Inc.。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE