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

9th International Conference on Information Technology and Digital Applications, ICITDA 2024

作者： Henry, Matthew Martianus Heryanto, Nur Adhianti Isnan, Mahmud Nugroho, Kuncahyo Setyo Pardamean, Bens Bina Nusantara University Bioinformatics and Data Science Research Center Jakarta11480 Indonesia School of Computer Science Bina Nusantara University Computer Science Department Jakarta11480 Indonesia Bina Nusantara University Binus Graduate Program Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9798331510732

Despite their drawbacks, multiple-choice questions (MCQ) have been widely used to assess the students' understanding of lectures through examinations. The development of automatic MCQ generation is beneficial, especially for educators. As a starting point for further development, a Systematic Literature Review (SLR) is conducted to uncover current trends, future challenges, and opportunities in automatic MCQ generation. Previously, an SLR was conducted, but it lacks coverage of the utilization of transformer-based models. This SLR covers the development of automatic MCQ generation using either traditional or advanced approaches such as Transformers. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses framework was used to gather the data from Scopus, IEEE Xplore, SpringerLink, arXiv, and Semantic Scholar. The included articles must be open-access computer science conference papers or journal articles and written in English less than five years ago. Four independent reviewers analyzed the research workflow, evaluation metric, and dataset used in each study. There are 18 included studies, where 17% (n = 3) studies are from 2024, 33% (n = 6) studies are from 2023, 22% (n = 4) studies are from 2022, 11% (n = 2) studies are from 2021, and 17% (n = 3) studies are from 2020. There are 33% (n = 6) of the studies used the traditional feature-based engineering approach, 39% (n = 7) of the studies used the Transformer-based model fine-tuning approach, and the remaining used novel approaches. The study found that BERT variants are the most utilized Transformer-based model in automatic MCQ. The research notes some challenges, but also open various opportunities for further research, including Large Language Model (LLM) utilization for automatic MCQ generation, the utilization BERT-based models for standardized machine-learned evaluation metrics, and the initiative for the creation of an MCQ dataset benchmark. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

List Sample Compression and Uniform Convergence 37

List Sample Compression and Uniform Convergence

引用

37th Annual Conference on Learning Theory, COLT 2024

作者： Hanneke, Steve Moran, Shay Waknine, Tom Department of Computer Science Purdue University United States Departments of Mathematics Computer Science and Data and Decision Sciences Technion Google Research Israel Department of Mathematics Technion Israel

