Bitwise Parallel Association Rule Mining for Web Page Recommendation

For many real-life web applications, web surfers would like to get recommendation on which collections of web pages that would be interested to them or that they should follow. In order to discover this information and make recommendation, data mining-and specially, association rule mining or web mining-is in demand. Since its introduction, association rule mining has drawn attention of many researchers. Consequently, many association rule mining algorithms have been proposed for finding interesting relationships-in the form of association rules-among frequently occurring patterns. These algorithms include level-wise Apriori-based algorithms, tree-based algorithms, hyperlinked array structure based algorithms, and vertical mining algorithms. While these algorithms are popular, they suffer from some drawbacks. Moreover, as we are living in the era of big data, high volumes of a wide variety of valuable data of different veracity collected at a high velocity post another challenges to data science and big data analytics. To deal with these big data while avoiding the drawbacks of existing algorithms, we present a bitwise parallel association rule mining system for web mining and recommendation in this paper. Evaluation results show the effectiveness and practicality of our parallel algorithm-which discovers popular pages on the web, which in turn gives the web surfers recommendation of web pages that might be interested to them-in real-life web applications.