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

arXiv 2024年

作者： Guo, Tianlin Zhang, Lingling Wang, Jiaxin Lei, Yunkuo Li, Yifei Wang, Haofen Liu, Jun School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China School of Computer Science and Technology Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi’an710049 China College of Design and Innovation Tongji University Shanghai200092 China

Few-shot relation extraction with none-of-the-above (FsRE with NOTA) aims at predicting labels in few-shot scenarios with unknown classes. FsRE with NOTA is more challenging than the conventional few-shot relation extraction task, since the boundaries of unknown classes are complex and difficult to learn. Meta-learning based methods, especially prototype-based methods, are the mainstream solutions to this task. They obtain the classification boundary by learning the sample distribution of each class. However, their performance is limited because few-shot overfitting and NOTA boundary confusion lead to misclassification between known and unknown classes. To this end, we propose a novel framework based on Gaussian prototype and adaptive margin named GPAM for FsRE with NOTA, which includes three modules, semi-factual representation, GMM-prototype metric learning and decision boundary learning. The first two modules obtain better representations to solve the few-shot problem through debiased information enhancement and Gaussian space distance measurement. The third module learns more accurate classification boundaries and prototypes through adaptive margin and negative sampling. In the training procedure of GPAM, we use contrastive learning loss to comprehensively consider the effects of range and margin on the classification of known and unknown classes to ensure the model's stability and robustness. Sufficient experiments and ablations on the FewRel dataset show that GPAM surpasses previous prototype methods and achieves state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fast One-Pass Approximation for Matrix-Based Rényi's Entropy

SSRN

引用

SSRN 2024年

作者： Gong, Tieliang Dong, Yuxin Gao, Zeyu Chen, Hong Zhang, Weizhan Shaanxi Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Shaanxi Xi’an710049 China Department of Oncology University of Cambridge CambridgeCB2 1TN United Kingdom Department of Mathematics and Statistics Huazhong Agriculture University Hubei Wuhan430070 China

This paper is concerned with improving the computational efficiency of the matrix-based Rényi's α-order entropy, which enables directly being accessed from the given data without knowing the probability density function of the underlying data. However, leveraging either trace estimation or the eigenvalue-based methods will cost O(n3) in time complexity, where n is the number of observed samples. The intensive computational demands impede its utility in modern large-scale machine learning tasks. Recently, the Hutch++ based entropy approximation was developed, by converting the original entropy estimation problem into stochastic trace estimation. It reduces the time complexity to O(n2s) (s © 2024, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Identification of misleading product description in e-commerce website

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 127-135页

作者： Long, Yin Liu, Hong-Yan He, Jun Hu, He Du, Xiao-Yong Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China School of Economics and Management Tsinghua University Beijing100084 China

Online shopping has been accepted by more and more consumers. C2C websites provide thousands of offers for consumers as a mainstream e-commerce platform. When customers search products in C2C website, some returned offers have misleading description. Misleading description means that the description does not convey the actual price of products, but usually claiming much lower price for the purpose of attracting more consumers. The misleading offers affect consumers' judgments and bring bad influences on the websites' reputation. This paper proposes an approach that combines statistical model HMM with statistical outlier detection method to detect misleading offers. HMM model is built to determine the product that an offer description really designates, providing an efficient solution to eliminate the ambiguity of the offer description caused by description irregularities. The statistical outlier detection method is effective to deal with limited product offer information. The paper further conducts experiments on real data set of electric business websites and the results demonstrate the effectiveness of the proposed approach. ©2014 ISCAS.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Capability enhanced trust evaluation model for Web services

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第8期31卷 1471-1477页

作者： Li, Hai-Hua Du, Xiao-Yong Tian, Xuan Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Information Science and Technology Beijing Forestry University Beijing 100083 China

In open environment, an effective trust mechanism should be built to ensure transaction safety. But current trust evaluation approaches solely based on the certificate or feedback are inaccurate and ineffective. Thus, referring to the social trust models, this paper presents a capability enhanced method to improve the accuracy of evaluating trustworthiness. Based on it, this paper also designs a trust evaluation model ServTrust that naturally provides a solution to the trust problem. Compared with current feedback based approaches, simulation experimental results show the effectiveness of the proposed model in trust evaluating.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

knowledge graph enhanced neural collaborative recommendation

引用

Expert Systems with Applications 2021年 164卷 113992-113992页

作者： Sang, Lei Xu, Min Qian, Shengsheng Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230009 China Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 China Institute of Automation Chinese Academy of Sciences Beijing 100190 China Mininglamp Academy of Sciences Mininglamp Technology Beijing 100084 China

Existing neural collaborative filtering (NCF) recommendation methods suffer from severe sparsity problem. knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem. However, pure NCF models can hardly model the high-order connectivity in KG, and ignores complex pairwise correlations between user/item embedding dimensions. To address these problems, we propose a novel knowledge graph enhanced Neural Collaborative Recommendation (K-NCR) framework, which effectively combines user–item interaction information and auxiliary knowledge information for recommendation task into three parts: (1) For items, the proposed propagating model learns the representation of item entity. It recursively aggregates information from its multi-hop neighbours in KG, and employs an attention mechanism to discriminate the importance of the relation type to mine users’ potential preferences. (2) For users, another heterogeneous attention weights are leveraged to strengthen the embedding learning of users. (3) The user and item embeddings are then fed into a newly designed two-dimensional interaction map with convolutional hidden layers to model the complex pairwise correlations between their embedding dimensions explicitly. Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our K-NCR framework. © 2020

关键词： Attention mechanism Graph convolutional networks knowledge graph Neural collaborative filtering Recommendation system

来源：评论

学校读者我要写书评

暂无评论

Strategy intervention for the evolution of fairness

arXiv

引用

arXiv 2017年

作者： Zhang, Yanling Fu, Feng Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing China Department of Mathematics Dartmouth College HanoverNH United States Department of Biomedical Data Science Geisel School of Medicine Dartmouth College HanoverNH United States

Masses of experiments have shown individual preference for fairness which seems irrational. The reason behind it remains a focus for research. The effect of spite (individuals are only concerned with their own relative standing) on the evolution of fairness has attracted increasing attention from experiments, but only has been implicitly studied in one evolutionary model. The model did not involve high-offer rejections, which have been found in the form of non-monotonic rejections (rejecting offers that are too high or too low) in experiments. Here, we introduce a high offer and a non-monotonic rejection in structured populations of finite size, and use strategy intervention to explicitly study how spite influences the evolution of fairness: five strategies are in sequence added into the competition of a fair strategy and a selfish strategy. We find that spite promotes fairness, altruism inhibits fairness, and the non-monotonic rejection can cause fairness to overcome selfishness, which cannot happen without high-offer rejections. Particularly for the group-structured population with seven discrete strategies, we analytically study the effect of population size, mutation, and migration on fairness, selfishness, altruism, and spite. A larger population size cannot change the dominance of fairness, but it promotes altruism and inhibits selfishness and spite. Intermediate mutation maximizes selfishness and fairness, and minimizes spite;intermediate mutation maximizes altruism for intermediate migration and minimizes altruism otherwise. The existence of migration inhibits selfishness and fairness, and promotes altruism;sufficient migration promotes spite. Our study may provide important insights into the evolutionary origin of fairness. Copyright © 2017, The Authors. All rights reserved.

关键词： Population statistics

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and Computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：