Progressive Sampling Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - ". " to ". ")
m (Text replacement - ". "" to ". “")
 
Line 20: Line 20:


=== 1999 ===
=== 1999 ===
* ([[1999_EfficientProgressiveSampling|Provost et al., 1999]]) ⇒ [[Foster Provost]], [[David Jensen]], and Tim Oates. "[http://dx.doi.org/10.1145/312129.312188 Efficient Progressive Sampling].” In: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ([[KDD-1999]]).
* ([[1999_EfficientProgressiveSampling|Provost et al., 1999]]) ⇒ [[Foster Provost]], [[David Jensen]], and Tim Oates. [http://dx.doi.org/10.1145/312129.312188 Efficient Progressive Sampling].” In: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ([[KDD-1999]]).
** … [[We]] analyze [[Algorithm|methods]] for ''[[Progressive Sampling Algorithm|progressive sampling]]'' - using progressively larger [[samples]] as long as [[Induced Classification Model|model]] [[Classifier Performance|accuracy]] improves.
** … [[We]] analyze [[Algorithm|methods]] for ''[[Progressive Sampling Algorithm|progressive sampling]]'' - using progressively larger [[samples]] as long as [[Induced Classification Model|model]] [[Classifier Performance|accuracy]] improves.



Latest revision as of 07:01, 8 May 2024

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



References

2009

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