NBC-Softmax : Darkweb Author fingerprinting and migration tracking
Not on the map. Why?
Abstract (arXiv)
Metric learning aims to learn distances from the data, which enhances the performance of similarity-based algorithms. An author style detection task is a metric learning problem, where learning style features with small intra-class variations and larger inter-class differences is of great importance to achieve better performance. Recently, metric learning based on softmax loss has been used successfully for style detection. While softmax loss can produce separable representations, its discriminative power is relatively poor. In this work, we propose NBC-Softmax, a contrastive loss based clustering technique for softmax loss, which is more intuitive and able to achieve superior performance. Our technique meets the criterion for larger number of samples, thus achieving block contrastiveness, which is proven to outperform pair-wise losses. It uses mini-batch sampling effectively and is scalable. Experiments on 4 darkweb social forums, with NBCSAuthor that uses the proposed NBC-Softmax for author and sybil detection, shows that our negative block contrastive approach constantly outperforms state-of-the-art methods using the same network architecture. Our code is publicly available at : https://github.com/gayanku/NBC-Softmax
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 34 references that are in the map. First posted on arXiv 15 Dec 2022.
Builds on
23 of 34 references.
References · 23
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2020Supervised Contrastive Learningcited by 2,803
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2014Convolutional Neural Networks for Sentence Classificationcited by 1,124
- 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
- 2018Additive Margin Softmax for Face Verificationcited by 275
11 more
- 2020Supervised Contrastive Learning for Pre-trained Language Model Fine-tuningcited by 275
- 2018An efficient framework for learning sentence representationscited by 197
- 2021Recall@k Surrogate Loss with Large Batches and Similarity Mixupcited by 49
- 2019Learning Invariant Representations of Social Media Userscited by 21
- 2022SCGC : Self-Supervised Contrastive Graph Clusteringcited by 13
- 2022VeriDark: A Large-Scale Benchmark for Authorship Verification on the Dark Webcited by 10
- 2021FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mappingcited by 6
- 2013Content and popularity analysis of Tor hidden servicescited by 5
- 2019Collective Dynamics of Dark Web Marketplacescited by 4
- 2021SYSML: StYlometry with Structure and Multitask Learning: Implications for Darknet Forum Migrant Analysiscited by 4
- 2022Efficient block contrastive learning via parameter-free meta-node approximationcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.