메뉴 건너뛰기




Volumn , Issue , 2008, Pages 165-170

A new parallel algorithm for the frequent itemset mining problem

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

EID: 60349092051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2008.45     Document Type: Conference Paper
Times cited : (5)

References (9)
  • 3
    • 0035747563 scopus 로고    scopus 로고
    • A. Das A., W.K. Ng and Y.K. Woon. Rapid association rule mining. Proceedings of the tenth international conference on Information and knowledge management, ACM Press, 2001, pp. 474-481.
    • A. Das A., W.K. Ng and Y.K. Woon. Rapid association rule mining. Proceedings of the tenth international conference on Information and knowledge management, ACM Press, 2001, pp. 474-481.
  • 5
    • 85198672043 scopus 로고    scopus 로고
    • J.S. Park, M.S. Chen and PS. Yu. An effective hash based algorithm for mining association rules. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, M. J. Carey and D. A. Schneider, Eds. San Jose, California, 1995, pp. 175-186.
    • J.S. Park, M.S. Chen and PS. Yu. An effective hash based algorithm for mining association rules. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, M. J. Carey and D. A. Schneider, Eds. San Jose, California, 1995, pp. 175-186.
  • 9
    • 60349087830 scopus 로고    scopus 로고
    • Parallel and Distributed Data Mining: A Survey
    • M.J. Zaki. Parallel and Distributed Data Mining: A Survey. IEEE Concurrency Journal, 7 (4): 14-25.
    • IEEE Concurrency Journal , vol.7 , Issue.4 , pp. 14-25
    • Zaki, M.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.