Sciweavers

4 search results - page 1 / 1
» Exploiting a support-based upper bound of Pearson's correlat...
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
14 years 4 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
14 years 4 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
ICDM
2006
IEEE
95views Data Mining» more  ICDM 2006»
13 years 10 months ago
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
Hui Xiong, Mark Brodie, Sheng Ma
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 2 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong