Priority-Coefficient Feature Fusion and Explainable Character-BiLSTM for Multi-Class Malicious URL Detection
Algorithmic analysis shows that inference complexity is linear in URL length and quadratic in the BiLSTM hidden size, making X-URL suitable for high-throughput web filtering when combined with caching and slow-path enrichment, making X-URL suitable for high-throughput web filtering when combined with caching and slow-p...