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

Advances and challenges in artificial intelligence text generation

Frontiers of information Technology & Electronic Engineering 2024年第1期25卷 64-83页

作者： Bing LI Peng YANG Yuankang SUN Zhongjian HU Meng YI School of Computer Science and Engineering Southeast UniversityNanjing 210000China Key Laboratory of Computer Network and Information Integration Ministry of EducationSoutheast UniversityNanjing 210000China

Text generation is an essential research area in artificial intelligence(AI)technology and natural language processing and provides key technical support for the rapid development of AI-generated content(AIGC).It is based on technologies such as natural language processing,machine learning,and deep learning,which enable learning language rules through training models to automatically generate text that meets grammatical and semantic *** this paper,we sort and systematically summarize the main research progress in text generation and review recent text generation papers,focusing on presenting a detailed understanding of the technical *** addition,several typical text generation application systems are ***,we address some challenges and future directions in AI text *** conclude that improving the quality,quantity,interactivity,and adaptability of generated text can help fundamentally advance AI text generation development.

关键词： AI text generation Natural language processing Machine learning Deep learning

来源：评论

学校读者我要写书评

暂无评论

Inaccurate Label Distribution Learning with Dependency Noise

arXiv

引用

arXiv 2024年

作者： Kou, Zhiqiang Wang, Jing Jia, Yuheng Geng, Xin MOE Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering Southeast University Nanjing China

In this paper, we introduce the Dependent Noise-based Inaccurate Label Distribution Learning (DN-ILDL) framework to tackle the challenges posed by noise in label distribution learning, which arise from dependencies on instances and labels. We start by modeling the inaccurate label distribution matrix as a combination of the true label distribution and a noise matrix influenced by specific instances and labels. To address this, we develop a linear mapping from instances to their true label distributions, incorporating label correlations, and decompose the noise matrix using feature and label representations, applying group sparsity constraints to accurately capture the noise. Furthermore, we employ graph regularization to align the topological structures of the input and output spaces, ensuring accurate reconstruction of the true label distribution matrix. Utilizing the Alternating Direction Method of Multipliers (ADMM) for efficient optimization, we validate our method's capability to recover true labels accurately and establish a generalization error bound. Extensive experiments demonstrate that DN-ILDL effectively addresses the ILDL problem and outperforms existing LDL methods. © 2024, CC BY.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Multi-instance partial-label learning: towards exploiting dual inexact supervision

引用

Science China(information Sciences) 2024年第3期67卷 48-61页

作者： Wei TANG Weijia ZHANG Min-Ling ZHANG School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education School of Information and Physical Sciences The University of Newcastle

Weakly supervised machine learning algorithms are able to learn from ambiguous samples or labels, e.g., multi-instance learning or partial-label learning. However, in some real-world tasks, each training sample is associated with not only multiple instances but also a candidate label set that contains one groundtruth label and some false positive labels. Specifically, at least one instance pertains to the ground-truth label while no instance belongs to the false positive labels. In this paper, we formalize such problems as multi-instance partial-label learning(MIPL). Existing multi-instance learning algorithms and partial-label learning algorithms are suboptimal for solving MIPL problems since the former fails to disambiguate a candidate label set, and the latter cannot handle a multi-instance bag. To address these issues, a tailored algorithm named MIPLGP, i.e., multi-instance partial-label learning with Gaussian processes, is *** first assigns each instance with a candidate label set in an augmented label space, then transforms the candidate label set into a logarithmic space to yield the disambiguated and continuous labels via an exclusive disambiguation strategy, and last induces a model based on the Gaussian processes. Experimental results on various datasets validate that MIPLGP is superior to well-established multi-instance learning and partial-label learning algorithms for solving MIPL problems.

关键词： machine learning multi-instance partial-label learning multi-instance learning partial-label learning Gaussian processes

来源：评论

学校读者我要写书评

暂无评论

Length matters:Scalable fast encrypted internet traffic service classification based on multiple protocol data unit length sequence with composite deep learning

引用

Digital Communications and networks 2022年第3期8卷 289-302页

作者： Zihan Chen Guang Cheng Ziheng Xu Shuyi Guo Yuyang Zhou Yuyu Zhao School of Cyber Science and Engineering Southeast UniversityNanjing211189China Key Laboratory of Computer Network and Information Integration Ministry of EducationNanjing211189China Purple Mountain Laboratories Nanjing211111China

