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

5th International Conference on Intelligent Computing and Human-computer Interaction, ICHCI 2024

作者： Huang, Guimin Qin, Xiangqian School of Computer Science and Information Security Guilin University of Electronic Technology Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China

ISBN: (纸本)9798350368284

Knowledge Tracing (KT), a technique for modeling students' knowledge levels and predicting their future question-answering performance based on their historical answer data, is one of the key research areas to strengthen the ability of personalized education. In recent years, memory networks have received more and more attention and application in the field of KT, however, the current KT model based on memory networks ignores the effect of students' learning sequence on the level of forgetting, and fails to model the forgetting behavior of students in the process of learning by using the characteristics of time intervals in the interaction data. Therefore, in this paper, we propose a dynamic student classification with forgetting mechanisms on memory networks model (DSCFMN), which enhance the existing model by dynamically classifying students similar to their learning abilities at specified time intervals, incorporating forgetting factors and introducing a weight decay strategy. Experiments show that our model performs well on online education datasets, and the proposed model achieves better prediction results than existing knowledge tracking methods. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Personalized Recommendation Model based on Collaborative Filtering and Federated Learning for Cultural Tourism Attractions in Fujian-Taiwan

A Personalized Recommendation Model based on Collaborative F...

引用

2023 International Conference on Software and System Engineering, ICoSSE 2023

作者： Cai, Yunsen Gao, Haolin Liao, Junkai Li, Xinwei Xu, Yushan Xiong, Jinbo Fujian Normal University College of Computer and Cyber Security Fuzhou350117 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350007 China

ISBN: (纸本)9798350324242

In the era of big data, the explosive growth of cultural tourism information should provide personalized and privacy requirements for people's travel. However, the existing travel recommendation algorithms have some obvious challenges, such as weak personalization, significant cold-start problem, and poor user privacy protection, etc. We propose a personalized intelligent recommendation model and method, which constructs a new collaborative filtering recommendation algorithm based on user characteristics portrait and historical behaviors, and designs an user-attraction data correction model based on federal learning to implement user privacy protection. Furthermore, We fully combine user age, gender, hobbies, and explicit and implicit data feedback to improve the accuracy of the proposed recommendation model. A sufficient experiments have been done on the real Fujian-Taiwan cultural and tourist attractions dataset, and the results show that, the proposed model protects the user's private information and ensures a higher recommendation accuracy. Compared with the traditional collaborative filtering recommendation, it is concluded that the recommended attractions can accurately hit 50%-90% of users' clear travel destinations, and the satisfaction rate of users can reach 77% among the attractions recommended to users outside the expectation, which shows good performance and can be effectively extended to other recommendation systems for cultural tourism attractions from the experimental results. © 2023 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

引用

5th International Conference on Big Data and Artificial Intelligence and Software Engineering, ICBASE 2024

作者： Zhou, Ya Chen, Chen Huang, Guimin Guilin University of Electronic Technology School of Computer Science and Information Security Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China

ISBN: (纸本)9798331506612

In the research methods of sentence similarity, sentence similarity is often calculated from the semantic aspect, while the influence of syntactic structure is ignored. We propose an enhanced knowledge language representation model (ExtKBRCNN) based on CNN and Bi-GRU, which effectively uses the fine-grained word relations in the knowledge base to evaluate semantic similarity and models the relationship between knowledge structure and text structure. In order to make full use of the syntactic information of the sentence, we also propose a dependency tree kernel-based method (Dep-SIF), which combines syntactic information and semantic features to evaluate syntactic similarity. Finally, we propose a comprehensive model that integrates semantic and syntactic information to comprehensively evaluate sentence similarity. Experimental results show that the accuracy of the model on the MRPC dataset is 77.63% and the F1 value is 83.90%. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Genetic-A* Algorithm-Based Routing for Continuous-Flow Microfluidic Biochip in Intelligent Digital Healthcare 18th

Genetic-A* Algorithm-Based Routing for Continuous-Flow Micr...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Huang, Huichang Yang, Zhongliao Zhong, Jiayuan Xu, Li Dong, Chen Bao, Ruishen College of Computer and Data Science Fuzhou University Fuzhou350116 China College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9789819998951