List learning is a variant of supervised classification where the learner outputs multiple plausible labels for each instance rather than just one. We investigate classical principles related to generalization within the context of list learning. Our primary goal is to determine whether classical principles in the PAC setting retain their applicability in the domain of list PAC learning. We focus on uniform convergence (which is the basis of Empirical Risk Minimization) and on sample compression (which is a powerful manifestation of Occam's Razor). In classical PAC learning, both uniform convergence and sample compression satisfy a form of 'completeness': whenever a class is learnable, it can also be learned by a learning rule that adheres to these principles. We ask whether the same completeness holds true in the list learning setting. We show that uniform convergence remains equivalent to learnability in the list PAC learning setting. In contrast, our findings reveal surprising results regarding sample compression: we prove that when the label space is Y = {0, 1, 2}, then there are 2-list-learnable classes that cannot be compressed. This refutes the list version of the sample compression conjecture by Littlestone and Warmuth (1986). We prove an even stronger impossibility result, showing that there are 2-list-learnable classes that cannot be compressed even when the reconstructed function can work with lists of arbitrarily large size. We prove a similar result for (1-list) PAC learnable classes when the label space is unbounded. This generalizes a recent result by Pabbaraju (2023). In our impossibility results on sample compression, we employ direct-sum arguments which might be of independent interest. In fact, these arguments raise natural open questions that we leave for future research. Our findings regarding uniform convergence rely on a coding theoretic perspective. © 2024 S. Hanneke, S. Moran & T. Waknine.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fair Machine Learning in Healthcare: A Survey

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 493-507页

作者： Feng, Qizhang Du, Mengnan Zou, Na Hu, Xia Texas A&M University Department of Computer Science & Engineering College StationTX77843 United States New Jersey Institute of Technology Department of Data Science NewarkNJ07102 United States University of Houston Department of Industrial Engineering HoustonTX77004 United States Rice University Department of Computer Science HoustonTX77251 United States

The digitization of healthcare data coupled with advances in computational capabilities has propelled the adoption of machine learning (ML) in healthcare. However, these methods can perpetuate or even exacerbate existing disparities, leading to fairness concerns such as the unequal distribution of resources and diagnostic inaccuracies among different demographic groups. Addressing these fairness problems is paramount to prevent further entrenchment of social injustices. In this survey, we analyze the intersection of fairness in ML and healthcare disparities. We adopt a framework based on the principles of distributive justice to categorize fairness concerns into two distinct classes: equal allocation and equal performance. We provide a critical review of the associated fairness metrics from a ML standpoint and examine biases and mitigation strategies across the stages of the ML lifecycle, discussing the relationship between biases and their countermeasures. The article concludes with a discussion on the pressing challenges that remain unaddressed in ensuring fairness in healthcare ML and proposes several new research directions that hold promise for developing ethical and equitable ML applications in healthcare. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

HGP-NLP at BioLaySumm: Leveraging LoRA for Lay Summarization of Biomedical Research Articles using Seq2Seq Transformers 23

HGP-NLP at BioLaySumm: Leveraging LoRA for Lay Summarization...

引用

23rd Meeting of the ACL Special Interest Group on Biomedical Natural Language Processing, BioNLP 2024

作者： Malik, Hemang Pradeep, Gaurav Seth, Pratinav Manipal Institute of Technology Manipal Academy of Higher Education Manipal India Dept. of Data Science & Computer Applications India Dept. of Computer Science & Engineering India

ISBN: (纸本)9798891761308

Lay summarization aims to generate summaries of technical articles for non-experts, enabling easy comprehension for a general audience. The technical language used in research often hinders effective communication of scientific knowledge, making it difficult for non-experts to understand. Automatic lay summarization can enhance access to scientific literature, promoting interdisciplinary knowledge sharing and public understanding. This has become especially important for biomedical articles, given the current global need for clear medical information. Large Language Models (LLMs) (Yao et al., 2024), with their remarkable language understanding capabilities, are ideal for abstractive summarization, helping to make complex information accessible to the public. This paper details our submissions to the BioLaySumm 2024 Shared Task: Lay Summarization of Biomedical Research Articles (Goldsack et al., 2024). We fine-tune and evaluate sequence-to-sequence models like T5 across various training dataset settings and optimization methods such as LoRA (Hu et al., 2021b) for lay summarization. Our submission achieved the 53rd position overall.. ©2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A Credible and Fair Federated Learning Framework Based on Blockchain

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 301-316页

作者： Chen, Leiming Zhao, Dehai Tao, Liping Wang, Kai Qiao, Sibo Zeng, Xingjie Tan, Chee Wei China University of Petroleum School of Computer Science and Technology East China Qingdao266580 China CSIRO's Data61 Sydney2015 Australia Hefei University of Technology Anhui230009 China Nanyang Technological University School of Computer Science and Engineering Singapore639798 Singapore Tiangong University School of Software Tianjin300387 China Southwest Petroleum University School of Computer Science Chengdu610500 China

Federated learning (FL) enables cooperative computation between multiple participants while protecting user privacy. Currently, FL algorithms assume that all participants are trustworthy and their systems are secure. However, the following problems arise in real-world scenarios: 1) Malicious clients disrupt FL through model poisoning and data poisoning attacks. Although some research has proposed secure aggregation methods to solve this problem, most methods have limitations. 2) The current method cannot fairly evaluate client contribution in some scenarios. Some clients exhibit free-rider behavior, seeking to cheat the reward system and manipulate global models. Evaluating client contribution and distributing rewards also present challenges. To address these challenges, we design a trustworthy federated framework to ensure secure computing throughout the federated task process. First, we propose a method of detecting malicious models to guarantee secure model aggregation. Then, we propose a fair method of assessing contribution to identify client-side free-riding behavior. Finally, we implement a computation process based on blockchain and smart contracts to guarantee the trustworthiness and fairness of federated tasks. To validate the performance of our framework, we simulate different types of client attacks and contribution evaluation scenarios on several open-source datasets. The experiments show that our framework ensures the credibility of federated tasks and achieves a fair evaluation of client contributions. © 2020 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Red deer algorithm to detect the secret key of the monoalphabetic cryptosystem

引用

