Hamm-Grams: An Algorithm for Mining Regular Expressions of Bytes

• URL: http://arxiv.org/abs/2607.01445v1
• Date: Wed, 01 Jul 2026 20:11:06 GMT
• Title: Hamm-Grams: An Algorithm for Mining Regular Expressions of Bytes
• Abstract summary: We propose an algorithm for constructing more robust features, hamm-grams, which are a special class of regular expressions having a fixed length and single-character wildcards.<n>We then demonstrate the advantages of these features in malware classification and detection tasks.
• Score: 42.599437516410994
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Malware poses a critical and ever-evolving threat, and robust and effective systems for detecting and classifying malware are of essential importance. $n$-grams features are among the common static features used in effective machine learning systems for malware, but these features are inherently brittle. We propose an algorithm for constructing more robust features, hamm-grams, which are a special class of regular expressions having a fixed length and single-character wildcards. We devise an efficient algorithm for finding common hamm-grams using a new locality-sensitive hash designed to produce collisions among pairs of small Hamming distance and a clustering within hash buckets to place wildcards. We then demonstrate the advantages of these features in malware classification and detection tasks.

Related papers

• Learning Attribute-Aware Hash Codes for Fine-Grained Image Retrieval via Query Optimization [25.4712230410618]
  We propose a novel method to harness learnable queries for attribute-aware hash codes learning.<n>This method deploys a tailored set of queries to capture and represent nuanced attribute-level information within the hashing process.<n>Building on this query-based optimization framework, we incorporate an auxiliary branch to help alleviate the challenges of complex landscape optimization.
  arXiv  Detail & Related papers  (2025-09-21T12:14:37Z)
• Zero-Shot Hashing Based on Reconstruction With Part Alignment [12.997382090145845]
  We propose a new zero-shot hashing method called RAZH.<n>We first use a clustering algorithm to group similar patches to image parts for attribute matching.<n>We then replace the image parts with the corresponding attribute vectors, gradually aligning each part with its nearest attribute.
  arXiv  Detail & Related papers  (2025-03-10T08:22:03Z)
• Attributes Grouping and Mining Hashing for Fine-Grained Image Retrieval [24.8065557159198]
  We propose an Attributes Grouping and Mining Hashing (AGMH) for fine-grained image retrieval. AGMH groups and embeds the category-specific visual attributes in multiple descriptors to generate a comprehensive feature representation. AGMH consistently yields the best performance against state-of-the-art methods on fine-grained benchmark datasets.
  arXiv  Detail & Related papers  (2023-11-10T14:01:56Z)
• SemStamp: A Semantic Watermark with Paraphrastic Robustness for Text Generation [72.10931780019297]
  Existing watermarking algorithms are vulnerable to paraphrase attacks because of their token-level design. We propose SemStamp, a robust sentence-level semantic watermarking algorithm based on locality-sensitive hashing (LSH) Experimental results show that our novel semantic watermark algorithm is not only more robust than the previous state-of-the-art method on both common and bigram paraphrase attacks, but also is better at preserving the quality of generation.
  arXiv  Detail & Related papers  (2023-10-06T03:33:42Z)
• Unified Functional Hashing in Automatic Machine Learning [58.77232199682271]
  We show that large efficiency gains can be obtained by employing a fast unified functional hash. Our hash is "functional" in that it identifies equivalent candidates even if they were represented or coded differently. We show dramatic improvements on multiple AutoML domains, including neural architecture search and algorithm discovery.
  arXiv  Detail & Related papers  (2023-02-10T18:50:37Z)
• Combining AI and AM - Improving Approximate Matching through Transformer Networks [12.466612431413711]
  Approximate matching (AM) is a concept in digital forensics to determine the similarity between digital artifacts. We propose an improved matching algorithm based on transformer models from the field of natural language processing.
  arXiv  Detail & Related papers  (2022-08-24T08:26:49Z)
• Representation Learning for Efficient and Effective Similarity Search and Recommendation [6.280255585012339]
  This thesis makes contributions to representation learning that improve effectiveness of hash codes through more expressive representations and a more effective similarity measure. The contributions are empirically validated on several tasks related to similarity search and recommendation.
  arXiv  Detail & Related papers  (2021-09-04T08:19:01Z)
• CIMON: Towards High-quality Hash Codes [63.37321228830102]
  We propose a new method named textbfComprehensive stextbfImilarity textbfMining and ctextbfOnsistency leartextbfNing (CIMON) First, we use global refinement and similarity statistical distribution to obtain reliable and smooth guidance. Second, both semantic and contrastive consistency learning are introduced to derive both disturb-invariant and discriminative hash codes.
  arXiv  Detail & Related papers  (2020-10-15T14:47:14Z)
• Rethinking Generative Zero-Shot Learning: An Ensemble Learning Perspective for Recognising Visual Patches [52.67723703088284]
  We propose a novel framework called multi-patch generative adversarial nets (MPGAN) MPGAN synthesises local patch features and labels unseen classes with a novel weighted voting strategy. MPGAN has significantly greater accuracy than state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-27T05:49:44Z)
• Reinforcing Short-Length Hashing [61.75883795807109]
  Existing methods have poor performance in retrieval using an extremely short-length hash code. In this study, we propose a novel reinforcing short-length hashing (RSLH) In this proposed RSLH, mutual reconstruction between the hash representation and semantic labels is performed to preserve the semantic information. Experiments on three large-scale image benchmarks demonstrate the superior performance of RSLH under various short-length hashing scenarios.
  arXiv  Detail & Related papers  (2020-04-24T02:23:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.