As an essential function of encrypted Internet traffic analysis,encrypted traffic service classification can support both coarse-grained network service traffic management and security ***,the traditional plaintext-based Deep Packet Inspection(DPI)method cannot be applied to such a ***,machine learning-based existing methods encounter two problems during feature selection:complex feature overcost processing and Transport Layer Security(TLS)version *** this paper,we consider differences between encryption network protocol stacks and propose a composite deep learning-based method in multiprotocol environments using a sliding multiple Protocol Data Unit(multiPDU)length sequence as features by fully utilizing the Markov property in a multiPDU length sequence and maintaining suitability with a TLS-1.3 *** experiments show that both Length-Sensitive(LS)composite deep learning model using a capsule neural network and LS-long short time memory achieve satisfactory effectiveness in F1-score and *** to faster feature extraction,our method is suitable for actual network environments and superior to state-of-the-art methods.

关键词： Encrypted internet traffic Encrypted traffic service classification Multi PDU length sequence Length sensitive composite deep learning TLS-1.3

来源：评论

学校读者我要写书评

暂无评论

Contract-Based Incentive Mechanisms for UAV networks in Covert Communications

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 7378-7391页

作者： Tian, Wen Fan, Hao Liu, Guangjie Du, Miao Liu, Yinqiu Niyato, Dusit Han, Zhu Nanjing University of Information Science and Technology School of Electronic and Information Engineering Nanjing University of Information Science and Technology Key Laboratory of Intelligent Support Technology In Complex Environment Ministry of Education Nanjing210044 China Southeat University School of Computer Science and Engineering China Southeast University Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

Covert communication is considered a promising technology for hiding transmission processes and activities from malicious eavesdropping. With the development of detection technology, the traditional point-to-point covert communication method cannot effectively guarantee the reliability of covert communication. In order to solve this problem, unmanned aerial vehicle (UAV) are widely adopted in covert communication as common relay equipment. However, the UAV maximizes its benefits by taking advantage of the information asymmetry between itself and the covert communication sender. Therefore, it is necessary to encourage UAV-assisted potential users (UPU) to transmit covert data honestly by designing an information asymmetry-based incentive mechanism. In this paper, we propose a UAV-assisted contract-theoretic (UACT) model to improve the covert communication performance, where UPU honestly transmits covert data and the throughput of UACT can be increased. Specifically, we first divide UPU into finite types and model the data transfer contract between the sender, UPU, and receiver. Then, the contract feasibility of UACT is derived with sufficient and necessary conditions. Finally, we analyze the contract optimization in the continuous case of UPUs. Numerical simulations show that the UACT can incentivize UPUs to transmit covert data through UAV assistance and make covert communication performance close to the information symmetry case. © 1967-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Learning Label Shift Correction for Test-Agnostic Long-Tailed Recognition 41

Learning Label Shift Correction for Test-Agnostic Long-Taile...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wei, Tong Mao, Zhen Zhou, Zi-Hao Wan, Yuanyu Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China School of Software Technology Zhejiang University Ningbo China

Long-tail learning primarily focuses on mitigating the label distribution shift between long-tailed training data and uniformly distributed test data. However, in real-world applications, we often encounter a more intricate challenge where the test label distribution is agnostic. To address this problem, we first theoretically establish the substantial potential for reducing the generalization error if we can precisely estimate the test label distribution. Motivated by the theoretical insight, we introduce a simple yet effective solution called label shift correction (LSC). LSC estimates the test label distribution within the proposed framework of generalized black box shift estimation, and adjusts the predictions from a pre-trained model to align with the test distribution. Theoretical analyses confirm that accurate estimation of test label distribution can effectively reduce the generalization error. Extensive experimental results demonstrate that our method significantly outperforms previous state-of-the-art approaches, especially when confronted with non-uniform test label distribution. Notably, the proposed method is general and complements existing long-tail learning approaches, consistently improving their performance. The source code is available at https://***/Stomach-ache/label-shift-correction. Copyright 2024 by the author(s)

关键词： Black-box testing

来源：评论

学校读者我要写书评

暂无评论

LASS: A Novel and Economical Data Augmentation Framework Based on Language Models for Debiasing Opinion Summarization 31

LASS: A Novel and Economical Data Augmentation Framework Bas...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Yanyue Li, Pengfei Lai, Yilong He, Yulan Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of Informatics King's College London United Kingdom The Alan Turing Institute United Kingdom

ISBN: (纸本)9798891761964

As more than 70% of reviews in the existing opinion summary data set are positive, current opinion summarization approaches are hesitant to generate negative summaries given the input of negative texts. To address such sentiment bias, a direct approach without the reliance on a specific structure is to generate additional data based on large language models to balance the emotional distribution of the dataset. However, large-scale data augmentation based on large language models faces an apparent disadvantage, the expensive costs. Therefore, in this paper, we propose LASS, a novel data augmentation framework based on both LArge and Small language models for debiaSing opinion summarization. Specifically, a small number of synthesized negative reviews is obtained by rewriting the positive text via a large language model. Then, a disentangle reconstruction model is trained based on the generated data. After training, a large amount of synthetic data can be obtained by decoding the new representation obtained from the combination of different sample representations and filtering based on perplexity degree and sentiment classification. Experiments have proved that LASS can effectively alleviate emotional bias, similar to using only large models, but in a more economical way. © 2025 Association for Computational Linguistics.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional Classification via Selective Feature Augmentation

