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

arXiv 2022年

作者： Zhang, Kai Zhang, Kun Liu, Qi Huang, Zhenya Zhang, Mengdi Wu, Wei Cheng, Mingyue Chen, Enhong Anhui Province Key Lab. of Big Data Analysis and Application University of S&T of China State Key Laboratory of Cognitive Intelligence Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Meituan Beijing China Anhui Province Key Lab. of Big Data Analysis and Application University of S&T of China Hefei China

Cross-domain sentiment classification (CDSC) aims to use the transferable semantics learned from the source domain to predict the sentiment of reviews in the unlabeled target domain. Existing studies in this task attach more attention to the sequence modeling of sentences while largely ignoring the rich domain-invariant semantics embedded in graph structures (i.e., the part-of-speech tags and dependency relations). As an important aspect of exploring characteristics of language comprehension, adaptive graph representations have played an essential role in recent years. To this end, in the paper, we aim to explore the possibility of learning invariant semantic features from graph-like structures in CDSC. Specifically, we present Graph Adaptive Semantic Transfer (GAST) model, an adaptive syntactic graph embedding method that is able to learn domain-invariant semantics from both word sequences and syntactic graphs. More specifically, we first raise a POS-Transformer module to extract sequential semantic features from the word sequences as well as the part-of-speech tags. Then, we design a Hybrid Graph Attention (HGAT) module to generate syntax-based semantic features by considering the transferable dependency relations. Finally, we devise an Integrated aDaptive Strategy (IDS) to guide the joint learning process of both modules. Extensive experiments on four public datasets indicate that GAST achieves comparable effectiveness to a range of state-of-the-art models. © 2022, CC BY.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework for Tumor Prognostic Prediction 39

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： An, Yajun Chen, Jiale Lin, Huan Liu, Zhenbing Feng, Siyang Zhang, Hualong Lan, Rushi Liu, Zaiyi Pan, Xipeng School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China School of Artificial Intelligence and Big Data Chongqing College of Finance and Economics Chongqing402160 China Southern Medical University Guangzhou510080 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin541004 China Guangdong Provincial Key Laboratory of Artificial Intelligence in Medical Image Analysis and Application Guangzhou510080 China

ISBN: (纸本)157735897X

Cancer is a leading cause of death worldwide due to its aggressive nature and complex variability. Accurate prognosis is therefore challenging but essential for guiding personalized treatment and follow-up. Previous research often relied on single data sources, missing the opportunity to combine various types of patient information for more comprehensive survival predictions. To address these challenges, we propose a two-stage fusion method named Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework (CA-MLIF). In the first stage, we propose a CA mechanism for real-time feature updates and cross-modal mutual learning to capture rich semantic information. In the second stage, we design a novel multimodal low-rank interaction fusion method for survival prediction. Specifically, we present modal attention mechanism (MAM) for feature filtration, low-rank multimodal fusion (LMF) for model complexity reduction, and optimal weight concatenation (OWC) for maximizing feature integration. Extensive experiments on two public datasets TCGA-GBMLGG and TCGA-KIRC, as well as a multi-center in-house lung adenocarcinoma (LUAD) dataset validate the effectiveness of CA-MLIF, which demonstrate that our method outperforms existing approaches in survival prediction under both pathology-gene fusion and CT-pathology fusion scenarios. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Learning to rank

来源：评论

学校读者我要写书评

暂无评论

Hierarchical graph transformer with adaptive node sampling 22

Hierarchical graph transformer with adaptive node sampling

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Zaixi Zhang Qi Liu Qingyong Hu Chee-Kong Lee Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China and State Key Laboratory of Cognitive Intelligence Hefei Anhui China Hong Kong University of Science and Technology Tencent America

ISBN: (纸本)9781713871088

