메뉴 건너뛰기




Volumn 30, Issue 2, 2001, Pages 473-481

Communication-efficient distributed mining of association rules

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0038968611     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375728     Document Type: Article
Times cited : (35)

References (14)
  • 7
    • 0005378038 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Simon Fraser University, October
    • J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. Technical Report 99-12, Simon Fraser University, October 1999.
    • (1999) Technical Report 99-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 8
  • 14
    • 0005106905 scopus 로고    scopus 로고
    • Parallel data mining for association rules on shared-memory multi-processors
    • Pittsburg, PA, November
    • M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li. Parallel data mining for association rules on shared-memory multi-processors. In Proc. of Supercomputing96, pages 17-22, Pittsburg, PA, November 1996.
    • (1996) Proc. of Supercomputing96 , pp. 17-22
    • Zaki, M.J.1    Ogihara, M.2    Parthasarathy, S.3    Li, W.4


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