Progressive Sampling Algorithm

A Progressive Sampling Algorithm is a Sampling Algorithm that is an Iterative Algorithm.

• Context:
  • It can be used to create an efficient Supervised Learning Algorithm.
  • It can be used to create an efficient Feature Reduction Algorithm.
• See: Feature Selection Algorithm.

---

---

References

2009

• (Last, 2009) ⇒ Mark Last. (2009). “Improving Data Mining Utility with Projective Sampling.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557076

2003

• (Melli et al., 2003) ⇒ Gabor Melli, Siavash Amirrezvani, Felix Chen, and Neil Russell. (2003). “Column Reduction During Progressive Sampling.” In: Workshop on Data Mining for Actionable Knowledge (DMAK 2003).

2002

• S. Parthasarathy. (2002). “Efficient Progressive Sampling for Association Rules.” In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002).

1999

• (Provost et al., 1999) ⇒ Foster Provost, David Jensen, and Tim Oates. “Efficient Progressive Sampling.” In: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1999).
  • … We analyze methods for progressive sampling - using progressively larger samples as long as model accuracy improves.

---