引用

Machine Intelligence Research 2022年第1期19卷 38-51页

作者： Bin-Bin Jia Min-Ling Zhang School of Computer Science and Engineering Southeast UniversityNanjing 210096China College of Electrical and Information Engineering Lanzhou University of TechnologyLanzhou 730050China Key Laboratory of Computer Network and Information Integration Southeast UniversityMinistry of EducationChina

In multi-dimensional classification(MDC), the semantics of objects are characterized by multiple class spaces from different dimensions. Most MDC approaches try to explicitly model the dependencies among class spaces in output space. In contrast, the recently proposed feature augmentation strategy, which aims at manipulating feature space, has also been shown to be an effective solution for MDC. However, existing feature augmentation approaches only focus on designing holistic augmented features to be appended with the original features, while better generalization performance could be achieved by exploiting multiple kinds of augmented *** this paper, we propose the selective feature augmentation strategy that focuses on synergizing multiple kinds of augmented ***, by assuming that only part of the augmented features is pertinent and useful for each dimension′s model induction, we derive a classification model which can fully utilize the original features while conduct feature selection for the augmented features. To validate the effectiveness of the proposed strategy, we generate three kinds of simple augmented features based on standard k NN, weighted k NN, and maximum margin techniques, respectively. Comparative studies show that the proposed strategy achieves superior performance against both state-of-the-art MDC approaches and its degenerated versions with either kind of augmented features.

关键词： Machine learning multi-dimensional classification feature augmentation feature selection class dependencies

来源：评论

学校读者我要写书评

暂无评论

Intelligent Optimization Method for Mobile NOMA network using IMBO 6

Intelligent Optimization Method for Mobile NOMA Network usin...

引用

6th IEEE International Conference on Electronic information and Communication Technology, ICEICT 2023

作者： Fu, Xingyue Xu, Lingwei Gao, Zhihe Chen, Zhe Li, Yufang Cao, Shubo Qingdao University of Science & Technology Qingdao China Southeast University Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing211189 China

ISBN: (纸本)9798350399059

Non-orthogonal multiple access (NOMA) technology can significantly increase access volume and spectrum efficiency. The introduction of NOMA technology into the mobile communication system can significantly enhance communication performance. The power allocation technology can greatly improve the performance of NOMA systems and has become a research hotspot. However, many research schemes currently have many problems, such as poor system performance and inability to balance between user fairness and service quality. Therefore, this article studies the intelligent optimization for mobile NOMA network using improved Monarch Butterfly Optimization Algorithm(IMBO). First, an N-Nakagami channel-based mobile cooperative NOMA multi-user network is established. Then, considering the non-ideal communication condition, namely imperfect channel state information (ICSI), the exact expressions of outage probability (OP) for the mobile cooperative NOMA multi-user communication system are derived, and the relation between user power allocation coefficient and the performance of OP is investigated. Finally, an optimization algorithm of power allocation based on the IMBO is put forward, which can get the optimal power allocation coefficient. Simulation results indicate that, compared to the monarch butterfly optimization algorithm(MBO), the artificial fish swarm algorithm(AFSA), and the firefly algorithm(FA), the IMBO is at least 30% more efficient, thereby enhancing the performance of the communication system. © 2023 IEEE.

关键词： Spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

Long-Tail Learning with Foundation Model: Heavy Fine-Tuning Hurts 41

Long-Tail Learning with Foundation Model: Heavy Fine-Tuning ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Shi, Jiang-Xin Wei, Tong Zhou, Zhi Shao, Jie-Jing Han, Xin-Yan Li, Yu-Feng National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China School of Computer Science and Engineering Southeast University China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

The fine-tuning paradigm in addressing long-tail learning tasks has sparked significant interest since the emergence of foundation models. Nonetheless, how fine-tuning impacts performance in long-tail learning was not explicitly quantified. In this paper, we disclose that heavy fine-tuning may even lead to non-negligible performance deterioration on tail classes, and lightweight fine-tuning is more effective. The reason is attributed to inconsistent class conditions caused by heavy fine-tuning. With the observation above, we develop a low-complexity and accurate long-tail learning algorithms LIFT with the goal of facilitating fast prediction and compact models by adaptive lightweight fine-tuning. Experiments clearly verify that both the training time and the learned parameters are significantly reduced with more accurate predictive performance compared with state-of-the-art approaches. The implementation code is available at https://***/shijxcs/LIFT. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：