Set Membership Test Classifier
Jump to navigation
Jump to search
A Set Membership Test Classifier is a test classifier set function that can solve an existence test task (on a set data structure).
- AKA: Set Includes Tester.
- Context:
- It can range from being a Deterministic Set Membership Test Classifier to being a Probabilistic Set Membership Test Classifier (such as a Bloom filter).
- Example(s):
- a Hash Lookup Function.
- …
- Counter-Example(s):
- See: Bloom Filter, If Exists, Bit Array.
References
2013
- http://en.wikipedia.org/wiki/Set_data_structure#Static_sets
- Typical operations that may be provided by a static set structure S are:
is_element_of(x,S)
: checks whether the value x is in the set S.
- Typical operations that may be provided by a static set structure S are:
2004
- http://www.perl.com/pub/2004/04/08/bloom_filters.html
- Anyone who has used Perl for any length of time is familiar with the lookup hash, a handy idiom for doing existence tests: