:::

詳目顯示

回上一頁
題名:在資料串流的環境下探勘高效益項目集
書刊名:電子商務學報
作者:顏秀珍李御璽
作者(外文):Yen, Show-janeLee, Yue-shi
出版日期:2018
卷期:20:1
頁次:頁99-123
主題關鍵詞:資料探勘高效益項目集資料串流交易資料庫Data miningHigh utility itemsetData streamTransaction database
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:16
期刊論文
1.Ahmed, C. F.、Tanbeer, S. K.、Jeong, B. S.、Lee, Y. K.(2009)。Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases。IEEE Transactions on Knowledge and Data Engineering,21(12),1708-1721。  new window
2.Yen, S. J.、Chen, A. L. P.(2001)。A graph-based approach for discovering various types of association rules。IEEE Transactions on Knowledge and Data Engineering,13(5),839-845。  new window
3.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
4.Lin, C. W.、Lan, G. C.、Hong, T. P.(2015)。Mining high utility itemsets for transaction deletion in a dynamic database。Intelligent Data Analysis,19(1),43-55。  new window
5.Li, Y. C.、Yeh, J. S.、Chang, C. C.(2008)。Isolated items discarding strategy for discovering high utility Itemsets。Data and Knowledge Engineering,64(1),198-217。  new window
6.Ryang, H.、Yun, U.(2016)。High utility pattern mining over data streams with sliding window technique。Expert Systems with Applications,57,214-231。  new window
7.Tseng, V. S.、Shie, B. E.、Wu, C. W.、Yu, P. S.(2013)。Efficient algorithms for mining high utility itemsets from transactional databases。IEEE Transactions on Knowledge and Data Engineering,25(8),1772-1786。  new window
8.Yun, U.、Ryang, H.(2015)。Incremental high utility pattern mining with static and dynamic databases。Applied Intelligence,42(2),323-352。  new window
9.Yen, S. J.、Wang, C. K.、Ouyang, L. Y.(2012)。A search space reduced algorithm for mining frequent patterns。Journal of Information Science and Engineering,28(1),177-191。  new window
10.Zihayat, M.、An, A.(2014)。Mining top-k high utility patterns over data streams。Information Sciences,285,138-161。  new window
會議論文
1.Li, H. F.、Huang, H. Y.、Chen, Y. C.、Liu, Y. J.、Lee, S. Y.(2008)。Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams。The 8th IEEE International Conference on Data Mining。Washington, DC。881-886。  new window
2.Tseng, V. S.、Wu, C. W.、Shie, B. E.、Yu, P. S.(2010)。UP-Growth: An Efficient Algorithm for High Utility Itemset Mining。The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining。Washington, DC。  new window
3.Xu, Y.、Yu, J. X.、Liu, G.、Lu, H.(2002)。From path tree to frequent patterns: A framework for mining frequent patterns。The 2002 IEEE International Conference on Data Mining。Maebashi。514-521。  new window
4.Liu, Y.、Liao, W. K.、Choudhary, A.(2005)。A fast high utility itemsets mining algorithm。The 1st International Workshop on Utility-Based Data Mining。Chicago, IL。  new window
5.Tseng, V. S.、Chu, C. J.、Liang, T.(2006)。Efficient mining of temporal high utility itemsets from data streams。The Second International Workshop on Utility-Based Data Mining。Philadelphia, PA。  new window
6.Yen, S. J.、Lee, Y. S.、Wu, C. W.、Lin, C. L.(2009)。An efficient algorithm for maintaining frequent closed itemsets over data stream。The 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems。Tainan。  new window
7.Yen, S. J.、Chen, C. C.、Lee, Y. S.(2011)。A fast algorithm for mining high utility Itemsets。International Workshop on Behavior Informatics。Shenzhen。  new window
8.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
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
QR Code
QRCODE