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

IEEE International Conference on Systems, Man and Cybernetics

作者： Shuo Zhao Qiliang Gu Jianqiang Zhang Gongpeng Song Qin Lu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Chinese short text similarity computation stands as a pivotal task within natural language processing, garnering significant attention. However, existing models grapple with limitations in handling intricate semantic relationships, such as the challenge of discerning subtle semantic nuances in text, inadequacies in effectively integrating diverse levels of semantic information, and the struggle to capture polysemous meanings accurately. In addressing these issues, this paper introduces an innovative Chinese short text similarity computation model, SMGC-SBERT. This model addresses shortcomings of the existing models by employing a multi-module fusion strategy, thereby enabling a more precise measurement of semantic similarity between texts. Primarily, the model incorporates SAT embedding to acquire phrase-level semantic information and leverages the MS-BERT model to encode text, improving the model's comprehension of textual polysemy and obtaining richer semantic representation. Then, the fusion of module features, including multi-branch convolutional networks and mix pooling, enables the extraction of textual features from varied levels, bolstering the model's representational capacity. Additionally, to further reduce overfitting risks while improving accuracy and other performance, a multi-layer feature adjustment network is utilized for short text similarity calculation. The final resultant experimental findings showcase the superiority of the SMGC-SBERT model over other neural network models, demonstrating significant advancements across both Chinese-SNLI and CCKS2018_Task3 Chinese short text datasets.

关键词： Deep learning Computational modeling Semantics Neural networks Feature extraction Natural language processing Multilingual Convolutional neural networks Cybernetics Overfitting

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

GK: A Graphormer Architecture Based Knowledge Graph Reasoning Model for Link Prediction

GK: A Graphormer Architecture Based Knowledge Graph Reasonin...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yueiia Wu Jian-tao Zhou Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Knowledge Graph has become a dominant research field in graph theory, but its incompleteness and sparsity hinder its application in various fields. Knowledge Graph Reasoning aims to alleviate these problems by deducing new knowledge or identifying false knowledge from existing knowledge. Recently, the Graph Convolution Network (GCN) based method is one of the most advanced methods to realize knowledge graph reasoning. However, it still suffers from some problems such as incomplete neighbor information aggregation and slow training speed. This paper proposes a knowledge graph reasoning model named GK for the link prediction task, which obtains better performance than existing GCN-based methods by introducing Graphormer into knowledge reasoning. The GK first proposes that nodes and their surroundings can be regarded as a hierarchical architecture that enables the model to capture more practical reasoning information to improve prediction accuracy. In addition, to accelerate the training speed of the model on the large-scale Knowledge Graph, we present a faster shortest path-finding method F-SPF in the edge coding process. Extensive experimental results show that the GK model can obtain the state-of-the-art prediction results of current GCN-based methods and can improve the training speed.

关键词： Training Knowledge engineering Knowledge graphs Predictive models Prediction algorithms Feature extraction Cognition

来源：评论

学校读者我要写书评

暂无评论

An Enhanced Flower Pollination Algorithm for Solving Optimal Power Flow Problem

SSRN

引用

SSRN 2022年

作者： Zhong, keyu Xiao, Fen Gao, Xieping Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal University Changsha410081 China School of Mathematics and Statistics Hunan Normal University Changsha410081 China School of Computer Science Xiangtan University Hunan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

The OPF system for renewable energy power has presented characteristics such as extremely high security constraints and more obvious multimodal properties, its solution is a challenging task and requires more efficient methods. In this paper, an enhanced flower pollination algorithm, EFPA-SF is proposed to solve the OPF problem. In EFPA-SF, there are four improvements: firstly, a random step size in the process of cross-pollination is proposed to improve the global search ability of EFPA-SF. Secondly, in the stage of self-pollination, the global optimal pollen is introduced to improve the ability of exploitation–exploration balance of the algorithm. In addition, if pollen individual crosses boundaries, boundary constraint is carried out by the previous position and boundary position of pollen, which is instrumental to escape from local optimum. Finally, the superiority of feasible solutions (SF) constraints handling method is integrated into the algorithm to satisfy the feasibility of the solutions. To verify the effectiveness of the proposed algorithm, the optimization capability of EFPA is first investigated and analyzed by using the most recent IEEE CEC2021 benchmark functions. Then, EFPA-SF is used to solve three engineering design problems and the performance is compared with the state-of-the-art algorithms, the validation results reveal that the proposed algorithm outperforms state-of-the-art algorithms, and demonstrate that it can be used for constrained optimization as well as for unconstrained optimization problems with good generality. Finally, EFA-SF is applied to the OPF problem on a modified IEEE-30 bus system that incorporates stochastic wind, solar, and small hydro power in addition to conventional thermal power generation. The comprehensive investigation reveals that EFA-SF can provide competitive solutions to the OPF problem compared to popular algorithms. © 2022, The Authors. All rights reserved.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

