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

IEEE International Conference on data Mining (ICDM)

作者： Jiahuan Ren Zhao Zhang Jicong Fan Haijun Zhang Mingliang Xu Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Data Science The Chinese University of Hong Kong (Shenzhen) & Shenzhen Research Institute of Big Data Shenzhen China Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Engineering Zhengzhou University Zhengzhou China

ISBN: (纸本)9781665423991

Convolutional Neural Networks (CNNs)-guided deep models have obtained impressive performance for image representation, however the representation ability may still be restricted and usually needs more epochs to make the model converge in training, due to the useful information loss during the convolution and pooling operations. We therefore propose a general feature recovery layer, termed Low-rank Deep Feature Recovery (LDFR), to enhance the representation ability of the convolutional features by seamlessly integrating low-rank recovery into CNNs, which can be easily extended to all existing CNNs-based models. To be specific, to recover the lost information during the convolution operation, LDFR aims at learning the low-rank projections to embed the feature maps onto a low-rank subspace based on some selected informative convolutional feature maps. Such low-rank recovery operation can ensure all convolutional feature maps to be reconstructed easily to recover the underlying subspace with more useful and detailed information discovered, e.g., the strokes of characters or the texture information of clothes can be enhanced after LDFR. In addition, to make the learnt low-rank subspaces more powerful for feature recovery, we design a fusion strategy to obtain a generalized subspace, which averages over all learnt sub-spaces in each LDFR layer, so that the convolutional feature maps in test phase can be recovered effectively via low-rank embedding. Extensive results on several image datasets show that existing CNNs-based models equipped with our LDFR layer can obtain better performance.

关键词： Training Image recognition Convolution Conferences Image representation data mining Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Unsupervised vehicle re-identification with progressive adaptation

arXiv

引用

arXiv 2020年

作者： Peng, Jinjia Wang, Yang Wang, Huibing Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University LiaoningDalian China Pengcheng Laboratory ShenzhenGuangdong China Key Laboratory of Knowledge Engineering with Big Data Ministry of education Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

Vehicle re-identification (reID) aims at identifying vehicles across different non-overlapping cameras views. The existing methods heavily relied on well-labeled datasets for ideal performance, which inevitably causes fateful drop due to the severe domain bias between the training domain and the real-world scenes;worse still, these approaches required full annotations, which is labor-consuming. To tackle these challenges, we propose a novel progressive adaptation learning method for vehicle reID, named PAL, which infers from the abundant data without annotations. For PAL, a data adaptation module is employed for source domain, which generates the images with similar data distribution to unlabeled target domain as "pseudo target samples". These pseudo samples are combined with the unlabeled samples that are selected by a dynamic sampling strategy to make training faster. We further proposed a weighted label smoothing (WLS) loss, which considers the similarity between samples with different clusters to balance the confidence of pseudo labels. Comprehensive experimental results validate the advantages of PAL on both VehicleID and VeRi-776 dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Identifying Political Influencers on YouTube during the 2016 Moroccan General Election

引用

Procedia Computer Science 2020年 170卷 1102-1109页

作者： Zakia Acharoui Altaf Alaoui Badia Ettaki Jamal Zerouaoui Mohamed Dakkon Laboratory of Engineering Sciences and Modeling Faculty of Sciences- Ibn Tofail University Campus Universitaire BP 133 Kenitra Morocco Laboratory of Research in Computer Science Data Sciences and Knowledge Engineering School of Information Sciences Rabat Morocco Département de Statistique et Informatique de gestion F.S.E.J.S. Universite Abdelmalek Essaadi Tetouan Morocco

The use of social media as a tool for political and electoral communication is not fully explored by Moroccan researchers. This study aims to identify the influencers of the political conversation, on YouTube, during the period of the Moroccan election campaign of 2016 by using centrality measures, and discuss the nature of information shared by those influencers and their profile. The finding shows that digital media and vloggers tend to be central instead of politician elites and official media who were absent from the top influencer list.

关键词： Centrality measures Social Network Analysis Electoral campaign Gatekeepers Modularity

来源：评论

学校读者我要写书评

暂无评论

Survey on ontology learning research

引用

Ruan Jian Xue Bao/Journal of Software 2006年第9期17卷 1837-1847页

作者： Du, Xiao-Yong Li, Man Wang, Shan School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872 China

