On Pattern-Based Programming towards the Discovery of Frequent Patterns.pdfVIP

Abstract—The problem of frequent pattern discovery is defined as the process of searching for patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns has become an important data mining task because it reveals associations, correlations, and many other interesting relationships hidden in a database. Most of the proposed frequent pattern mining algorithms have been implemented with imperative programming languages. Such paradigm is inefficient when set of patterns is large and the frequent pattern is long. We suggest a high-level declarative style of programming apply to the problem of frequent pattern discovery. We consider two languages: Haskell and Prolog. Our intuitive idea is that the problem of finding frequent patterns should be efficiently and concisely implemented via a declarative paradigm since pattern matching is a fundamental feature supported by most functional languages and Prolog. Our frequent pattern mining implementation using the Haskell and Prolog languages confirms our hypothesis about conciseness of the program. The comparative performance studies on line-of-code, speed and memory usage of declarative versus imperative programming have been reported in the paper. Keywords—Frequent pattern mining, functional programming, pattern matching, logic programming. I. INTRODUCTION HE problem of frequent pattern discovery is an important problem in various fields such as data mining, business intelligence, pattern mining. Frequent pattern discovery refers to an attempt to find regularities or common relationships frequently occurred in a database. A set of market basket transactions [1], [2] is a common database used in frequent pattern analysis. A database is in a table format (as shown in Fig. 1). Each row is a transaction, identified by a transaction identifier TID. A transaction contains a set I of items bought by a customer. Manuscript received October 15, 200