Gzip versus bag-of-words for text classification with KNN
- VLM
Abstract
The effectiveness of compression distance in KNN-based text classification ('gzip') has recently garnered lots of attention. In this note, we show that simpler means can also be effective, and compression may not be needed. Indeed, a 'bag-of-words' matching can achieve similar or better results, and is more efficient.
View on arXivComments on this paper
