Title

A Partition Based Method For Finding Highly Correlated Pairs

Keywords

Association rule, Pearson's correlation coefficients; Correlation; Data mining; Transactional database

Abstract

The problem of finding highly correlated pairs is to output all item pairs whose (Pearson) correlation coefficients are greater than a user-specified correlation threshold. Effective discovery of such item pairs is of primary importance in many real data mining applications. Algorithm and Taper algorithm are special cases of our new algorithm with respect to the number of segments. Experimental results on real datasets demonstrate the feasibility and superiority of our algorithm. Recently, the Taper algorithm is developed to discover the set of highly correlated item pairs. In this paper, we present a generalised Taper algorithm to find strongly correlated pairs between items by partitioning the collection of transactions into different segments, so as to achieve better pruning effect and less running time. Consequently, it can be proved that both are naïve. Copyright © 2010 Inderscience Enterprises Ltd.

Publication Date

1-1-2010

Publication Title

International Journal of Data Mining, Modelling and Management

Volume

2

Issue

4

Number of Pages

334-350

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1504/IJDMMM.2010.035562

Socpus ID

84863357782 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/84863357782

This document is currently not available here.

Share

COinS