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

6th International Conference on Intelligent Computing and Signal Processing (ICSP)

作者： Pingfang Tian Deting Liu Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China The Key Laboratory of the Rich Media Knowledge Organisation and Service of Digital Publishing Content Institute of Scientific and Technical Information of China Beijing China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Wuhan China

ISBN: (数字)9798350376548

ISBN: (纸本)9798350376555

Topic shift detection aims to identify whether there is a change in the current topic of conversation or if a change is needed. The study found previous work did not evaluate the performance of large language models like ChatGPT on the task of topic shift. Therefore, this paper's main task and innovation lie in analyzing ChatGPT's performance on topic shift detection. To provide a more comprehensive evaluation, we conducted topic shift detection tasks on ChatGPT from three aspects: single utterances, adjacent utterances, and contextual levels. Additionally, to gauge the performance of large language models, we conducted experiments on multiple small-scale models and compared the results of the two models. Experimental results on the publicly available English TIAGE dataset showed that small-scale models exhibited lower recall in all three aspects, while ChatGPT performed better in the recall. This suggests that compared to small-scale models, large models are more capable of accurately detecting topic shifts. However, large models also exhibited lower precision, indicating that while ChatGPT can recognize content differences in utterances, its judgment on whether these different contents belong to the same topic is poor.

关键词： Technological innovation Large language models Oral communication Signal processing Chatbots Context modeling

来源：评论

学校读者我要写书评

暂无评论

data Stream Classification Based on Extreme Learning Machine: A Review

引用

Big data Research 2022年 30卷

作者： Zheng, Xiulin Li, Peipei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China Mininglamp Academy of Sciences Mininglamp Technology Beijing 100084 China

Many daily applications are generating massive amount of data in the form of stream at an ever higher speed, such as medical data, clicking stream, internet record and banking transaction, etc. In contrast to the traditional static data, data streams are of some inherent properties, to name a few, infinite length, concept drift, multiple labels and concept evolution. Among all the data mining tasks, classification is one of the basic topics in data stream mining and has gained more and more attentions among different research communities. Extreme Learning Machine (ELM) has drawn much interests in data classification due to its high efficiency, universal approximation capability, generalization ability, and simplicity, which have greatly inspired the development of many ELM-based algorithms and their applications during the past decades. In this paper, we mainly provide a comprehensive review on ELM theoretical research and its variants in data stream classification, and categorize these algorithms from different perspectives. Firstly, we briefly introduce the basic principles of ELM and its characteristics. Secondly, we give an overview of different ELM variants to address the particular issues of data stream classification. Thirdly, we present an overview of different strategies to optimize the ELM, which have further improved the stability, accuracy and generalization ability of ELM, and briefly introduce some practical applications of ELM in data stream classification. Finally, we conduct several groups of experiments to compare the performance of ELM based models addressing the focused issues. Also, the open issues and prospects of ELM models used for stream classification are discussed, which are worthwhile to be further studied in the future. © 2022

关键词： Classification data stream Extreme learning machine

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Information Extraction using Large Language Models

arXiv

引用

arXiv 2023年

作者： Han, Ridong Yang, Chaohao Peng, Tao Tiwari, Prayag Wan, Xiang Liu, Lu Wang, Benyou College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China School of Information Technology Halmstad University Sweden

Human-like large language models (LLMs), especially the most powerful and popular ones in OpenAI’s GPT family, have proven to be very helpful for many natural language processing (NLP) related tasks. Therefore, various attempts have been made to apply LLMs to information extraction (IE), which is a fundamental NLP task that involves extracting information from unstructured plain text. To demonstrate the latest representative progress in LLMs’ information extraction ability, we assess the information extraction ability of GPT-4 (the latest version of GPT at the time of writing this paper) from four perspectives: Performance, Evaluation Criteria, Robustness, and Error Types. Our results suggest a visible performance gap between GPT-4 and state-of-the-art (SOTA) IE methods. To alleviate this problem, considering the LLMs’ human-like characteristics, we propose and analyze the effects of a series of simple prompt-based methods, which can be generalized to other LLMs and NLP tasks. Rich experiments show our methods’ effectiveness and some of their remaining issues in improving GPT-4’s information extraction ability. Copyright © 2023, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Learning Group-Disentangled Representation for Interpretable Thoracic Pathologic Prediction

