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

2024 IEEE International Conference on Computing, ICOCO 2024

作者： Rakin, Abdullah Al Sharif, Kazi Shaharair Nayyem, Mohammad Navid Raju, Md Azad Hossain Arafin, Rudmila Hossain, Md Zakir Department of Computer Science University of South Dakota SD United States Department of Computer Science BRAC University Dhaka Bangladesh Master’s in Data Science Grand Canyon University AZ United States

ISBN: (纸本)9798331530303

Cervical cancer remains a leading cause of cancer-related mortality among women globally, particularly in regions with limited access to regular screening. Early detection improves prognosis, yet traditional methods such as Pap smears and HPV testing are often unavailable in low-resource settings. In this work, we present a novel machine learning framework for cervical cancer risk prediction, leveraging a Stacking ensemble of Gradient Boosting (GB), Random Forest (RF), XGBoost (XGB), and Support Vector Machines (SVM). To address class imbalance in the dataset, we apply the Synthetic Minority Over-sampling Technique (SMOTE), while Recursive Feature Elimination (RFE) identifies the most relevant clinical and demographic features. Model interpretability is ensured through SHapley Additive exPlanations (SHAP), providing insights into feature contributions. Our approach achieves a state-of-the-art accuracy of 99.00%, outperforming individual models and demonstrating the effectiveness of ensemble learning for early diagnosis. This work presents a scalable, interpretable, and clinically viable solution for improving cervical cancer screening in resource-constrained environments, setting a new benchmark in predictive modeling for medical diagnostics. ©2024 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and Applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Prefetching-based Adaptive Video Streaming Strategy on Edge Computing 29

Prefetching-based Adaptive Video Streaming Strategy on Edge ...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Yi, Xuanyu Zhou, Jipeng Jinan University Department of Computer Science Guangzhou China Jinan University School of Data Science of Guangzhou Huashang College Department of Computer Science Guangzhou China

ISBN: (纸本)9798350330717

Dynamic Adaptive Streaming over HTTP (DASH) is a widely adopted video streaming protocol. Adaptive Bitrate Streaming (ABR) algorithm is utilized to dynamically switch between different bitrates. However, traditional ABR algorithms have gradually failed to meet users' demands for high-quality video transmission, especially in complex network environments. Thus, the current research focus has shifted towards enhancing the accuracy of algorithm. The advent of edge computing has brought new possibilities for DASH transmission. Edge computing-based algorithms can make decisions from a more macroscopic perspective, which can enhance algorithm efficiency. In this paper, we propose an edge computing-based strategy that enables the edge server to obtain the actual file size of the next segment at every bitrate. As a result, edge servers can obtain more informations. We further propose an edge-based system model that assists the ABR algorithm in achieving better operational efficiency. With additional information, the algorithm located at the edge node possesses the capability to make more precise decisions, which is advantageous for enhancing the quality of experience (QoE) for users. Our experiments demonstrate that the proposed strategy can significantly enhance QoE and network resource utilization. © 2023 IEEE.

关键词： DASH Edge Computing Video Streaming

来源：评论

学校读者我要写书评

暂无评论

data Mining and Bioinformatics Approaches to Elucidate Bacterial Communities in the Extreme Environment

Data Mining and Bioinformatics Approaches to Elucidate Bacte...

引用

2023 International Conference on Informatics, Multimedia, Cyber and Information Systems, ICIMCIS 2023

作者： Trinugroho, Joko Pebrianto Hidayat, Alam Ahmad Nirwantono, Rudi Asadi, Faisal Pardamean, Bens Bina Nusantara University Bioinformatics and Data Science Research Center Jakarta11480 Indonesia Bina Nusantara University School of Computer Science Bioinformatics and Data Science Research Center Mathematics Department Jakarta11480 Indonesia Bina Nusantara University Faculty of Engineering Bioinformatics and Data Science Research Center Biotechnology Department Jakarta11480 Indonesia Bina Nusantara University School of Computer Science Bioinformatics and Data Science Research Center Computer Science Department Jakarta11480 Indonesia Bina Nusantara University Binus Graduate Program Computer Science Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9798350307306