In the field of intelligent digital healthcare, Continuous-flow microfluidic biochip (CFMB) has become a research direction of widespread concern. CFMB integrates a large number of microvalves and large-scale microchannel networks into a single chip, enabling efficient execution of various biochemical protocols. However, as the scale of the chip increases, the routing task for CFMB becomes increasingly complex, and traditional manual routing is no longer sufficient to meet the requirements. Therefore, this paper proposes an automatic routing framework for CFMB based on Genetic algorithm (GA) and A* algorithms. Specifically, we adopt a two-stage A* algorithm to design the routing between modules, using the routing results obtained from the A* algorithm as the basis for evaluating the quality of solutions in the GA algorithm. Then, the GA algorithm is used to search for the optimal approximate solution in the solution space. Experimental results show that this method can reduce routing length and minimize routing crossings, thereby improving the parallel transmission speed of reagents on CFMB. This approach provides a feasible solution for large-scale automated routing of CFMB in the field of intelligent digital healthcare. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Open Set Recognition 38

Multi-Label Open Set Recognition

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Wang, Yi-Bo Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In multi-label learning, each training instance is associated with multiple labels simultaneously. Traditional multi-label learning studies primarily focus on closed set scenario, i.e. the class label set of test data is identical to those used in training phase. Nevertheless, in numerous real-world scenarios, the environment is open and dynamic where unknown labels may emerge gradually during testing. In this paper, the problem of multi-label open set recognition (MLOSR) is investigated, which poses significant challenges in classifying and recognizing instances with unknown labels in multi-label setting. To enable open set multi-label prediction, a novel approach named SLAN is proposed by leveraging sub-labeling information enriched by structural information in the feature space. Accordingly, unknown labels are recognized by differentiating the sub-labeling information from holistic supervision. Experimental results on various datasets validate the effectiveness of the proposed approach in dealing with the MLOSR problem. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A divide-and-conquer reconstruction method for defending against adversarial example attacks

引用

Visual Intelligence 2024年第1期2卷 1-17页

作者： Liu, Xiyao Hu, Jiaxin Yang, Qingying Jiang, Ming He, Jianbiao Fang, Hui School of Computer Science and Engineering Central South University Hunan Changsha 410083 China Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guangxi Guilin China Department of Computer Science Loughborough University Loughborough LE113TU United Kingdom

In recent years, defending against adversarial examples has gained significant importance, leading to a growing body of research in this area. Among these studies, pre-processing defense approaches have emerged as a prominent research direction. However, existing adversarial example pre-processing techniques often employ a single pre-processing model to counter different types of adversarial attacks. Such a strategy may miss the nuances between different types of attacks, limiting the comprehensiveness and effectiveness of the defense strategy. To address this issue, we propose a divide-and-conquer reconstruction pre-processing algorithm via multi-classification and multi-network training to more effectively defend against different types of mainstream adversarial attacks. The premise and challenge of the divide-and-conquer reconstruction defense is to distinguish between multiple types of adversarial attacks. Our method designs an adversarial attack classification module that exploits the high-frequency information differences between different types of adversarial examples for their multi-classification, which can hardly be achieved by existing adversarial example detection methods. In addition, we construct a divide-and-conquer reconstruction module that utilizes different trained image reconstruction models for each type of adversarial attack, ensuring optimal defense effectiveness. Extensive experiments show that our proposed divide-and-conquer defense algorithm exhibits superior performance compared to state-of-the-art pre-processing methods. © The Author(s) 2024.

关键词： Adversarial attack multi-classification Adversarial example defense Divide-and-conquer strategy Reconstruction network

来源：评论

学校读者我要写书评

暂无评论

SEAVER: Attention Reallocation for Mitigating Distractions in Language Models for Conditional Semantic Textual Similarity Measurement

SEAVER: Attention Reallocation for Mitigating Distractions i...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Baixuan Fan, Yunlong Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9798891761681

Conditional Semantic Textual Similarity (C-STS) introduces specific limiting conditions to the traditional Semantic Textual Similarity (STS) task, posing challenges for STS models. Language models employing cross-encoding demonstrate satisfactory performance in STS, yet their effectiveness significantly diminishes in C-STS. In this work, we argue that the failure is due to the fact that the redundant information in the text distracts language models from the required condition-relevant information. To alleviate this, we propose SElf-Augmentation Via SElf-Reweighting (SEAVER), which, based solely on models' internal attention and without the need for external auxiliary information, adaptively reallocates the model's attention weights by emphasizing the importance of condition-relevant tokens. On the C-STS-2023 test set, SEAVER consistently improves performance of all million-scale fine-tuning baseline models (up to around 3 points), and even surpasses performance of billion-scale few-shot prompted large language models (such as GPT-4). Our code is available at https://***/BaixuanLi/SEAVER. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Binary Decomposition: A Problem Transformation Perspective for Open-Set Semi-Supervised Learning 41

