메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages

Tree partition based parallel frequent pattern mining on shared memory systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; HEURISTIC METHODS; TREES (MATHEMATICS);

EID: 33847155619     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639620     Document Type: Conference Paper
Times cited : (33)

References (11)
  • 4
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Han, Pei, and Yin. Mining frequent patterns without candidate generation. SIGMODREC: ACM SIGMOD Record, 29, 2000.
    • (2000) SIGMODREC: ACM SIGMOD Record , vol.29
    • Han, P.1    Yin2
  • 5
    • 35248817437 scopus 로고    scopus 로고
    • An efficient parallel and distributed algorithm for counting frequent sets
    • S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. An efficient parallel and distributed algorithm for counting frequent sets. In VECPAR, pages 421-435, 2002.
    • (2002) VECPAR , pp. 421-435
    • Orlando, S.1    Palmerini, P.2    Perego, R.3    Silvestri, F.4
  • 6
    • 0005204908 scopus 로고    scopus 로고
    • Mining of association rules in very large databases: A structured parallel approach
    • P. Becuzzi, M. Coppola, and M. Vanneschi. Mining of association rules in very large databases: A structured parallel approach. In Euro-Par, pages 1441-1450, 1999.
    • (1999) Euro-Par , pp. 1441-1450
    • Becuzzi, P.1    Coppola, M.2    Vanneschi, M.3
  • 7
    • 0030403779 scopus 로고    scopus 로고
    • Hash based parallel algorithms for mining association rules
    • T. Shintani and M. Kitsuregawa. Hash based parallel algorithms for mining association rules. In PDIS, pages 19-30, 1996.
    • (1996) PDIS , pp. 19-30
    • Shintani, T.1    Kitsuregawa, M.2
  • 8
    • 31844445285 scopus 로고    scopus 로고
    • Fast parallel association rule mining without candidacy generation
    • O. R. Zaïane, M. El-Hajj, and P. Lu. Fast parallel association rule mining without candidacy generation. In ICDM, pages 665-668, 2001.
    • (2001) ICDM , pp. 665-668
    • Zaïane, O.R.1    El-Hajj, M.2    Lu, P.3
  • 9
    • 31844455021 scopus 로고    scopus 로고
    • Tree structure based parallel frequent pattern mining on PC cluster
    • I. Pramudiono and M. Kitsuregawa. Tree structure based parallel frequent pattern mining on PC cluster. In DEXA, pages 537-547, 2003.
    • (2003) DEXA , pp. 537-547
    • Pramudiono, I.1    Kitsuregawa, M.2
  • 10
    • 17444402472 scopus 로고    scopus 로고
    • Shared memory parallelization of data mining algorithms: Techniques, programming interface, and performance
    • R. Jin, G. Yang, and G. Agrawal. Shared memory parallelization of data mining algorithms: Techniques, programming interface, and performance. IEEE Trans. Knowl. Data Eng, 17(1):71-89, 2005.
    • (2005) IEEE Trans. Knowl. Data Eng , vol.17 , Issue.1 , pp. 71-89
    • Jin, R.1    Yang, G.2    Agrawal, G.3


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