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

31st International Conference on Computational Linguistics, COLING 2025

作者： Hu, Zhilei Li, Zixuan Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of SciencesSchool of Computer Science and Technology University of Chinese Academy of Sciences

ISBN: (纸本)9798891761964

Event Relation Extraction (ERE) aims to extract various types of relations between different events within texts. Although Large Language Models (LLMs) have demonstrated impressive capabilities in many natural language processing tasks, existing ERE methods based on LLMs still face three key challenges: (1) Time Inefficiency: The existing pairwise method of combining events and determining their relations is time-consuming for LLMs. (2) Low Coverage: When dealing with numerous events in a document, the limited generation length of fine-tuned LLMs restricts the coverage of their extraction results. (3) Lack of Rationale: Essential rationales concerning the results that could enhance the reasoning ability of the model are overlooked. To address these challenges, we propose LLMERE, an LLM-based approach with rationales for the ERE task. LLMERE transforms ERE into a question-and-answer task that may have multiple answers. By extracting all events related to a specified event at once, LLMERE reduces time complexity from O(n2) to O(n), compared to the pairwise method. Subsequently, LLMERE enhances the coverage of extraction results by employing a partitioning strategy that highlights only a portion of the events in the document at a time. In addition to the extracted results, LLMERE is also required to generate corresponding rationales/reasons behind them, in terms of event coreference information or transitive chains of event relations. Experimental results on three widely used datasets show that LLMERE achieves significant improvements over baseline methods. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Multilayer Network Analysis of Brain Signals for Detecting Alzheimer’s Disease 12th

Multilayer Network Analysis of Brain Signals for Detecting...

引用

12th International Conference on Computational Advances in Bio and Medical sciences, ICCABS 2023

作者： Nguyen, Sean M. Basiri, Mohammad Amin Khanmohammadi, Sina School of Computer Science University of Oklahoma NormanOK73019 United States Data Science and Analytics Institute University of Oklahoma NormanOK73019 United States

ISBN: (纸本)9783031827679

Human neuroimaging datasets provide rich multi-scale spatiotemporal information about the state of the brain. Most current methods, such as spectral analysis, focus on a single facet of these datasets and do not take full advantage of the inherent spatiotemporal information. Here, we consider a multilayer cross-frequency functional connectivity analysis to capture the complex spatiotemporal features of neural datasets at multiple scales and show that such features could potentially provide a better description of the neural activity. We demonstrate the effectiveness of this approach by applying the proposed method to capture disruptions of cross-frequency brain connections in Alzheimer’s patients. More specifically, we compared the multi-scale features extracted from electroencephalogram (EEG) data with traditional features in a machine learning framework to distinguish Alzheimer’s patients from control subjects. Our results show that such multi-scale features improve the prediction accuracy when compared to traditional feature extraction methods in EEG analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Multilayer neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Inductive Link Prediction in N-ary Knowledge Graphs 31

Inductive Link Prediction in N-ary Knowledge Graphs

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761964

N-ary Knowledge Graphs (NKGs), where a fact can involve more than two entities, have gained increasing attention. Link Prediction in NKGs (LPN) aims to predict missing elements in facts to facilitate the completion of NKGs. Current LPN methods implicitly operate under a closed-world assumption, meaning that the sets of entities and roles are fixed. These methods focus on predicting missing elements within facts composed of entities and roles seen during training. However, in reality, new facts involving unseen entities and roles frequently emerge, requiring completing these facts. Thus, this paper proposes a new task, Inductive Link Prediction in NKGs (ILPN), which aims to predict missing elements in facts involving unseen entities and roles in emerging NKGs. To address this task, we propose a Meta-learning-based Nary knowledge Inductive Reasoner (MetaNIR), which employs a graph neural network with meta-learning mechanisms to embed unseen entities and roles adaptively. The obtained embeddings are used to predict missing elements in facts involving unseen elements. Since no existing dataset supports this task, three datasets are constructed to evaluate the effectiveness of MetaNIR. Extensive experimental results demonstrate that MetaNIR consistently outperforms representative models across all datasets. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Constructing Three-way Decision with Fuzzy Granular-ball Rough Sets Based on Uncertainty Invariance

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1781-1792页

作者： Yang, Jie Liu, Zhuangzhuang Wang, Guoyin Zhang, Qinghua Xia, Shuyin Wu, Di Liu, Yanmin Zunyi Normal University School of Physics and Electronic Science Zunyi563002 China Jiangsu University of Science and Technology School of Computer Zhenjiang212100 China Chongqing University of Posts and Telecommunications Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Zunyi Normal University School of Mathematics Zunyi563002 China

