Greedy Stochastic Pattern Mining
From AGIRI.org
A class of algorithms that search for patterns in data.
The distinguishing feature of such algorithms is that they find simple patterns very fast. They generally can't find complex patterns at all, and don't even guarantee a complete search of the space of simple patterns.
A simple example would be a faster, stochastic variant of a Frequent Itemset Mining algorithm.
[edit]
Mind Ontology Links
Supercategory: Learning Algorithm
Supercategory: Concretely Implemented Novamente Structure
