Article ID: | iaor200952635 |
Country: | United States |
Volume: | 20 |
Issue: | 4 |
Start Page Number: | 539 |
End Page Number: | 552 |
Publication Date: | Sep 2008 |
Journal: | INFORMS Journal On Computing |
Authors: | Xiong Hui, Zhou Wenjun, Brodie Mark, Ma Sheng |
Recently, there has been considerable interest in efficiently computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation threshold to perform the computation. However, it may be difficult for users to provide an appropriate threshold in practice because different data sets typically have different characteristics. To this end, in this paper, we propose an alternative task: finding the top–