Claim Missing Document
Check
Articles

Found 2 Documents
Search

COMPARATIVE ANALYSIS OF THE K-NEAREST NEIGHBOR ALGORITHM ON VARIOUS INTRUSION DETECTION DATASETS Andri Agung Riyadi; Fachri Amsury; Irwansyah Saputra; Tiska Pattiasina; Jupriyanto Jupriyanto
Jurnal Riset Informatika Vol 4 No 1 (2021): Period of December 2021
Publisher : Kresnamedia Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (945.029 KB) | DOI: 10.34288/jri.v4i1.341

Abstract

Security in computer networks can be vulnerable, this is because we have weaknesses in making security policies, weak computer system configurations, or software bugs. Intrusion detection is a mechanism for securing computer networks by detecting, preventing, and blocking illegal attempts to access confidential information. The IDS mechanism is designed to protect the system and reduce the impact of damage from any attack on a computer network for violating computer security policies including availability, confidentiality, and integrity. Data mining techniques have been used to obtain useful knowledge from the use of IDS datasets. Some IDS datasets that are commonly used are Full KDD, Corrected KDD99, NSL-KDD, 10% KDD, UNSW-NB15, Caida, ADFA Windows, and UNM have been used to get the accuracy rate using the k-Nearest Neighbors algorithm (k-NN). The latest IDS dataset provided by the Canadian Institute of Cybersecurity contains most of the latest attack scenarios named the CICIDS2017 dataset. A preliminary experiment shows that the approach using the k-NN method on the CICIDS2017 dataset successfully produces the highest average value of intrusion detection accuracy than other IDS datasets.
Resource Efficient Semantic Retrieval Pipeline via Generative Captioning and Text-to-Text Transformers for Bridging the Modality Gap Muhammad Firmansyah; Dhendra Marutho; Irwansyah Saputra; Eleni Vogiatzi
Journal of Intelligent Computing & Health Informatics Vol 6, No 2 (2025): September
Publisher : Universitas Muhammadiyah Semarang Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26714/jichi.v6i2.19240

Abstract

The rapid expansion of multimodal digital content necessitates the development of robust information retrieval systems capable of bridging the semantic gap between visual and textual data. However, contemporary cross- modal models, such as CLIP, impose significant computational demands, rendering them impractical for real-time deployment in resource-limited environments. To address this efficiency challenge, this study introduces a novel lightweight retrieval pipeline that reconceptualizes cross-modal retrieval as a text-to-text task through generative transformation. The proposed methodology employs the Bootstrapped Language-Image Pretraining (BLIP) model to distill visual features into rich textual descriptions, which are subsequently encoded into dense semantic vectors using the T5 transformer architecture. Extensive experiments conducted on the MSCOCO and Flickr30K datasets demonstrate that the proposed pipeline achieves a Semantic Average Recall (SAR@5) of 0.561, significantly surpassing traditional lexical (BM25) and dense (SBERT) baselines. Notably, while the computationally intensive CLIP model retains a slight advantage in absolute accuracy, our approach delivers approximately 90% of CLIP’s semantic performance while enhancing inference throughput by 2.1× and reducing GPU memory consumption by 62%. These findings confirm that generative semantic distillation offers a scalable, cost-effective alternative to end-to-end multimodal systems, particularly for latency-sensitive applications requiring high semantic fidelity.