Network Parameter Generation for One-Shot Object Detection

Network Parameter Generation for One-Shot Object Detection

引用

IEEE International Conference on Unmanned Systems (ICUS)

作者： Kang Wang Jiajia Zhao Yang Wang Shuigeng Zhou Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University Shanghai China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing Electro-Mechanical Engineer Institute Beijing China School of Information Engineering Nanchang University China

ISBN: (纸本)9781728137933

Recent object detection models have achieved satisfactory performance by deep learning with large-scale annotated datasets. However, these models often perform poorly when the training examples are not sufficient enough, especially for one-shot object detection where there is only one training example of each target class. In this paper, we propose a network parameter generation framework for effective one-shot object detection. By leveraging the semantic relationship between the source-domain and the target-domain (new classes), our framework can generate network parameters for the new classes directly. Furthermore, we develop two implementation schemes for this framework: weighting-based parameter generation and regression-based parameter generation. These two schemes use different information to construct the relationship and transfer knowledge from the source-domain to the target-domain. Experiments on the PASCAL-OSCD benchmark show that our methods can significantly boost the performance of one-shot object detection.

关键词： Object detection Detectors Head Training Feature extraction Task analysis Training data

来源：评论

学校读者我要写书评

暂无评论

Decoding Continuous Character-based Language from Non-invasive Brain Recordings

arXiv

引用

arXiv 2024年

作者： Zhang, Cenyuan Zheng, Xiaoqing Yin, Ruicheng Geng, Shujie Xu, Jianhan Gao, Xuan Lv, Changze Ling, Zixuan Huang, Xuanjing Cao, Miao Feng, Jianfeng School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai China Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Ministry of Education China

Deciphering natural language from brain activity through non-invasive devices remains a formidable challenge. Previous non-invasive decoders either require multiple experiments with identical stimuli to pinpoint cortical regions and enhance signal-to-noise ratios in brain activity, or they are limited to discerning basic linguistic elements such as letters and words. We propose a novel approach to decoding continuous language from single-trial non-invasive fMRI recordings, in which a three-dimensional convolutional network augmented with information bottleneck is developed to automatically identify responsive voxels to stimuli, and a character-based decoder is designed for the semantic reconstruction of continuous language characterized by inherent character structures. The resulting decoder can produce intelligible textual sequences that faithfully capture the meaning of perceived speech both within and across subjects, while existing decoders exhibit significantly inferior performance in cross-subject contexts. The ability to decode continuous language from single trials across subjects demonstrates the promising applications of non-invasive language brain-computer interfaces in both healthcare and neuroscience. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Learnable Graph Convolutional Network and Feature Fusion for Multi-view Learning

arXiv

引用

arXiv 2022年

作者： Chen, Zhaoliang Fu, Lele Yao, Jie Guo, Wenzhong Plant, Claudia Wang, Shiping College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Faculty of Computer Science University of Vienna Vienna1090 Austria Research Network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

In practical applications, multi-view data depicting objectives from assorted perspectives can facilitate the accuracy increase of learning algorithms. However, given multi-view data, there is limited work for learning discriminative node relationships and graph information simultaneously via graph convolutional network that has drawn the attention from considerable researchers in recent years. Most of existing methods only consider the weighted sum of adjacency matrices, yet a joint neural network of both feature and graph fusion is still under-explored. To cope with these issues, this paper proposes a joint deep learning framework called Learnable Graph Convolutional Network and Feature Fusion (LGCN-FF), consisting of two stages: feature fusion network and learnable graph convolutional network. The former aims to learn an underlying feature representation from heterogeneous views, while the latter explores a more discriminative graph fusion via learnable weights and a parametric activation function dubbed Differentiable Shrinkage Activation (DSA) function. The proposed LGCN-FF is validated to be superior to various state-of-the-art methods in multi-view semi-supervised classification. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-view Contrastive Learning for Medical Question Summarization

