检索结果-内蒙古大学图书馆

Enhancing malware detection performance: leveraging K-Nearest Neighbors with Firefly Optimization Algorithm

Multimedia Tools and Applications 2025年第12期84卷 10071-10094页

作者： Al Saaidah, Adeeb Abualhaj, Mosleh M. Shambour, Qusai Y. Abu-Shareha, Ahmad Adel Abualigah, Laith Al-Khatib, Sumaya N. Alraba’nah, Yousef H Department of Networks and Cybersecurity Al-Ahliyya Amman University Amman Jordan Department of Software Engineering Al-Ahliyya Amman University Amman Jordan Department of Data Science and Artificial Intelligence Al-Ahliyya Amman University Amman Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Research Center University of Tabuk Tabuk71491 Saudi Arabia MEU Research Unit Middle East University Amman11831 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon College of Engineering Yuan Ze University Taoyuan32003 Taiwan Applied Science Research Center Applied Science Private University Amman11931 Jordan School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia

Malware detection plays a crucial role in ensuring robust cybersecurity amidst the ever-evolving cyber threats. This research paper delves into the realm of machine learning (ML) algorithms for malware detection, with a specific emphasis on the K-Nearest Neighbors (KNN) algorithm, utilizing tailored parameter settings and the Firefly Optimization Algorithm (FOA). The study leverages the MalMem-2022 dataset to assess the efficacy of KNN and KNN with FOA in malware detection. The impact of parameter tuning and feature selection on classification is elucidated by comparing the performance of both approaches. Encouragingly, the results reveal promising advancements in one of the multiclass classification scenarios when employing KNN with FOA, yielding noteworthy enhancements in Accuracy, Recall, Precision, Matthews Correlation Coefficient, TNR, and F1-score by 2.65%, 2.65%, 2.47%, 3.59%, 0.17%, and 2.61%, respectively. These findings accentuate the significance of optimizing KNN’s parameters and implementing FOA for feature selection, culminating in heightened accuracy in malware detection. The symbiotic fusion of KNN and FOA exhibits remarkable effectiveness in augmenting the classification model’s performance, thus offering valuable insights for bolstering cybersecurity measures. Adopting ML algorithms, particularly KNN with specific parameter settings and FOA, presents a promising avenue for enhancing malware detection capabilities. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Semi-automated meningioma segmentation with bounding boxes

引用

Procedia computer science 2024年 245卷 583-590页

作者： Nur Adhianti Heryanto Mahmud Isnan Matthew Martianus Henry Bens Pardamean Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta Indonesia 11480

Segmentation is manually performed by physicians, which takes considerable time and may be subject to observers. Automating this task can increase efficiency and consistency. Existing studies on meningioma segmentation used data from limited study centers, indicating the need for research on multi-center data to assess generalizability. In this work, two semi-automated methods with bounding box priors, LiteMedSAM and BBU-Net, are evaluated on the brain tumor segmentation (BraTS) 2023 meningioma dataset collected from five study-centers. Preprocessing included exclusion of small tumors, z-score normalization, and extraction of slices that contain tumors, generating 25,602 2D axial magnetic resonance imaging (MRI) scans. A fine-tuning strategy is adopted for LiteMedSAM while BBU-Net is trained from scratch. The models are evaluated using a five-fold cross-validation, with data split at the case level. Results show that while U-Net models can achieve performance close to LiteMedSAM, the foundation model has overall better performance, with more than 90% in all evaluation scores.

关键词： Bounding boxes Meningioma Semi-automated segmentation

来源：评论

学校读者我要写书评

暂无评论

Automatic question generation for bahasa indonesia examination using copynet

引用

Procedia computer science 2024年 245卷 953-962页

作者： Matthew Martianus Henry Gregorius Natanael Elwirehardja Bens Pardamean Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta Indonesia 11480

In educational institutions, an educator is responsible for assessing the student's knowledge grasp through examination. Creating exam questions, even the low-level factoid questions, is time-consuming, especially for inexperienced educators. Therefore, this study aims to create a sequence-to-sequence model using CopyNet by exploiting its copying mechanism advantage to automatically generate Bahasa Indonesia factoid questions to ease the educator's burden. Indonesian records in the TyDi QA dataset are used as the model input. GRU and Bi-GRU are employed as the CopyNet encoder, while LSTM is used as the CopyNet decoder. The model that utilizes GRU as the encoder achieves BLEU1, BLEU2, BLEU3, BLEU4, and ROUGE-L scores of 0.28, 0.19, 0.14, 0.1, and 0.32, respectively. Bi-GRU utilization as the model encoder achieves BLEU1, BLEU2, BLEU3, BLEU4, and ROUGE-L scores of 0.26, 0.17, 0.12, 0.09, and 0.30, respectively. Models using either encoder still achieve low scores. However, compared with the previous work, the result is still on par regarding the BLEU score. Further examination found that the generated questions do not adhere to semantic and syntactical correctness. Adding more records to the dataset and utilizing a more advanced architecture like CopyBERT are encouraged to improve the model performance in future work. Despite the result, this study has shown that CopyNet, primarily designed for text summarization or single-turn dialogue, can be tailored for factoid question generation.

