Progressive Sampling Algorithm: Difference between revisions
m (Text replace - " (2009)" to " (2009)") |
m (Text replacement - ". "" to ". “") |
||
(28 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
A [[Progressive Sampling Algorithm]] is a [[Sampling Algorithm]] that is an [[Iterative Algorithm]]. | A [[Progressive Sampling Algorithm]] is a [[Sampling Algorithm]] that is an [[Iterative Algorithm]]. | ||
* <B | * <B>Context</U>:</B> | ||
** It can be used to create an [[Efficient Algorithm|efficient]] [[Supervised Learning Algorithm]]. | ** It can be used to create an [[Efficient Algorithm|efficient]] [[Supervised Learning Algorithm]]. | ||
** It can be used to create an [[Efficient Algorithm|efficient]] [[Feature Reduction Algorithm]]. | ** It can be used to create an [[Efficient Algorithm|efficient]] [[Feature Reduction Algorithm]]. | ||
* <B | * <B>See:</B> [[Feature Selection Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
===2009=== | == References == | ||
* ([[ | |||
=== 2009 === | |||
* ([[2009_ImprovingDataMiningUtilitywithP|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]]). [http://dx.doi.org/10.1145/1557019.1557076 doi:10.1145/1557019.1557076] | |||
===2003=== | === 2003 === | ||
* ([[2003_ColumnReductionDuringProgressiveSampling|Melli | * ([[2003_ColumnReductionDuringProgressiveSampling|Melli et al., 2003]]) ⇒ [[Gabor Melli]], Siavash Amirrezvani, Felix Chen, and Neil Russell. ([[2003]]). “[http://www.gabormelli.com/Publications/2003/2003_ColumnReductionDuringProgressiveSampling/2003_ColumnReductionDuringProgressiveSampling.pdf Column Reduction During Progressive Sampling].” In: Workshop on Data Mining for Actionable Knowledge (DMAK 2003). | ||
===2002=== | === 2002 === | ||
* S. Parthasarathy. (2002). | * S. Parthasarathy. ([[2002]]). “Efficient Progressive Sampling for Association Rules.” In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002). | ||
===1999=== | === 1999 === | ||
* ([[1999_EfficientProgressiveSampling|Provost | * ([[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. | ||
---- | ---- |
Latest revision as of 07:01, 8 May 2024
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).