Frequent-Pattern Mining Algorithm

A Frequent-Pattern Mining Algorithm is a data mining algorithm that can be implemented into a frequent-pattern mining system (to solve a frequent-pattern mining task).

• Context:
  • It can range from being a Candidate Set Generation-and-Test Algorithm, to being ...
• Example(s):
  • an Association Rule Learning Algorithm, such as: Apriori Algorithm.
  • a Sequential Pattern Mining Algorithm, such as: SPADE Algorithm.
  • …
• Counter-Example(s):
  • a Clustering Algorithm.
  • a Supervised Learning Algorithm.
• See: Frequent Itemset Pattern, Frequent Pattern Candidate Set.

---

---

References

2007

• (Han et al., 2007) ⇒ Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. (2007). “Frequent Pattern Mining: current status and future directions.” In: Data Mining and Knowledge Discovery, 15(1). doi:10.1007/s10618-006-0059-1

2005

• (Yan et al., 2005) ⇒ Xifeng Yan, Hong Cheng, Jiawei Han, and Dong Xin. (2005). “Summarizing Itemset Patterns: a profile-based approach.” In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. doi:10.1145/1081870.1081907

2004

• (Han et al., 2004) ⇒ Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. (2004). “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.” In: Journal Data Mining and Knowledge Discovery, 8(1). doi:10.1023/B:DAMI.0000005258.31418.83
• (Goethals & Zaki, 2004) ⇒ Bart Goethals, and Mohammed Javeed Zaki. (2004). “Advances in Frequent Itemset Mining Implementations: report on FIMI'03.” In: ACM SIGKDD Explorations 6(1).

2000

• (Han et al., 2000) ⇒ Jiawei Han, Jian Pei, and Yiwen Yin. (2000). “Mining Frequent Patterns Without Candidate Generation.” In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of data. doi:10.1145/335191.335372

---