Software vulnerabilities are discovered quite frequently and cause substantial damage and security breaches. In the realm of cybersecurity, the detection of vulnerabilities plays a pivotal role in safeguarding critical systems and data. In this paper, we evaluate the efficacy of the source code embeddings obtained from the pre-trained CodeBERT model in detecting vulnerable code snippets and perform a comparative analysis with different data pre-processing and ML classification algorithms to recommend the best techniques for vulnerability detection. Precisely, we investigated the predictive ability of 540 different models developed using the CodeBERT embeddings, five feature selection techniques, a class balancing technique, and fifteen classification algorithms. Unlike regular deep learning-based models, these models are quick to implement and require minimal computational resources. The models are evaluated on robustness in detecting codes with known and previously unseen vulnerabilities. The developed models display high average accuracy and AUC, proving the efficiency of the CodeBERT embeddings in capturing vulnerabilities. We find that ensembles of decision trees (RF and EXTR) perform the best for vulnerability detection, which can be attributed to the advantages of ensembling. Furthermore, the effectiveness of class balancing and feature selection techniques as data pre-processing techniques is evaluated using box plots and the Friedman test. The significance of this research lies in its contribution to the field of cybersecurity by introducing reliable and efficient vulnerability detection methods.
Modern information systems are expected to assist users with diverse goals, via exploiting the topical dimension (‘what' the user is searching for) of information needs. However, the intent dimension (‘why' the user is searching) has preferred relatively lesser for the same intention. Traditionally, the intent is an ‘immediate reason, purpose, or goal' that motivates the user search, and captured in search contexts (Pre-search, In-search, Pro-Search), an ideal information system would be able to use. This article proposes a novel intent estimation strategy; based on the intuition that captured intent, and proactively extracts likely results. The captured ‘Pre-search' context adapts query term proximities within matched results beside document-term statistics and pseudo-relevance feedback with user-relevance feedback for In-search. The assessment asserts the superior performance of the proposed strategy over the equivalent on tradeoffs, e.g., novelty, diversity (coverage, topicality), retrieval (precision, recall, F-measure) and exploitation vs exploration.