关键词： Automatic question generation Bahasa Indonesia Copying mechanism Natural language generation Sequence-to-sequence

来源：评论

学校读者我要写书评

暂无评论

Exploring EfficientNet Variants for Image Encoding in Auxiliary Signal Guided Knowledge Encoder-Decoder Framework

引用

Procedia computer science 2024年 245卷 391-398页

作者： Matthew Martianus Henry Nur Adhianti Heryanto Bens Pardamean Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta Indonesia 11480

The growing number of medical images has led to radiologist burnout, which seriously impacts the radiologist's performance. To address the previously mentioned issue, an Auxiliary Signal Guided Knowledge (ASGK) multimodal encoder-decoder framework was designed to automatically generate the medical report based on the proposed medical graph and natural language decoder. It utilizes DenseNet-121 as the image encoder. With DenseNet-121 lack of computational and memory efficiency, this study aims to explore the potential of EfficientNetB0 to EfficientNetB4 as an ASGK image encoder substitute. The framework is trained with IU X-Ray dataset for 30 epochs, with Adam optimizer, a learning rate of 0.01 with 0.8 decay rate, binary cross entropy loss for the medical tags, and cross-entropy loss for the generated medical captions. During the framework training process with each image encoder, the parameter that achieves the highest CIDEr score on the validation set is considered the best image encoder parameter and will be used on the test set. On the test set, EfficientNetB3 as an ASGK image encoder has been shown to increase the CIDEr score to 0.35, a significant increase from the 0.28 CIDEr score obtained by the ASGK using DenseNet-121. This score is only a 1% decrease from the best validation score. It suggests that not only EfficientNetB3 increases the framework's performance, it is also less prone to overfitting. This study has demonstrated that EfficientNetB3 is a potential image encoder substitute for DenseNet-121 in the ASGK framework.

关键词： Automated medical report generation DenseNet-121 EfficientNet Encoder-decoder framework

来源：评论

学校读者我要写书评

暂无评论

Comparison of K-Nearest Neighbor and Support Vector Regression for Predicting Oil Palm Yield 1

引用

International Conference on Innovative Technologies in Intelligent Systems and Industrial Applications, CITISIA 2022

作者： Pardamean, Bens Suparyanto, Teddy Sinaga, Gokma Sahat Tua Elwirehardja, Gregorius Natanael Firmansyah, Erick Ginting, Candra Mawandha, Hangger Gahara Putra, Dian Pratama Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program—Master of Computer Science Program Bina Nusantara University Jakarta11480 Indonesia Faculty of Agriculture Institute of Agriculture STIPER Yogyakarta55282 Indonesia

ISBN: (数字)9783031290787

ISBN: (纸本)9783031290770

With the high demand for oil palm production, implementations of Machine Learning (ML) technologies to provide accurate predictions and recommendations to assist oil palm plantation management tasks have become beneficial, such as in predicting annual oil palm. However, different geographical and meteorological conditions may result in different scales of influence for each variable. In this research, K-Nearest Neighbors (KNN) and Support Vector Regression (SVR) were used in predicting oil palm yield based on data collected in Riau, Indonesia. Pearson’s correlation coefficient was also calculated in selecting the input features for the models, whereas normalization and standardization were used in scaling the data. By setting the minimum absolute correlation threshold to 0.1 and using standardization, both models managed to obtain more than 0.81 R2, with SVR obtaining the overall best performance with 0.8709 R2, 1.372 MAE, and 1.8025 RMSE without hyperparameter fine-tuning. It was also discovered that the oil palm yield in the previous year is the variable with the most influence in estimating oil palm yield in the current year, followed by the number of plants and soil types. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

LDA Topic Modeling for Bioinformatics Terms in arXiv Documents

引用

Procedia computer science 2024年 245卷 229-238页

作者： Andrea Stevens Karnyoto Matthew Martianus Henry Bens Pardamean Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta Indonesia 11480 Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta Indonesia 11480

