Identifying Follow-Correlation Itemset-Pairs
Lists
Only you see this
Abstract
An association rule ArarrB is useful to predict that B will likely occur when A occurs. This is a classical association rule. In real world applications, such as bioinformatics and medical research, there are many follow correlations between itemsets A and B: B likely occurs n times after A occurred m times, wrote to <A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> , B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> >. We refer to this follow-correlation as P3.1 itemset-pairs because <A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> , B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> > like that in the example ( Example 2) should be uninterested in association analysis. This paper designs an efficient algorithm for identifying P3.1 itemset-pairs in sequential data. We experimentally evaluate our approach, and demonstrate that the proposed approach is efficient and promising.
BibTeX
@inproceedings{zhang2006identifying,
author = {Shichao Zhang and Jilian Zhang and Xiaofeng Zhu and Zifang Huang},
title = {{Identifying Follow-Correlation Itemset-Pairs}},
booktitle = {ICDM},
year = {2006},
doi = {10.1109/icdm.2006.84},
}Loading related content...