IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v2y2010i4p334-350.html
   My bibliography  Save this article

A partition based method for finding highly correlated pairs

Author

Listed:
  • Shuxin Li
  • Sheau-Dong Lang

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 naive.

Suggested Citation

  • Shuxin Li & Sheau-Dong Lang, 2010. "A partition based method for finding highly correlated pairs," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 2(4), pages 334-350.
    • Handle: RePEc:ids:ijdmmm:v:2:y:2010:i:4:p:334-350
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=35562
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijdmmm:v:2:y:2010:i:4:p:334-350. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.