Granular-ball computing (GBC) proposed by Xia adaptively generates a different neighborhood for each object, resulting in greater generality and flexibility. Moreover, GBC greatly improves the efficiency by replacing point input with granular-ball. However, the current GB-based classifiers rigidly assign a specific class label to each data instance and lacks of the necessary strategies to address uncertain instances. These far-fetched certain classification approachs toward uncertain instances may suffer considerable risks. In this paper, we introduce three-way decision (3WD) into GBC to construct a novel three-way decision with fuzzy granular-ball rough sets (3WD-FGBRS) from the perspective of uncertainty. This helps to construct reasonable multi-granularity spaces for handling complex decision problems with uncertainty. Firstly, 3WD-FGBRS is constructed in a data-driven method based on fuzziness, which avoids the subjective definition of certain risk parameters when calculating the threshold pairs. Based on 3WD-FGBRS, we further propose a sequential three-way decision with fuzzy granular-ball rough sets (S3WD-FGBRS) and analyze the fuzziness loss of multilevel decision result in S3WD-FGBRS. Then, the optimal granular-ball space selection mechanism of S3WD-FGBRS is introduced by combining fuzziness and granular-ball space distance. Finally, extensive comparative experiments are conducted with 3 state-of-the-art GB-based classifiers and 3 classical machine learning classifiers on 12 public benchmark datasets. The results show that our models almost outperform other comparison methods in terms of effectiveness, efficiency and robustness. © 1993-2012 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

Predicting Cardiac Complications of Myocardial Infarction Patients Using Machine Learning

Predicting Cardiac Complications of Myocardial Infarction Pa...

引用

2024 IEEE International Conference on Big data, Bigdata 2024

作者： Baidya, Shriyansh Gupta, Vibhuti Lovejoy High School LucasTX United States Meharry Medical College School of Applied Computational Sciences Department of Computer Science & Data Science NashvilleTN United States

ISBN: (纸本)9798350362480

In the United States, heart disease is the leading cause of death, killing about 695,000 people each year. Myocardial infarction (MI) is a cardiac complication which occurs when blood flow to a portion of the heart decreases or halts, leading to damage in the heart muscle. Heart failure and Atrial fibrillation (AF) are closely associated with MI. Heart failure is a common complication of MI and a risk factor for AF. Machine learning (ML) and deep learning techniques have shown potential in predicting cardiovascular conditions. However, developing a simplified predictive model, along with a thorough feature analysis, is challenging due to various factors, including lifestyle, age, family history, medical conditions, and clinical variables for cardiac complications prediction. This paper aims to develop simplified models with comprehensive feature analysis and data preprocessing for predicting cardiac complications, such as heart failure and atrial fibrillation linked with MI, using a publicly available dataset of myocardial infarction patients. This will help the students and health care professionals understand various factors responsible for cardiac complications through a simplified workflow. By prioritizing interpretability, this paper illustrates how simpler models, like decision trees and logistic regression, can provide transparent decision-making processes while still maintaining a balance with accuracy. Additionally, this paper examines how age-specific factors affect heart failure and atrial fibrillation conditions. Overall this research focuses on making machine learning accessible and interpretable. Its goal is to equip students and non-experts with practical tools to understand how ML can be applied in healthcare, particularly for the cardiac complications prediction for patients having MI. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Secure multimedia communication: advanced asymmetric key authentication with grayscale visual cryptography

引用

Mathematical Biosciences and Engineering 2024年第3期21卷 4762-4778页

作者： Liu, Tao Vairagar, Shubhangi Adagale, Sushadevi Karthick, T. Karunya, Catherine Esther Blesswin, A. John Mary, G. Selva Tianjin Sino-German University of Applied Sciences Tianjin300350 China Department of Artificial Intelligence and Data Science Dr. D. Y. Patil Institute of Technology Pimpri Pune411018 India Department of Computer Engineering KJEI's Trinity Academy of Engineering Pune411048 India Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Kattankulathur603203 India Computer Science and Engineering School of Computing SRM Institute of Science and Technology Kattankulathur603203 India Directorate of Learning and Development SRM Institute of Science and Technology Kattankulathur603203 India

The secure authentication of user data is crucial in various sectors, including digital banking, medical applications and e-governance, especially for images. Secure communication protects against data tampering and forgery, thereby bolstering the foundation for informed decision-making, whether managing traffic, enhancing public safety, or monitoring environmental conditions. Conventional visual cryptographic protocols offer solutions, particularly for color images, though they grapple with challenges such as high computational demands and reliance on multiple cover images. Additionally, they often require third-party authorization to verify the image integrity. On the other hand, visual cryptography offers a streamlined approach. It divides images into shares, where each pixel represented uniquely, thus allowing visual decryption without complex computations. The optimized multi-tiered authentication protocol (OMTAP), which is integrated with the visual sharing scheme (VSS), takes secure image sharing to the next level. It reduces share count, prioritizes image fidelity and transmission security, and introduces the self-verification of decrypted image integrity through asymmetric key matrix generators, thus eliminating external validation. Rigorous testing has confirmed OMTAP's robustness and broad applicability, thereby ensuring that decrypted images maintain their quality with a peak signal-to-noise ratio (PSNR) of 40 dB and full integrity at the receiver's end. © 2024 American Institute of Mathematical sciences. All rights reserved.