Bacteria are microscopic organisms that can be found in many environments. They are abundant and have many roles in our life. Studying bacteria is essential so that we can identify the bacteria that are needed for many industrial applications. However, the main problem is that majority of the bacteria are unculturable, hampering the exploration of bacteria from different environments. Metagenomics approach which employs Next Generation Sequencing technology could help study bacteria by utilizing 16S rRNA marker gene. This study aims to demonstrate data mining and bioinformatics approaches to analyze 16S rRNA sequencing data. The raw sequencing data of 16S rRNA was collected from biological database. Then, the data were trimmed, denoised, and clustered to generate Amplicon Sequence Variants (ASVs). Diversity (alpha and beta) and taxonomic analyses were then conducted to elucidate the bacterial diversity and taxonomic profile of ASVs. The results of this work showed that Shannon and PD indices in China's hot spring were higher than Singapore and the USA. Furthermore, a significant difference was observed in the PD index. The unweighted UniFrac distance also showed there was a significant difference of the bacterial communities between the three locations. In addition, the taxonomic investigation unveiled prevalent bacterial groups in the ecosystem, namely Proteobacteria, Chloroflexi, Cyanobacteria, and Crenarchaeota. The research outcomes have the potential to serve as a foundational resource for subsequent bacterial metagenomic research, particularly the hot spring environment. © 2023 IEEE.

关键词： Bacteria

来源：评论

学校读者我要写书评

暂无评论

VaeDiff-DocRE: End-to-end data Augmentation Framework for Document-level Relation Extraction 31

VaeDiff-DocRE: End-to-end Data Augmentation Framework for Do...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Tran, Khai Phan Hua, Wen Li, Xue School of Electrical Engineering and Computer Science The University of Queensland Australia Department of Data Science and Artificial Intelligence The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9798891761964

Document-level Relation Extraction (DocRE) aims to identify relationships between entity pairs within a document. However, most existing methods assume a uniform label distribution, resulting in suboptimal performance on real-world, imbalanced datasets. To tackle this challenge, we propose a novel data augmentation approach using generative models to enhance data from the embedding space. Our method leverages the Variational Autoencoder (VAE) architecture to capture all relation-wise distributions formed by entity pair representations and augment data for underrepresented relations. To better capture the multi-label nature of DocRE, we parameterize the VAE's latent space with a Diffusion Model. Additionally, we introduce a hierarchical training framework to integrate the proposed VAE-based augmentation module into DocRE systems. Experiments on two benchmark datasets demonstrate that our method outperforms state-of-the-art models, effectively addressing the long-tail distribution problem in DocRE. Our code is released at: https://***/khaitran22/VaeDiff-DocRE. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Enhancing cuckoo search algorithm with complement strategy

引用

International Journal of Innovative Computing and Applications 2022年第5-6期13卷 314-324页

作者： Peng, Hu Lu, Hua Deng, Changshou School of Computer and Big Data Science Jiujiang University Jiujiang332005 China

Cuckoo search (CS) algorithm is proposed by Yang and Deb, which is a simple and effective swarm intelligence algorithm. In each iteration, the CS search for new solutions by the global explorative random walk and the local random walk, the greedy strategy is used to choose a better solution. However, the CS uses a single strategy and fixed parameters, in which performance of the CS in balancing exploitation and exploration is inadequate, which results in poor convergence performance of the CS. To cope with this problem, a novel CS variant with complement strategy (CoCS) was proposed by us, in which the new solution is generated by two strategies in a random manner. One of the strategy is an improved Lêvy flights, and the other is adaptive to determine the step size according to the fitness value of the step size and the number of current iterations. The algorithm also uses an improved random walk. The proposed CoCS, the standard CS, and other excellent CS variants were tested on 28 benchmark functions of CEC 2013 test suite. Experimental results prove that the CoCS is superior to these competitors. Copyright © 2022 Inderscience Enterprises Ltd.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

A review: data pre-processing techniques used for diabetes prediction 9th

A review: Data pre-processing techniques used for diabetes p...

引用

9th International Conference on computer science and Computational Intelligence, ICCSCI 2024

作者： Isnan, Mahmud Elwirehardja, Gregorius Natanael Pardamean, Bens Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Cmputer Science Department BINUS Graduate Program Computer Science Program Bina Nusantara University Jakarta11480 Indonesia

When processing datasets in diabetes classification, common problems included a large number of missing values, outliers, and dataset imbalance. To deal with those issues, this study analyzed 18 studies on diabetes classification with machine learning algorithms over the past 5 years. This revealed the important role of data pre-processing in creating effective classification models, as it was found that by using different data pre-processing techniques, the same model can provide different performance. The study identified K-Nearest Neighbor (KNN) and support vector machine (SVM) as superior methods for filling in missing values, achieving an accuracy of 98.49% and 94.89%, respectively. These approaches outperformed traditional methods such as median or mean replacement. However, the challenge of imbalanced data sets remains in all studies reviewed. The common evaluation metrics used to evaluate the created models in previous studies included accuracy, precision, specificity, sensitivity/recall, and F1 Score. Overall, this review showed that the role of data pre-processing is no less important than algorithm selection to improve the performance of machine learning models in diabetes classification. © 2024 The Authors.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Intention Analysis Makes LLMs A Good Jailbreak Defender 31

