최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기電子工學會論文誌. Journal of the Institute of Electronics Engineers of Korea. CI, 컴퓨터, v.45 no.3 = no.321, 2008년, pp.15 - 21
황원태 (중앙대학교 전자전기공학부) , 김동승 (고려대학교 전기전자전파공학부)
This paper presents a new association mining algorithm that uses two phase sampling for shortening the execution time at the cost of precision of the mining result. Previous FAST(Finding Association by Sampling Technique) algorithm has the weakness in that it only considered the frequent 1-itemsets ...
R. Agrawal and R. Srikant. "Fast algorithms for mining association rules". In Proc. VLDB Conf., 1994, pp.487-499
B. Chen, P. Haas, and P. Scheuermann, "A new two-phase sampling based algorithm for discovering association rules", SIGKDD, 2002
J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation", SIGMOD, 2000
M. Lee and D. Kim, "Modified association rule mining based on two-stage data sampling", Procs. KISS (Korea Information Systems Society) Conf. on Parallel Processing System, Vol. 16 No. 1, pp.69-74, Jan. 2005
G. Liu, H. Liu, Y. Xu, and J.X. Yu, "Ascending frequency ordered prefix-tree: efficient mining of frequent patterns", Procs. DASFAA 200
I. Pramudiono and M. Kitsuregawa, "Parallel FP-growth on PC cluster", In Proc. 7th Pacific Asia Conference on Knowledge Discovery and Data Mining, pp. 467-473, 2003
R. Toivonen, "Sampling large databases for association rules", In Proc. VLDB Conf., 1996
이문환 (M. Lee), Improved Association Rule Mining Based on FAST(Finding Associations from Sampled Transactions) Algorithm, master thesis, Korea University, July, 2004
※ AI-Helper는 부적절한 답변을 할 수 있습니다.