Programming parallel apriori algorithms for mining association rules

Many parallel programming languages provide a set of low-level parallel constructs which lead to programs that are difficult to design, implement, debug, and maintain. In this paper, we present a parallel programming paradigm using a sequential programming language that encapsulates low-level details of distributed and concurrent programming techniques and makes the details transparent to programmers. This paradigm allows programmers to program on several different platforms in a sequential language that they are most familiar with. In addition, the paradigm provides high-level language constructs for programmers to implement various distributed and parallel algorithms. The programming paradigm is illustrated with two parallel Apriori algorithms in data mining.

[1]  Alan H. Karp,et al.  A comparison of 12 parallel FORTRAN dialects , 1988, IEEE Software.

[2]  Raghu V. Hudli,et al.  CORBA fundamentals and programming , 1996 .

[3]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[4]  Lise Storc Sequent Balance Series , 1987 .

[5]  John F. Roddick,et al.  Association mining , 2006, CSUR.

[6]  Chia-Chu Chiang,et al.  Distributed Association Mining on Message Passing Systems , 2010, International Symposium on Parallel and Distributed Processing with Applications.

[7]  Ashfaq Khokhar,et al.  Frequent Pattern Mining on Message Passing Multiprocessor Systems , 2004, Distributed and Parallel Databases.

[8]  Chia-Chu Chiang,et al.  A Parallel Apriori Algorithm for Frequent Itemsets Mining , 2006, Fourth International Conference on Software Engineering Research, Management and Applications (SERA'06).

[9]  M. Dunham,et al.  A SURVEY OF ASSOCIATION RULES , 2000 .

[10]  Chia-Chu Chiang,et al.  An Implementation of a Framework for Open Distributed Computing , 2009, ICA3PP.

[11]  C. C. Chiang,et al.  The use of adapters to support interoperability of components for reusability , 2003, Inf. Softw. Technol..