The Transformer architecture has achieved remarkable success in a number of domains including natural language processing and computer vision. However, when it comes to graph-structured data, transformers have not achieved competitive performance, especially on large graphs. In this paper, we identify the main deficiencies of current graph transformers: (1) Existing node sampling strategies in Graph Transformers are agnostic to the graph characteristics and the training process. (2) Most sampling strategies only focus on local neighbors and neglect the long-range dependencies in the graph. We conduct experimental investigations on synthetic datasets to show that existing sampling strategies are sub-optimal. To tackle the aforementioned problems, we formulate the optimization strategies of node sampling in Graph Transformer as an adversary bandit problem, where the rewards are related to the attention weights and can vary in the training procedure. Meanwhile, we propose a hierarchical attention scheme with graph coarsening to capture the long-range interactions while reducing computational complexity. Finally, we conduct extensive experiments on real-world datasets to demonstrate the superiority of our method over existing graph transformers and popular GNNs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Wang, Tianfu Shen, Li Fan, Qilin Xu, Tong Liu, Tongliang Xiong, Hui Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science University of Science and Technology of China Hefei230027 China The School of Big Data and Software Engineering Chongqing University ChinaScience Chongqing401331 China JD Explore Academy The UBTECH Sydney Artificial Intelligence Centre The School of Information Technologies Faculty of Engineering and Information Technologies The University of Sydney DarlingtonNSW2008 Australia Thrust of Artificial Intelligence Nansha Guangdong Guangzhou511400 China The Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

As an essential resource management problem in network virtualization, virtual network embedding (VNE) aims to allocate the finite resources of physical network to sequentially arriving virtual network requests (VNRs) with different resource demands. Since this is an NP-hard combinatorial optimization problem, many efforts have been made to provide viable solutions. However, most existing approaches have either ignored the admission control of VNRs, which has a potential impact on long-term performances, or not fully exploited the temporal and topological features of the physical network and VNRs. In this paper, we propose a deep Hierarchical Reinforcement Learning approach to learn a joint Admission Control and Resource Allocation policy for VNE, named HRL-ACRA. Specifically, the whole VNE process is decomposed into an upper-level policy for deciding whether to admit the arriving VNR or not and a lower-level policy for allocating resources of the physical network to meet the requirement of VNR through the HRL approach. Considering the proximal policy optimization as the basic training algorithm, we also adopt the average reward method to address the infinite horizon problem of the upper-level agent and design a customized multi-objective intrinsic reward to alleviate the sparse reward issue of the lower-level agent. Moreover, we develop a deep feature-aware graph neural network to capture the features of VNR and physical network and exploit a sequence-to-sequence model to generate embedding actions iteratively. Finally, extensive experiments are conducted in various settings, and show that HRL-ACRA outperforms state-of-the-art baselines in terms of both the acceptance ratio and long-term average revenue. Our code is available at https://***/GeminiLight/hrl-acra. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

STAN: Adversarial Network for Cross-domain Question Difficulty Prediction

STAN: Adversarial Network for Cross-domain Question Difficul...

引用

IEEE International Conference on data Mining (ICDM)

作者： Ye Huang Wei Huang Shiwei Tong Zhenya Huang Qi Liu Enhong Chen Jianhui Ma Liang Wan Shijin Wang Anhui Province Key Laboratory of Big Data Analysis and Application School of Data Science & School of Computer Science and Technology University of Science and Technology of China iFLYTEK Research iFLYTEK CO. LTD

ISBN: (纸本)9781665423991

In intelligent education systems, question difficulty prediction (QDP) is a fundamental task of many applications, such as personalized question recommendation and test paper analysis. Previous work mainly focus on data-driven QDP methods, which are heavily relied on the large-scale labeled dataset of courses. To alleviate the labor intensity, an intuitive method is to introduce domain adaptation into QDP and consider each course as a domain. In educational psychology, there are two factors influencing difficulty common to different courses: the obstacles of comprehending the question and generating a response, namely stimulus and task difficulty. To this end, we propose a novel Stimulus and Task difficulty-based Adversarial Network (STAN) that models question difficulty from the views of stimulus and task. Then, in order to align the difficulty distribution of the source domain and the target domain, we utilize the conditional adversarial learning with readability-enhanced pseudo-labels. Meanwhile, we proposed a sampling method based on density estimation to implicit alignment. Finally, we conduct experiments on the real questions datasets to evaluate the effectiveness of our QDP model and domain adaptation method. Our method significantly improves accuracy over state-of-the-art methods on real-world question data of multiple courses.

关键词： Adaptation models Conferences Education Psychology Estimation Sampling methods Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Technological Knowledge Flow Forecasting through A Hierarchical Interactive Graph Neural Network

Technological Knowledge Flow Forecasting through A Hierarchi...