Intention Analysis Makes LLMs A Good Jailbreak Defender

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Yuqi Ding, Liang Zhang, Lefei Tao, Dacheng School of Computer Science Wuhan University China The University of Sydney Australia College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9798891761964

Aligning large language models (LLMs) with human values, particularly when facing complex and stealthy jailbreak attacks, presents a formidable challenge. Unfortunately, existing methods often overlook this intrinsic nature of jailbreaks, which limits their effectiveness in such complex scenarios. In this study, we present a simple yet highly effective defense strategy, i.e., Intention Analysis (IA). IA works by triggering LLMs' inherent self-correct and improve ability through a two-stage process: 1) analyzing the essential intention of the user input, and 2) providing final policy-aligned responses based on the first round conversation. Notably, IA is an inference-only method, thus could enhance LLM safety without compromising their helpfulness. Extensive experiments on varying jailbreak benchmarks across a wide range of LLMs show that IA could consistently and significantly reduce the harmfulness in responses (averagely -48.2% attack success rate). Encouragingly, with our IA, Vicuna-7B even outperforms GPT-3.5 regarding attack success rate. We empirically demonstrate that, to some extent, IA is robust to errors in generated intentions. Further analyses reveal the underlying principle of IA: suppressing LLM's tendency to follow jailbreak prompts, thereby enhancing safety. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Harnessing Large Language Models for Text-Rich Sequential Recommendation 24

Harnessing Large Language Models for Text-Rich Sequential Re...

引用

33rd ACM Web Conference, WWW 2024

作者： Zheng, Zhi Chao, WenShuo Qiu, Zhaopeng Zhu, Hengshu Xiong, Hui School of Data Science University of Science and Technology of China China Career Science Lab BOSS Zhipin China China China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798400701719

Recent advances in Large Language Models (LLMs) have been changing the paradigm of Recommender Systems (RS). However, when items in the recommendation scenarios contain rich textual information, such as product descriptions in online shopping or news headlines on social media, LLMs require longer texts to comprehensively depict the historical user behavior sequence. This poses significant challenges to LLM-based recommenders, such as over-length limitations, extensive time and space overheads, and suboptimal model performance. To this end, in this paper, we design a novel framework for harnessing Large Language Models for Text-Rich Sequential Recommendation (LLM-TRSR). Specifically, we first propose to segment the user historical behaviors and subsequently employ an LLM-based summarizer for summarizing these user behavior blocks. Particularly, drawing inspiration from the successful application of Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) models in user modeling, we introduce two unique summarization techniques in this paper, respectively hierarchical summarization and recurrent summarization. Then, we construct a prompt text encompassing the user preference summary, recent user interactions, and candidate item information into an LLM-based recommender, which is subsequently fine-tuned using Supervised Fine-Tuning (SFT) techniques to yield our final recommendation model. We also use Low-Rank Adaptation (LoRA) for Parameter-Efficient Fine-Tuning (PEFT). We conduct experiments on two public datasets, and the results clearly demonstrate the effectiveness of our approach. © 2024 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

One-class Classification Using Autoencoder Feature Residuals for Improved IoT Network Intrusion Detection 32

One-class Classification Using Autoencoder Feature Residuals...

引用

32nd International Conference on computer Communications and Networks, ICCCN 2023

作者： Lewandowski, Brian Paffenroth, Randy Worcester Polytechnic Institute Computer Science Worcester United States Worcester Polytechnic Institute Data Science Mathematical Sciences and Computer Science Worcester United States

ISBN: (纸本)9798350336184

Networks are rapidly evolving to include more Internet of Things devices as we grow to rely on them for smart home services, health infrastructure, and industrial development. Along with this proliferation, these networks are often the target of cyberattacks that seek to take advantage of their low processing power and the complexity that is involved in protecting heterogeneous networks. We seek to improve our network intrusion detection capabilities for Internet of Things networks by developing methods of detection that utilize the power of deep learning and have the ability to detect zero-day attacks. In this work, we outline a novel feature generation process using autoencoder feature residuals that can be combined with one-class classifiers to effectively detect network attacks on Internet of Things networks using no attack data during the training process. Moreover, we show that our novel feature sets are able to outperform using an original feature set leading to a reduction of typical model hyperparameter tuning activities. © 2023 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：