Progressive Sampling Algorithm: Difference between revisions

Revision as of 21:52, 12 August 2014

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.

(Melli & 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).

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

(Provost & 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.

@@ Line 9: / Line 9: @@
 ===2009===
-* ([[2009_ImprovingDataMiningUtility|Last, 2009]]) &rArr; 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]]). [http://dx.doi.org/10.1145/1557019.1557076 doi:10.1145/1557019.1557076]
+* ([[2009_ImprovingDataMiningUtility|Last, 2009]]) &rArr; [[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]]). [http://dx.doi.org/10.1145/1557019.1557076 doi:10.1145/1557019.1557076]
 ===2003===