Binary Decomposition: A Problem Transformation Perspective f...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Semi-supervised learning (SSL) is a classical machine learning paradigm dealing with labeled and unlabeled data. However, it often suffers performance degradation in real-world open-set scenarios, where unlabeled data contains outliers from novel categories that do not appear in labeled data. Existing studies commonly tackle this challenging open-set SSL problem with detect-and-filter strategy, which attempts to purify unlabeled data by detecting and filtering outliers. In this paper, we propose a novel binary decomposition strategy, which refrains from error-prone procedure of outlier detection by directly transforming the original open-set SSL problem into a number of standard binary SSL problems. Accordingly, a concise yet effective approach named BDMatch is presented. BDMatch confronts two attendant issues brought by binary decomposition, i.e. class-imbalance and representation-compromise, with adaptive logit adjustment and label-specific feature learning respectively. Comprehensive experiments on diversified benchmarks clearly validate the superiority of BDMatch as well as the effectiveness of our binary decomposition strategy. Copyright 2024 by the author(s)

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A New HARQ Scheme for 5G Systems via Interleaved Superposition Retransmission

引用

China Communications 2023年第4期20卷 1-11页

作者： Qianfan Wang Li Chen Xiao Ma School of Computer Science and Engineering Guangdong Key Laboratory of Information Security TechnologySun Yat-sen UniversityGuangzhou 510006China College of Computer Science Jiaying UniversityMeizhou 514015China School of Electronics and Information Technology Sun Yat-sen UniversityGuangzhou 510006China

Within the framework of the 5G new radio(NR),we propose a new hybrid automatic repeat request(HARQ)scheme to improve the throughput *** difference between the proposed scheme and the conventional one lies in the first retransmission,where the erroneous coded block group is interleaved and superimposed(XORed)onto a fresh coded block *** the receiver,an iterative message-passing decoding algorithm can be employed to recover the target erroneous code block group(CBG).Only when the superposed retransmission fails,the conventional incremental redundancy(IR)or repetition redundancy(RR)retransmission is *** any case,since the first retransmission is along with but has negligible effect on the fresh CBG,it costs neither transmitted power nor ***-Carlo simulation results reveal that the presented HARQ schemes can achieve throughput improvements up to 10%over block fading channels and up to 50%over fast fading channels in comparison with the original 5G CBG-level HARQ scheme but without excessively increasing the implementation complexity.

关键词： 5G NR HARQ LDPC codes superposition retransmission

来源：评论

学校读者我要写书评

暂无评论

Resource Binding and Module Placement Algorithms for Continuous-Flow Microfluidic Biochip in Intelligent Digital Healthcare 18th

Resource Binding and Module Placement Algorithms for Conti...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Yang, Zhongliao Huang, Huichang Liu, Zeyi Dong, Chen Xu, Li College of Computer and Data Science Fuzhou University Fuzhou350116 China College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9789819998951

Continuous-Flow Microfluidic Biochip (CFMB), with their integrated features, bring traditional biochemical experiments on a single chip to accomplish complex operations and reactions through precise control, efficient reactions and emerging ways of saving reagents. In the field of intelligent digital healthcare, CFMB have attracted a lot of attention. However, traditional manual design schemes can no longer meet the needs of increasingly complex chip architecture design. Therefore, this paper proposes an automated design method for resource binding and module placement of CFMB based on a list scheduling algorithm and an improved Simulated Annealing algorithm. Through the resource binding and scheduling design based on the list scheduling algorithm, an effective scheduling strategy is generated, which effectively improves the biochip execution efficiency. In addition, the improved Simulated Annealing algorithm solves the module placement problem in the biochip in a limited physical space. Compared with some benchmark algorithms, the experimental results demonstrate the effectiveness of the method in the biochip design process and provide a practical framework for further development of CFMB in the field of intelligent digital healthcare. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Biochips

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：