关键词： Medical applications

来源：评论

学校读者我要写书评

暂无评论

Reliability and Robustness analysis of Machine Learning based Phishing URL Detectors

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-18页

作者： Sabir, Bushra Babar, M. Ali Gaire, Raj Abuadbba, Alsharif School of Computer Science The University of Adelaide Adelaide SA Australia CSIROs Data61 Canberra Australia

ML-based Phishing URL (MLPU) detectors serve as the first level of defence to protect users and organisations from being victims of phishing attacks. Lately, few studies have launched successful adversarial attacks against specific MLPU detectors raising questions on their practical reliability and usage. Nevertheless, the robustness of these systems has not been extensively investigated. Therefore, the security vulnerabilities of these systems, in general, remain primarily unknown that calls for testing the robustness of these systems. In this article, we have proposed a methodology to investigate the reliability and robustness of 50 representative state-of-the-art MLPU models. First, we have proposed a cost-effective Adversarial URL generator URLBUG that created an Adversarial URL dataset ($Adv_\text{data}$) . Subsequently, we reproduced 50 MLPU (traditional ML and Deep learning) systems and recorded their baseline performance. Lastly, we tested the considered MLPU systems on $Adv_\text{data}$ and analyzed their robustness and reliability using box plots and heat maps. Our results showed that the generated adversarial URLs have valid syntax and can be registered at a median annual price of ${\$}$11.99, and out of 13% of the already registered adversarial URLs, 63.94% were used for malicious purposes. Moreover, the considered MLPU models Matthew Correlation Coefficient (MCC) dropped from median 0.92 to 0.02 when tested against $Adv_\text{data}$, indicating that the baseline MLPU models are unreliable in their current form. Further, our findings identified several security vulnerabilities of these systems and provided future directions for researchers to design dependable and secure MLPU systems. IEEE

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Text Classification for Social Governance: A Novel Strategy with Adaptive Reward Mechanisms 6

Text Classification for Social Governance: A Novel Strategy ...

引用

6th International Conference on Communications, Information System and computer Engineering, CISCE 2024

作者： Kong, Xu Zhu, Xiaomin Wang, Maoli Wang, Xinming Zou, Min School of Computer Science Qufu Normal University Rizhao China Shandong Institute of Big Data Jinan China School of Cyber Science and Engineering Qufu Normal University Qufu China

ISBN: (纸本)9798350353174

Given the increasing need for societal governance systems to effectively address public grievances, classifying texts from public service hotlines and other governance communications has become challenging, especially for texts with complex hierarchical structures. This study explores how adaptive reward mechanisms can be applied to classify complaint texts in societal governance. We propose a novel hierarchical text classification model that overcomes the limitations of traditional methods in handling hierarchical data. We designed a hierarchical loss function that considers inter-label hierarchical relationships to enhance the model's learning of hierarchical information. Additionally, we used a simple label encoding method to reduce computational complexity and improve training efficiency. Experimental results show that our model significantly outperforms existing methods in classification accuracy, both flat and hierarchical. Furthermore, ablation studies confirmed the hierarchical loss function's crucial role in enhancing model performance. This research offers an effective strategy for classifying complex hierarchical data, significantly improving classification tasks in natural language processing. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

DPC: Large Model Alignment Method based on Decoding Probability Correction

DPC: Large Model Alignment Method based on Decoding Probabil...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Huang, Yanyi Liu, Yuying Tian, Lei Zhang, Yue Zhao, Xuechen Zhou, Bin Ma, Guodong School of Computer National University of Defense Technology Changsha China School of Data and Computer Science Shandong Women's University Jinan China

Large language models (LLMs) demonstrate significant generative capabilities but often face ethical alignment and robustness challenges. Conventional alignment methods rely on extensive human-annotated data and require retraining, leading to high computational costs and resource demands. Therefore, we propose a novel approach, Decoding Probability Correction (DPC), that aligns frozen LLMs without additional training or annotated data. DPC dynamically adjusts the probability distribution during inference, ensuring the generated content aligns with human values in real-time. Additionally, DPC incorporates a discriminator-based backtracking mechanism, further enhancing content safety by re-evaluating and refining generation choices. Experimental results on datasets such as the HH and AdvBench show that DPC significantly reduces harmful outputs while maintaining high levels of informativeness and helpfulness. The proposed method offers a cost-effective and efficient solution for enhancing the ethical alignment of LLMs in real-world applications. © 2025 IEEE.

关键词： backtracking mechanism plug-and-play probability correction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：