Finding Frequent Patterns Using Length-Decreasing Support Constraints

@article{Seno2005FindingFP,
  title={Finding Frequent Patterns Using Length-Decreasing Support Constraints},
  author={Masakazu Seno and George Karypis},
  journal={Data Mining and Knowledge Discovery},
  year={2005},
  volume={10},
  pages={197-228}
}
Finding prevalent patterns in large amount of data has been one of the major problems in the area of data mining. Particularly, the problem of finding frequent itemset or sequential patterns in very large databases has been studied extensively over the years, and a variety of algorithms have been developed for each problem. The key feature in most of these algorithms is that they use a constant support constraint to control the inherently exponential complexity of these two problems. In general… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS