메뉴 건너뛰기




Volumn , Issue , 2010, Pages 243-246

Balanced parallel FP-growth with mapreduce

Author keywords

Algorithms; Distributed computing

Indexed keywords

COMMUNICATION COST; DATA MINING TASKS; DATA SETS; DISTRIBUTED COMPUTING; EMPIRICAL STUDIES; FP-GROWTH ALGORITHM; FREQUENT ITEMSET MINING; GROUPING STRATEGIES; LOAD BALANCE; MAP-REDUCE; MINING ASSOCIATIONS; PARALLELIZATIONS; RESOURCE REQUIREMENTS;

EID: 79952746009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/YCICT.2010.5713090     Document Type: Conference Paper
Times cited : (108)

References (12)
  • 2
    • 0002221136 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Agrawal Rakesh, and Ramakrishman Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB, 1994.
    • (1994) VLDB
    • Rakesh, A.1    Srikant, R.2
  • 3
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In SIGMOD, 2000.
    • (2000) SIGMOD
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 4
    • 84855841483 scopus 로고    scopus 로고
    • Parallel FP-growth on PC cluster
    • Iko Pramudiono, and Masaru Kitsuregawa. Parallel FP-Growth on PC Cluster, In PAKDD, 2003.
    • (2003) PAKDD
    • Pramudiono, I.1    Kitsuregawa, M.2
  • 5
    • 85030321143 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • Jeffrey Dean, and Sanjay Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137-150, 2004.
    • (2004) OSDI , pp. 137-150
    • Dean, J.1    Ghemawat, S.2
  • 6
    • 79952761955 scopus 로고    scopus 로고
    • http://hadoop.apache.org
  • 7
    • 31844445285 scopus 로고    scopus 로고
    • Fast parallel association rule mining without candidacy generation
    • Osmar R. Zaïane, Mahammad El-Hajj, and Paul Lu. Fast Parallel Association Rule Mining without Candidacy Generation. In ICDM, 2001.
    • (2001) ICDM
    • Zaïane, O.R.1    El-Hajj, M.2    Lu, P.3
  • 8
    • 85011032633 scopus 로고    scopus 로고
    • Optimization of frequent itemset mining on multiple-core processor
    • Li Liu, Eric Li, Yimin Zhang, and Zhizhong Tang. Optimization of frequent itemset mining on multiple-core processor. In VLDB, 2007.
    • (2007) VLDB
    • Li, L.1    Li, E.2    Yimin, Z.3    Tang, Z.4
  • 9
    • 34047199045 scopus 로고    scopus 로고
    • Parallel leap: Large-scale maximal pattern mining in a distributed environment
    • Mohammad El-Hajj and Osmar R. Zaïane. Parallel Leap: Large-scale maximal pattern mining in a distributed environment. In ICPADS, 2006.
    • (2006) ICPADS
    • El-Hajj, M.1    Zaïane, O.R.2
  • 10
    • 34748916970 scopus 로고    scopus 로고
    • Toward terabyte pattern mining: An achitecture-conscious solution
    • Gregory Buehrer, Srinivasan Parthasarathy, Shirish Tatikonda, Tahsin Kurc, and Joel Saltz. Toward terabyte pattern mining: An achitecture-conscious solution. In PPOPP, 2007.
    • (2007) PPOPP
    • Buehrer, G.1    Parthasarathy, S.2    Tatikonda, S.3    Kurc, T.4    Saltz, J.5
  • 11
    • 79952760473 scopus 로고    scopus 로고
    • http://mahout.apache.org
  • 12
    • 79952758359 scopus 로고    scopus 로고
    • http://fimi.cs.helsinki.fi/data


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