Learning Group-Disentangled Representation for Interpretable...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hao Li Yirui Wu Hexuan Hu Hu Lu Yong Lai Shaohua Wan Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University College of Computer and Information Hohai University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Computer Science and Communication Engineering Jiangsu University Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Deep learning methods have shown significant performance in medical image analysis tasks. However, they generally act like ”black box” without explanations in both feature extraction and decision processes, leading to lack of clinical insights and high risk assessments. To aid deep learning in envisioning diseases with visual clues, we propose Representation Group-Disentangling Network (RGD-Net), which can completely disentangle feature space of input X-ray images into several independent feature groups, each corresponding to a specific disease. Taking several semantically related and labeled X-ray images as input, RGD-Net firstly extracts completely group-disentangled representations of diseases through Group-Disentangle Module, which applies group-swap and linking operations to construct latent space by enforcing semantic consistency of attributes. To prevent learning degenerate representations defined as shortcut problem, we further introduce adversarial constricts on mapping from features to diseases, thus avoiding model collapse with former free-form disentanglement. Experiments on chestxray-14 and ChestXpert datasets demonstrate that RGD-Net are effective in predicting diseases with remarkable advantages, which leverage potential factors contributing to different diseases, thus enhancing interpretability in working patterns of deep learning methods.

关键词： Deep learning Training Visualization Image analysis Semantics Feature extraction Risk management

来源：评论

学校读者我要写书评

暂无评论

Sentiment Analysis of Semester Learning Essays in Design Education

Sentiment Analysis of Semester Learning Essays in Design Edu...

引用

IEEE International Conference on Industrial engineering and engineering Management

作者： Z. H. Wang Z. J. Ming G. X. Wang F. Mistree J. K. Allen School of Mechanical Engineering Beijing Institute of Technology Beijing China Yangtze Delta Region Academy of Beijing Institute of Technology Jiaxing China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing China The Systems Realization Laboratory The University of Oklahoma Norman United States

AME4163: Principles of engineering Design is a design, build and test course offered at the University of Oklahoma, Norman, USA. Throughout the semester students are expected to reflect on authentic and immersive experiences and write Take-aways and Learning Statements. At the end of the semester each student submits a summative Semester Learning Essay. Between 2019–2021 we collected about 10,000 Take-aways and Learning Statements from the Semester Learning Essays of nearly 400 students. In this paper, we attempt to help instructors gain insight of what students have learned through these materials and thence improve the delivery of the course in the future. We analyze their Take-aways from summative Semester Learning Essays by using dictionary-based sentiment analysis to assess students' subjective feelings toward what they have learned. The results prove that we gain insight into their learning thereby providing instructors with evidence-based guidance on modifying the course from different perspectives. The method proposed is generalizable to courses that involve authentic immersive experiences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pre-training for ad-hoc retrieval: Hyperlink is also you need

arXiv

引用

arXiv 2021年

作者： Ma, Zhengyi Dou, Zhicheng Xu, Wei Zhang, Xinyu Jiang, Hao Cao, Zhao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Beijing China Distributed and Parallel Software Lab Huawei Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