A wide variety of disciplines contribute to bioinformatics research, including computer science, biology, chemistry, mathematics, and physics. This study determines the number of research articles published on arXiv classified as bioinformatics topics and the most frequently used bioinformatics terms using topic modeling, Latent Dirichlet Allocation (LDA). An algorithm based on LDA is used to discover topics hidden within large collections of documents through the use of statistical analysis. Our research examined 226453 articles on arXiv between January 2023 and January 2024. As a result, there are more than 10521 articles categorized into bioinformatics topics. Most commonly, 6352 documents are in the "Mathematical Physics" category. The second most popular category is "computer science," with 2950 documents. Accordingly, the terms 'RNA,' 'sequence,' 'tree,' and 'homology' are the three most commonly used terms in bioinformatics. The study of RNA plays a vital role in molecular biology; thus, the study of RNA is prevalent in bioinformatics. Sequential data refer to the order in which nucleotides or amino acids can be found in a DNA molecule or a protein.

关键词： arXiv bioinformatics Latent Dirichlet Allocation

来源：评论

学校读者我要写书评

暂无评论

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

引用

Neural Computing and Applications 2024年第19期36卷 11137-11170页

作者： Biswas, Saptadeep Shaikh, Azharuddin Ezugwu, Absalom El-Shamir Greeff, Japie Mirjalili, Seyedali Bera, Uttam Kumar Abualigah, Laith Department of Mathematics National Institute of Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom2520 South Africa Faculty of Natural and Agricultural Sciences School of Computer Science and Information Systems North-West University Vanderbijlpark South Africa Centre for Artificial Intelligence Research and Optimization Torrens University Australia Fortitude Valley BrisbaneQLD4006 Australia Research Center University of Tabuk Tabuk71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia College of Engineering Yuan Ze University Taoyuan32003 Taiwan MEU Research Unit Middle East University Amman11831 Jordan

This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study. © The Author(s) 2024.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Thai Conversational Chatbot Classification Using BiLSTM and data Augmentation 1st

Thai Conversational Chatbot Classification Using BiLSTM and ...

引用

1st International Conference on data science and Artificial Intelligence, DSAI 2023

作者： Lhasiw, Nunthawat Tanantong, Tanatorn Sanglerdsinlapachai, Nuttapong Thammasat Research Unit in Data Innovation and Artificial Intelligence Department of Computer Science Faculty of Science and Technology Thammasat University Pathum Thani Thailand Strategic Analytics Networks with Machine Learning and AI Research Team National Electronics and Computer Technology Center Pathum Thani Thailand

ISBN: (纸本)9789819979684

Chatbot platforms, e.g., Facebook and Line, have revolutionized human interaction in the digital age. In order to develop an automatic chatbot classification, there are several challenges especially for Thai chat messages. Conversational messages are usually short and ambiguous. Therefore, it is difficult to find a dataset for constructing an effective classification model. To address the limited size of the dataset, data augmentation techniques can be possibly applied. data augmentation involves generating synthetic messages by applying various transformations to existing data samples while preserving their original meaning. In this study, the size and diversity of the dataset is increased by two methods, i.e., text augmentation using word2vec from Thai2Fit and English-Thai machine translation models proposed by VISTEC. Based on the augmented messages, a Deep Learning technique, BiLSTM, is used to construct a chatbot classification model. The experimental obtained results demonstrate that data augmentation can help to increase the classification performance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Semantic Template-based Convolutional Neural Network for Text Classification

引用

ACM Transactions on Asian and Low-Resource Language Information Processing 2023年第11期22卷 1-21页

作者： Chang, Yung-Chun Ng, Siu Hin Chen, Jung-Peng Liang, Yu-Chi Hsu, Wen-Lian Graduate Institute of Data Science Taipei Medical University Taipei Taiwan Clinical Big Data Research Center Taipei Medical University Hospital Taipei Taiwan Snhcc Tigp Academia Sinica National Cheng Chi University Taipei Taiwan Institute of Information Systems and Applications National Tsing Hua University Hsinchu Taiwan Department of Computer Science and Information Engineering College of Information and Electrical Engineering Asia University Taichung Taiwan Pervasive Ai Research Labs Ministry of Science and Technology Hsinchu City Taiwan

We propose a semantic template-based distributed representation for the convolutional neural network called Semantic Template-based Convolutional Neural Network (STCNN) for text categorization that imitates the perceptual behavior of human comprehension. STCNN is a highly automatic approach that learns semantic templates that characterize a domain from raw text and recognizes categories of documents using a semantic-infused convolutional neural network that allows a template to be partially matched through a statistical scoring system. Our experiment results show that STCNN effectively classifies documents in about 140,000 Chinese news articles into predefined categories by capturing the most prominent and expressive patterns and achieves the best performance among all compared methods for Chinese topic classification. Finally, the same knowledge can be directly used to perform a semantic analysis task. © 2023 held by the owner/author(s). Publication rights licensed to ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup 42

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Gu, Lin Huang, Junhao Huang, Shaoxing Zeng, Deze Li, Bo Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China China University of Geosciences School of Computer Science Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions. © 2023 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：