메뉴 건너뛰기




Volumn 2973, Issue , 2004, Pages 381-392

Reducing communication cost in a privacy preserving distributed association rule mining

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; COST REDUCTION; COSTS; DATA MINING;

EID: 34547970705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24571-1_35     Document Type: Article
Times cited : (5)

References (14)
  • 1
    • 0033354342 scopus 로고    scopus 로고
    • Parallel and Distributed Association Mining: A Survey
    • October-December
    • M. J. Zaki, "Parallel and Distributed Association Mining: A Survey", IEEE Concurrency, October-December 1999.
    • (1999) IEEE Concurrency
    • Zaki, M.J.1
  • 4
    • 0242709355 scopus 로고    scopus 로고
    • Privacy Preserving Association Rule Mining in Vertically Partitioned Data
    • July
    • J. Vaidya and C. Clifton "Privacy Preserving Association Rule Mining in Vertically Partitioned Data", In Proc. of ACM SIGKDD, July 2002.
    • (2002) Proc. of ACM SIGKDD
    • Vaidya, J.1    Clifton, C.2
  • 5
    • 1142282764 scopus 로고    scopus 로고
    • Privacy Preserving Distributed Mining of Association Rules on Horizontal Partitioned Data
    • M. Kantercioglu and C. Clifton "Privacy Preserving Distributed Mining of Association Rules on Horizontal Partitioned Data", In Proc. of DMKD, 2002.
    • (2002) Proc. of DMKD
    • Kantercioglu, M.1    Clifton, C.2
  • 9
    • 0030379749 scopus 로고    scopus 로고
    • Efficient Mining of Association Rules in Distributed Databases
    • D. W. Cheung, V. T. Ng, A. W. Fu, and Y. Fu, "Efficient Mining of Association Rules in Distributed Databases", IEEE TKDE, 8(6) pages. 911-922, 1996.
    • (1996) IEEE TKDE , vol.8 , Issue.6 , pp. 911-922
    • Cheung, D.W.1    Ng, V.T.2    Fu, A.W.3    Fu, Y.4
  • 13
    • 0001880210 scopus 로고    scopus 로고
    • KDD-Cup 2000 organizers report: Peeling the onion
    • R. Kohavi.C. Broadley, B Frasca, L. Mason and Z. Zheng "KDD-Cup 2000 organizers report: Peeling the onion", SIGKDD Explorations, 2(2):86-98, 2000, http://www.ecn.purdue.edu/KDDCUP/
    • (2000) SIGKDD Explorations , vol.2 , Issue.2 , pp. 86-98
    • Kohavi, R.1    Broadley, C.2    Frasca, B.3    Mason, L.4    Zheng, Z.5
  • 14
    • 35048836437 scopus 로고    scopus 로고
    • Communication-Efficient Distributed Mining of Association Rules
    • Santa Barbara
    • A. Schuster and R. Wolff, "Communication-Efficient Distributed Mining of Association Rules", In Proc. ACM SIGMOD, Santa Barbara.
    • Proc. ACM SIGMOD
    • Schuster, A.1    Wolff, R.2


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