Designing pre-training objectives that more closely resemble the downstream tasks for pre-trained language models can lead to better performance at the fine-tuning stage, especially in the ad-hoc retrieval area. Existing pre-training approaches tailored for IR tried to incorporate weak supervised signals, such as query-likelihood based sampling, to construct pseudo query-document pairs from the raw textual corpus. However, these signals rely heavily on the sampling method. For example, the query likelihood model may lead to much noise in the constructed pre-training data. In this paper, we propose to leverage the large-scale hyperlinks and anchor texts to pre-train the language model for ad-hoc retrieval. Since the anchor texts are created by webmasters and can usually summarize the target document, it can help to build more accurate and reliable pre-training samples than a specific algorithm. Considering different views of the downstream ad-hoc retrieval, we devise four pre-training tasks based on the hyperlinks. We then pre-train the Transformer model to predict the pair-wise preference, jointly with the Masked Language Model objective. Experimental results on two large-scale ad-hoc retrieval datasets show the significant improvement of our model compared with the existing methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Hypertext systems

来源：评论

学校读者我要写书评

暂无评论

Group based personalized search by integrating search behaviour and friend network

arXiv

引用

arXiv 2021年

作者： Zhou, Yujia Dou, Zhicheng Wei, Bingzheng Xie, Ruobing Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China School of Information Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

The key to personalized search is to build the user profile based on historical behaviour. To deal with the users who lack historical data, group based personalized models were proposed to incorporate the profiles of similar users when re-ranking the results. However, similar users are mostly found based on simple lexical or topical similarity in search behaviours. In this paper, we propose a neural network enhanced method to highlight similar users in semantic space. Furthermore, we argue that the behaviour-based similar users are still insufficient to understand a new query when user's historical activities are limited. To tackle this issue, we introduce the friend network into personalized search to determine the closeness between users in another way. Since the friendship is often formed based on similar background or interest, there are plenty of personalized signals hidden in the friend network naturally. Specifically, we propose a friend network enhanced personalized search model, which groups the user into multiple friend circles based on search behaviours and friend relations respectively. These two types of friend circles are complementary to construct a more comprehensive group profile for refining the personalization. Experimental results show the significant improvement of our model over existing personalized search models. Copyright © 2021, The Authors. All rights reserved.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

arXiv

引用

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore School of Software Tsinghua University Beijing100084 China College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted, they did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to establish a comprehensive and up-to-date taxonomy of NCO solvers, we systematically review relevant publications and preprints, categorizing them into four distinct types, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we discuss on-going efforts, identify open inadequacies, as well as propose promising and viable directions to overcome these inadequacies. Notably, existing efforts focus on only one or two of these inadequacies, with none attempting to address all of them concurrently. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across VRPs of varying scales. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we aim to foster further advancements in the NCO community. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Article Reranking by Memory-Enhanced key Sentence Matching for Detecting Previously Fact-Checked Claims

arXiv

引用

arXiv 2021年

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021, CC BY-SA.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Survey on Fairness in Large Language Models

arXiv

引用

arXiv 2023年

作者： Li, Yingji Du, Mengnan Song, Rui Wang, Xin Wang, Ying College of Computer Science and Technology Jilin University Changchun130012 China Department of Data Science New Jersey Institute of Technology Newark United States School of Artificial Intelligence Jilin University Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China

Large Language Models (LLMs) have shown powerful performance and development prospects and are widely deployed in the real world. However, LLMs can capture social biases from unprocessed training data and propagate the biases to downstream tasks. Unfair LLM systems have undesirable social impacts and potential harms. In this paper, we provide a comprehensive review of related research on fairness in LLMs. Considering the influence of parameter magnitude and training paradigm on research strategy, we divide existing fairness research into oriented to medium-sized LLMs under pre-training and fine-tuning paradigms and oriented to large-sized LLMs under prompting paradigms. First, for medium-sized LLMs, we introduce evaluation metrics and debiasing methods from the perspectives of intrinsic bias and extrinsic bias, respectively. Then, for large-sized LLMs, we introduce recent fairness research, including fairness evaluation, reasons for bias, and debiasing methods. Finally, we discuss and provide insight on the challenges and future directions for the development of fairness in LLMs. Copyright © 2023, The Authors. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：