Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold

@inproceedings{Amphawan2009MiningTP,
  title={Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold},
  author={Komate Amphawan and Philippe Lenca and Athasit Surarerks},
  booktitle={IAIT},
  year={2009}
}
Temporal periodicity of patterns can be regarded as an important criterion for measuring the interestingness of frequent patterns in several applications. A frequent pattern can be said periodic-frequent if it appears at a regular interval. In this paper, we introduce the problem of mining the top-k periodic frequent patterns i.e. the periodic patterns with the k highest support. An efficient single-pass algorithm using a best-first search strategy without support threshold, called MTKPP… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

Similar Papers

Loading similar papers…