Recently, ontology learning is emerging as a new hotspot of research in computer science. In this paper the issue of ontology learning is divided into nine sub-issues according to the structured degree (structured, semi-structured, non-structured) of source data and learning objects (concept, relation, axiom) of ontology. The characteristics, major approaches and the latest research progress of the nine sub-issues are summarized. Based on the analysis framework proposed in the paper, existing ontology learning tools are introduced and compared. The problems of current research are discussed, and finally the future directions are pointed out.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Constant approximation for virtual backbone construction wit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Hongwei Du Qiang Ye Weili Wu Wonjun Lee Deying Li Dingzhu Du Stephen Howard Department of Computer Science and Information Technology University of Prince Edward Island Canada Department of Computer Science University of Texas Dallas USA Department of Computer Science and Engineering Korea University Seoul South Korea Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9781424499199

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

关键词： Routing Approximation methods Distributed algorithms Wireless sensor networks Polynomials Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance to Detecting Topic Shift of Large Language Models: A Study 9

Evaluating the Performance to Detecting Topic Shift of Large...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Tian, Pingfang Liu, Deting Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Institute of Scientific and Technical Information of China The Key Laboratory of the Rich Media Knowledge Organisation and Service of Digital Publishing Content Beijing100038 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 Wuhan430065 China

ISBN: (纸本)9798350376548

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. © 2024 IEEE.

关键词： adjacent utterances level ChatGPT contextual level single utterances level topic shift detection

来源：评论

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

HUSS: A Heuristic Method for Understanding the Semantic Stru...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

来源：评论

学校读者我要写书评

暂无评论

An MRC Framework for Semantic Role Labeling

arXiv

引用

arXiv 2021年

作者： Wang, Nan Li, Jiwei Meng, Yuxian Sun, Xiaofei Qiu, Han Wang, Ziyao Wang, Guoyin He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China China Shannon.AI China Zhejiang University China Tsinghua University China University of Leeds United Kingdom Amazon Alexa AI United States

Semantic Role Labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two subtasks: predicate disambiguation and argument labeling. Prior work deals with these two tasks independently, which ignores the semantic connection between the two tasks. In this paper, we propose to use the machine reading comprehension (MRC) framework to bridge this gap. We formalize predicate disambiguation as multiple-choice machine reading comprehension, where the descriptions of candidate senses of a given predicate are used as options to select the correct sense. The chosen predicate sense is then used to determine the semantic roles for that predicate, and these semantic roles are used to construct the query for another MRC model for argument labeling. In this way, we are able to leverage both the predicate semantics and the semantic role semantics for argument labeling. We also propose to select a subset of all the possible semantic roles for computational efficiency. Experiments show that the proposed framework achieves state-of-the-art or comparable results to previous work. Code is available at https://***/ShannonAI/MRC-SRL. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-fuzzy-constrained Strong Simulation

arXiv

引用

arXiv 2021年

作者： Liu, Guliu Li, Lei Liu, Guanfeng 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 China Department of Computing Macquarie University Australia Mininglamp Academy of Sciences Mininglamp Technology China

Traditional social group analysis mostly uses interaction models, event models, or other methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interaction between members of the group. Generally, graph pattern matching (GPM) is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this paper, a social group query problem that needs to consider the trust between members of the group is proposed. To solve this problem, we propose a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence. Aiming at the inefficiency of the NTSS algorithm when matching pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matched edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Learning from Semi-Factuals: A Debiased and Semantic-Aware Framework for Generalized Relation Discovery

arXiv

引用

arXiv 2024年

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Guo, Tianlin Wu, Wenjun The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an710049 China

We introduce a novel task, called Generalized Relation Discovery (GRD), for open-world relation extraction. GRD aims to identify unlabeled instances in existing pre-defined relations or discover novel relations by assigning instances to clusters as well as providing specific meanings for these clusters. The key challenges of GRD are how to mitigate the serious model biases caused by labeled pre-defined relations to learn effective relational representations and how to determine the specific semantics of novel relations during classifying or clustering unlabeled instances. We then propose a novel framework, SFGRD, for this task to solve the above issues by learning from semi-factuals in two stages. The first stage is semi-factual generation implemented by a tri-view debiased relation representation module, in which we take each original sentence as the main view and design two debiased views to generate semi-factual examples for this sentence. The second stage is semi-factual thinking executed by a dual-space tri-view collaborative relation learning module, where we design a cluster-semantic space and a class-index space to learn relational semantics and relation label indices, respectively. In addition, we devise alignment and selection strategies to integrate two spaces and establish a self-supervised learning loop for unlabeled data by doing semi-factual thinking across three views. Extensive experimental results show that SFGRD surpasses state-of-the-art models in terms of accuracy by 2.36% ∼5.78% and cosine similarity by 32.19%∼ 84.45% for relation label index and relation semantic quality, respectively. To the best of our knowledge, we are the first to exploit the efficacy of semi-factuals in relation extraction. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：