引用

IEEE International Conference on data Mining (ICDM)

作者： Huijie Liu Han Wu Le Zhang Runlong Yu Ye Liu Chunli Liu Qi Liu Enhong Chen Anhui Province Key Laboratory of Big Data Analysis and Application School of Data Science & School of Computer Science and Technology University of Science and Technology of China School of Management Hefei University of Technology China

ISBN: (纸本)9781665423991

With the accelerated technology development, technological trend forecasting through patent mining has become a hot issue for high-tech companies. In this term, extensive attention has been attracted to forecasting technological knowledge flows (TKF), i.e., predicting the directional flows of knowledge from one technological field to another. However, existing studies either rely on labor intensive empirical analysis or do not consider the intrinsic characteristics inherent in TKF, including the double-faced aspects (i.e., act as both the source and target) of technology nodes, multiple complex relationships among different technologies, and dynamics of the TKF process. To this end, in this paper, we make a further study and propose a data-driven solution, i.e., a Hierarchical Interactive Graph Neural Network (HighTKF), to automatically find the potential flow trends of technologies. Specifically, HighTKF makes final predictions through two kinds of representations of each technology node (a diffusion vector and an absorption vector), which is realized by three components: High-Order Interaction Module (HOI), Hierarchical Delivery Module (HD) and Technology Flow Tracing Module (TFT). For one thing, HOI and HD aim to model high-order network relationships and hierarchical relationships among technologies. For another, TFT is designed for capturing the dynamic feature evolution of technologies with the above relations involved. Also, we design a hybrid loss function and propose a new evaluation metric for better predicting the unprecedented flows between technologies. Finally, we conduct extensive experiments on a real-world patent dataset, the results verify the effectiveness of our approach and reveal some interesting phenomenons on technological knowledge flow trends.

关键词： Measurement Knowledge engineering Patents databases Predictive models Market research Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Towards the Identifiability and Explainability for Personalized Learner Modeling: An Inductive Paradigm

arXiv

引用

arXiv 2023年

作者： Li, Jiatong Liu, Qi Wang, Fei Liu, Jiayu Huang, Zhenya Yao, Fangzhou Zhu, Linbo Su, Yu Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China School of Computer Science and Technology University of Science and Technology of China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China Hefei Normal University Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China

Personalized learner modeling using cognitive diagnosis (CD), which aims to model learners’ cognitive states by diagnosing learner traits from behavioral data, is a fundamental yet significant task in many web learning services. Existing cognitive diagnosis models (CDMs) follow the proficiency-response paradigm that views learner traits and question parameters as trainable embeddings and learns them through learner performance prediction. However, we notice that this paradigm leads to the inevitable non-identifiability and explainability overfitting problem, which is harmful to the quantification of learners’ cognitive states and the quality of web learning services. To address these problems, we propose an identifiable cognitive diagnosis framework (ID-CDF) based on a novel response-proficiency-response paradigm inspired by encoder-decoder models. Specifically, we first devise the diagnostic module of ID-CDF, which leverages inductive learning to eliminate randomness in optimization to guarantee identifiability and captures the monotonicity between overall response data distribution and cognitive states to prevent explainability overfitting. Next, we propose a flexible predictive module for ID-CDF to ensure diagnosis preciseness. We further present an implementation of ID-CDF, i.e., ID-CDM, to illustrate its usability. Extensive experiments on four real-world datasets with different characteristics demonstrate that ID-CDF can effectively address the problems without loss of diagnosis preciseness. Our code is available at https://***/CSLiJT/ID-CDF. Copyright © 2023, The Authors. All rights reserved.

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

Consistency-aware Multi-modal Network for Hierarchical Multi-label Classification in Online Education System

Consistency-aware Multi-modal Network for Hierarchical Multi...

引用

IEEE International Conference on Big Knowledge (ICBK)

作者： Siqi Lei Wei Huang Shiwei Tong Qi Liu Zhenya Huang Enhong Chen Yu Su Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China iFLYTEK Research iFLYTEK Co. Ltd

ISBN: (纸本)9781665438599