Soft Computing 2024年第17-18期28卷 10569-10582页

作者： Jain, Ashish Bansal, Sulabh Das, Nripendra Narayan Gupta, Shyam Sunder Department of Information Technology School of Information Security and Data Science Manipal University Jaipur Jaipur303007 India Department of Computer Science and Engineering Amity School of Engineering and Technology Amity University Madhya Pradesh Gwalior474005 India

Encryption of a plaintext involves a secret key. The secret key of classical cryptosystems can be successfully determined by utilizing metaheuristic techniques. Monoalphabetic cryptosystem is one of the famous classical cryptosystems. In this paper, we determine the secret key of the monoalphabetic cryptosystem using a recently proposed metaheuristic technique, namely, red deer algorithm. The existing red deer algorithm framework has been tailored to solve the above considered problem. Performance of the developed red deer algorithm is compared with the following metaheuristic techniques: tabu search, genetic algorithm, and cuckoo search using three criteria, namely, effectiveness, efficiency, and accuracy. The results obtained show that the proposed red deer algorithm can compete with all the above three algorithms with respect to all the criteria. This signifies the importance of the proposed red deer algorithm is that it can be utilized to solve the similar problems effectively, efficiently, and with more accuracy. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

Automatic question generation for bahasa indonesia examination using copynet 9th

Automatic question generation for bahasa indonesia examinati...

引用

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

作者： Henry, Matthew Martianus 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 Computer Science Department BINUS Graduate Program Bina Nusantara University Jakarta11480 Indonesia

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. © 2024 The Authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Quantifying Racial Segregation Through Continuous-Time Quantum Walks 27th

Quantifying Racial Segregation Through Continuous-Time Quant...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Jiang, Yutong Wu, Xing Wang, Jianjia School of Computer Engineering and Science Shanghai University Shanghai China Engineering and Science Shanghai Institute for Advanced Communication and Data Science School of Computer Shanghai University Shanghai China Xi’an Jiaotong-Liverpool University Suzhou215123 China

ISBN: (纸本)9783031781919

With the development of cities, racial segregation is one of the reasons for social inequality on a large scale, it is also a major factor affecting economic development. However, racial segregation has received comparatively limited attention in research. In the paper, we propose a segregation index independent of any parameters( titled Quantum Walk Convergence Time), which calculates the convergence time statistics for accessing different racial categories through quantum walks on complex networks constructed from urban systems. The magnitude of the time statistics represents the degree of racial segregation. The results generated by our method can also be applied to other social factors, including family situation, income level, and education level. We evaluate our method using large-scale real datasets, including statistics from the U.S. Census Bureau and the Office for National Statistics in the UK. The results demonstrate the close correlation between our method and the degree of racial segregation, showing advantages over traditional random walk methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

CMNEE: A Large-Scale Document-Level Event Extraction dataset based on Open-Source Chinese Military News 30

CMNEE: A Large-Scale Document-Level Event Extraction Dataset...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhu, Mengna Xu, Zijie Zeng, Kaisheng Xiao, Kaiming Wang, Mao Ke, Wenjun Huang, Hongbin Laboratory for Big Data and Decision National University of Defense Technology China School of Computer Science and Engineering Southeast University China Computer Science and Technology Tsinghua University China

ISBN: (纸本)9782493814104

Extracting structured event knowledge, including event triggers and corresponding arguments, from military texts is fundamental to many applications, such as intelligence analysis and decision assistance. However, event extraction in the military field faces the data scarcity problem, which impedes the research of event extraction models in this domain. To alleviate this problem, we propose CMNEE, a large-scale, document-level open-source Chinese Military News Event Extraction dataset. It contains 17,000 documents and 29,223 events, which are all manually annotated based on a pre-defined schema for the military domain including 8 event types and 11 argument role types. We designed a two-stage, multi-turns annotation strategy to ensure the quality of CMNEE and reproduced several state-of-the-art event extraction models with a systematic evaluation. The experimental results on CMNEE fall shorter than those on other domain datasets obviously, which demonstrates that event extraction for military domain poses unique challenges and requires further research efforts. Our code and data can be obtained from https://***/Mzzzhu/CMNEE. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Open problem: Direct Sums in Learning Theory 37

Open problem: Direct Sums in Learning Theory

引用

37th Annual Conference on Learning Theory, COLT 2024

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：