Multi-view Contrastive Learning for Medical Question Summari...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Sibo Wei Xueping Peng Hongjiao Guan Lina Geng Ping Jian Hao Wu Wenpeng Lu Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Key Laboratory of Computing Power Network and Information Security Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Australia Department of Blood Purification Qilu Hospital of Shandong University Jinan China School of Computer Science and Technology Beijing Institute of Technology Beijing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Most Seq2Seq neural model-based medical question summarization (MQS) systems have a severe mismatch between training and inference, i.e., exposure bias. However, this problem remains unexplored in the MQS task. To bridge this research gap and alleviate the problem of exposure bias, we propose a novel re-ranking training framework for MQS called Multi-view Contrastive Learning (MvCL). MvCL simultaneously considers the similarity scores between medical questions and candidate summaries as well as the average similarity scores between candidate summaries and other candidates within the same group, and utilizes contrastive learning to optimize the model’s ranking ability. Additionally, we propose a new multilevel inference approach to adapt to this training strategy. The approach first filters out candidate summaries that are dissimilar to the original medical question, and then selects the summary with the highest average similarity to other candidate summaries from the remaining candidates as the final output. We conducted extensive experiments, and the results demonstrate that our proposed MvCL framework achieves state-of-the-art results on the majority of evaluation metrics across four datasets. 1

关键词： Training Measurement Bridges Adaptation models Limiting Filters Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Novel Text Matching Model Based on Multilayer Coding and Feature Enhancement

A Novel Text Matching Model Based on Multilayer Coding and F...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yu Zhang Jianqiang Zhang Gongpeng Song Qin Lu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the rapid development of Natural Language processing (NLP), text matching has become the basis of many downstream tasks in NLP, and the study of text matching is of great research significance for solving tasks such as question and answer and information retrieval in NLP. Most of the current text matching methods tend to have problems such as mismatch of grammatical structures and insufficient interaction information in sentences. In order to solve the problems of insufficient interaction information and lack of features and ability to capture keyword and sequence information in text matching, this paper proposes a text matching method based on multi-layer coding and soft attention mechanism. The method first embeds the text and sends it to a gating module for processing, then sends the processed result to a module containing a combination of multilayer coding and soft attention mechanism for further operations such as multiple alignment, and finally sends it to a classifier containing a three-layer fully-connected network for predicting whether the input text pairs match or not. The two modules proposed in this paper are practically feasible, and comparison and ablation experiments have been conducted on the publicly available datasets LCQMC dataset and BQ dataset, and the experimental results show that the two modules improve the accuracy of text matching by 2.44% and 1.02%, respectively.

关键词： Attention mechanisms Accuracy Computational modeling Impedance matching Nonhomogeneous media information retrieval Encoding

来源：评论

学校读者我要写书评

暂无评论

An energy saving and balanced clustering routing protocol for wireless sensor networks

引用

ICIC Express Letters 2014年第9期8卷 2577-2584页

作者： Liu, Fangai Zhang, Chunhua Wang, Jiwei School of Information Science and Engineering Shandong Normal University No. 88 East Wenhua Road Lixia District Jinan 250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology No. 88 East Wenhua Road Lixia District Jinan 250014 China

In order to prolong the lifetime of wireless sensor networks, we propose an energy saving and balanced clustering routing protocol (ESB). ESB employs energy and distance in probability model to generate candidate cluster-heads (CHs). Candidate CHs set timer based on residual energy to ensure the nodes with high residual energy become CHs. ESB employs residual energy and the distance to Sink in competing radius. When normal nodes select the optimal CH to join, they consider energy, its communication cost and CHs' communication cost. When CHs select relay-node, they consider optimal forwarding hops, energy, inter-cluster communication cost and intra-cluster communication cost. These measures can not only save energy, but also remit the imbalance problem of energy consumption. Through performance analysis, ESB has favorable expansibility and low algorithm complexity. The results of simulation experiments on the OMNet++ show that ESB can better balance energy consumption of all nodes in the network, save network's energy, and prolong network's lifetime compared with other cluster-based routing algorithms. © 2014 ISSN 1881-803X.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：