In the online education system, predicting the knowledge of exercises is a fundamental task of many applications, such as cognitive diagnosis. Usually, experts consider this problem as Hierarchical Multi-label Classification (HMC), since the knowledge concepts exhibit a multi-level structure. However, existing methods either sacrificed knowledge consistency for classification accuracy or sacrificed classification accuracy for knowledge consistency. Maintaining the balance is difficult. To forgo this dilemma, in this paper, we develop a novel frame-work called Consistency-Aware Multi-modal Network (Cam-Net). Specifically, we develop a multi-modal embedding module to learn the representation of the multi-modal exercise. Then, we adopt a hybrid prediction method consisting of the flat prediction module and the local prediction module. The local prediction module deals with the relation between the knowledge hierarchy and the input exercise. The flat prediction module focuses on maintaining knowledge consistency. Finally, to balance classification accuracy and knowledge consistency, we combine the outputs of two modules to make a final prediction. Extensive experimental results on two real-world datasets demonstrate the high performance and the ability to reduce knowledge inconsistency of CamNet.

关键词： Knowledge engineering Conferences Education Prediction methods Task analysis

来源：评论

学校读者我要写书评

暂无评论

Quality meets diversity: A model-agnostic framework for computerized adaptive testing

arXiv

引用

arXiv 2021年

作者： Bi, Haoyang Ma, Haiping Huang, Zhenya Yin, Yu Liu, Qi Chen, Enhong Su, Yu Wang, Shijin Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China Anhui University China IFLYTEK Research

computerized Adaptive Testing (CAT) is emerging as a promising testing application in many scenarios, such as education, game and recruitment, which targets at diagnosing the knowledge mastery levels of examinees on required concepts. It shows the advantage of tailoring a personalized testing procedure for each examinee, which selects questions step by step, depending on her performance. While there are many efforts on developing CAT systems, existing solutions generally follow an inflexible model-specific fashion. That is, they need to observe a specific cognitive model which can estimate examinee’s knowledge levels and design the selection strategy according to the model estimation. In this paper, we study a novel model-agnostic CAT problem, where we aim to propose a flexible framework that can adapt to different cognitive models. Meanwhile, this work also figures out CAT solution with addressing the problem of how to generate both high-quality and diverse questions simultaneously, which can give a comprehensive knowledge diagnosis for each examinee. Inspired by Active Learning, we propose a novel framework, namely Model-Agnostic Adaptive Testing (MAAT) for CAT solution, where we design three sophisticated modules including Quality Module, Diversity Module and Importance Module. Specifically, at one CAT selection step, Quality Module first quantifies the informativeness of questions and generates candidate subset with the highest quality. Then, Diversity Module selects one question at each step that maximizes the concept coverage. Additionally, we propose Importance Module to estimate the importance of concepts that optimizes the CAT selection. Under MAAT, we prove that the goal of maximizing both quality and diversity is NP-hard, but we provide efficient algorithms by exploiting the inherent submodular property. Extensive experimental results on two real-world datasets clearly demonstrate that our MAAT can support CAT with guaranteeing both quality and diversity

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Towards Variable-Length Textual Adversarial Attacks

arXiv

引用

arXiv 2021年

作者： Guo, Junliang Zhang, Zhirui Zhang, Linlin Xu, Linli Chen, Boxing Chen, Enhong Luo, Weihua Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China Alibaba DAMO Academy Zhejiang University China

Adversarial attacks have shown the vulnerability of machine learning models, however, it is non-trivial to conduct textual adversarial attacks on natural language processing tasks due to the discreteness of data. Most previous approaches conduct attacks with the atomic replacement operation, which usually leads to fixed-length adversarial examples and therefore limits the exploration on the decision space. In this paper, we propose variable-length textual adversarial attacks (VL-Attack) and integrate three atomic operations, namely insertion, deletion and replacement, into a unified framework, by introducing and manipulating a special blank token while attacking. In this way, our approach is able to more comprehensively find adversarial examples around the decision boundary and effectively conduct adversarial attacks. Specifically, our method drops the accuracy of IMDB classification by 96% with only editing 1.3% tokens while attacking a pre-trained BERT model. In addition, fine-tuning the victim model with generated adversarial samples can improve the robustness of the model without hurting the performance, especially for length-sensitive models. On the task of non-autoregressive machine translation, our method can achieve 33.18 BLEU score on IWSLT14 German-English translation, achieving an improvement of 1.47 over the baseline model. Copyright © 2021, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：