Hamm-grams are a new class of fixed-length regular expressions over bytes with single-character wildcards, mined efficiently with LSH and clustering to yield more robust features than n-grams for malware classification and detection.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hamm-Grams: An Algorithm for Mining Regular Expressions of Bytes
Hamm-grams are a new class of fixed-length regular expressions over bytes with single-character wildcards, mined efficiently with LSH and clustering to yield more robust features than n-grams for malware classification and detection.