How Far Out of Distribution Can We Go With ELA Features and Still Be Able to Rank Algorithms?
Gasper PetelinGjorgjina CenikjPublished in: SSCI (2023)
Keyphrases
- computationally efficient
- worst case
- learning algorithm
- times faster
- false positives
- data structure
- theoretical analysis
- feature selection algorithms
- benchmark datasets
- co occurrence
- computational cost
- feature extraction
- image features
- low level
- feature vectors
- computational complexity
- orders of magnitude
- search engine
- machine learning