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

arxiv 2024年

作者： Guo, Hao Ma, Zihan Zeng, Zhi Luo, Minnan Zeng, Weixin Tang, Jiuyang Zhao, xiang Laboratory for Big Data and Decision Nation University of Defence Technology China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China

Social platforms, while facilitating access to information, have also become saturated with a plethora of fake news, resulting in negative consequences. Automatic multimodal fake news detection is a worthwhile pursuit. Existing multimodal fake news datasets only provide binary labels of real or fake. However, real news is alike, while each fake news is fake in its own way. These datasets fail to reflect the mixed nature of various types of multimodal fake news. To bridge the gap, we construct an attributing multi-granularity multimodal fake news detection dataset AMG, revealing the inherent fake pattern. Furthermore, we propose a multi-granularity clue alignment model MGCA to achieve multimodal fake news detection and attribution. Experimental results demonstrate that AMG is a challenging dataset, and its attribution setting opens up new avenues for future research. © 2024, CC BY-NC-ND.

关键词： Fake detection

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Tile selection method based on error minimization for photomosaic image creation

引用

Frontiers of computer science 2021年第3期15卷 165-172页

作者： Hongbo ZHANG xin GAO Jixiang DU Qing LEI Lijie YANG Department of Computer Science and Technology Huaqiao UniversityXiamen 361021China Fujian Key Laboratory of Big Data Intelligence and Security Huaqiao UniversityXiamen 361021China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Huaqiao UniversityXiamen 361021China School of Computer Science and Technology Harbin Institute of TechnologyShenzhen 518055China

Photomosaic images are composite images composed of many small images called *** its overall visual effect,a photomosaic image is similar to the target image,and photomosaics are also called“montage art”.Noisy blocks and the loss of local information are the major obstacles in most methods or programs that create photomosaic *** solve these problems and generate a photomosaic image in this study,we propose a tile selection method based on error minimization.A photomosaic image can be generated by partitioning the target image in a rectangular pattern,selecting appropriate tile images,and then adding them with a weight *** on the principles of montage art,the quality of the generated photomosaic image can be evaluated by both global and local *** the proposed framework,via an error function analysis,the results show that selecting a tile image using a global minimum distance minimizes both the global error and the local error ***,the weight coefficient of the image superposition can be used to adjust the ratio of the global and local ***,to verify the proposed method,we built a new photomosaic creation dataset during this *** experimental results show that the proposed method achieves a low mean absolute error and that the generated photomosaic images have a more artistic effect than do the existing approaches.

关键词： photomosaic image tile image target image error minimization mean absolute error

来源：评论

学校读者我要写书评

暂无评论

WOBTree:a write-optimized B+-tree for non-volatile memory

引用

Frontiers of computer science 2021年第5期15卷 37-51页

作者： Haitao WANG Zhanhuai LI xiao ZHANG xiaonan ZHAO Song JIANG School of Computer Science and Engineering Northwestern Polytechnical UniversityXi'An 710072China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical UniversityMinistry of Industry and Information TechnologyXi'An 710072China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi’An 710072China Department of Computer Science and Engineering University of Texas at ArlingtonArlingtonTX 76010USA

The emergence of non-volatile memory(NVM)has introduced new opportunities for performance optimizations in existing storage *** better utilize its byte-addressability and near-DRAM performance,NVM can be attached on the memory bus and accessed via load/store memory instructions rather than the conventional block *** this scenario,a cache line(usually 64 bytes)becomes the data transfer unit between volatile and non-volatile ***,the failure-atomicity of write on NVM is the memory bit width(usually 8 bytes).This mismatch between the data transfer unit and the atomicity unit may introduce write amplification and compromise data consistency of node-based data structures such as B+-*** this paper,we propose WOBTree,a Write-Optimized B+-Tree for NVM to address the mismatch problem without expensive *** minimizes the update granularity from a tree node to a much smaller subnode and carefully arranges the write operations in it to ensure crash consistency and reduce write *** results show that compared with previous persistent B+-tree solutions,WOBTree reduces the write amplification by up to 86× and improves write performance by up to 61× while maintaining similar search performance.

关键词： non-volatile memory B+-tree atomic granularity mismatch write amplification performance optimization

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Exploration of Class Center for Fine-Grained Visual Classification

arXiv

引用

arxiv 2024年

作者： Yao, Hang Miao, Qiguang Zhao, Peipei Li, Chaoneng Li, xin Feng, Guanwen Liu, Ruyi The School of Computer Science and Technology Xidian University Shaanxi Xi’an710071 China Xi’an Key Laboratory of Big Data and Intelligent Vision Shaanxi Xi’an710071 China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an710071 China The School of Mechanical Engineering Yanshan University Qinhuangdao066004 China

Different from large-scale classification tasks, fine-grained visual classification is a challenging task due to two critical problems: 1) evident intra-class variances and subtle inter-class differences, and 2) overfitting owing to fewer training samples in datasets. Most existing methods extract key features to reduce intra-class variances, but pay no attention to subtle inter-class differences in fine-grained visual classification. To address this issue, we propose a loss function named exploration of class center, which consists of a multiple class-center constraint and a class-center label generation. This loss function fully utilizes the information of the class center from the perspective of features and labels. From the feature perspective, the multiple class-center constraint pulls samples closer to the target class center, and pushes samples away from the most similar nontarget class center. Thus, the constraint reduces intra-class variances and enlarges inter-class differences. From the label perspective, the class-center label generation utilizes class-center distributions to generate soft labels to alleviate overfitting. Our method can be easily integrated with existing fine-grained visual classification approaches as a loss function, to further boost excellent performance with only slight training costs. Extensive experiments are conducted to demonstrate consistent improvements achieved by our method on four widely-used fine-grained visual classification datasets. In particular, our method achieves state-of-the-art performance on the FGVC-Aircraft and CUB-200-2011 datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Unified Graph Augmentations for Generalized Contrastive Learning on Graphs 38

Unified Graph Augmentations for Generalized Contrastive Lear...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhuo, Jiaming Lu, Yintong Ning, Hui Fu, Kun Niu, Bingxin He, Dongxiao Wang, Chuan Guo, Yuanfang Wang, Zhen Cao, xiaochun Yang, Liang Hebei Province Key Laboratory of Big Data Calculation School of Artificial Intelligence Hebei University of Technology Tianjin China College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science and Technology Beijing JiaoTong University Beijing China School of Computer Science and Engineering Beihang University Beijing China School of Cybersecurity Northwestern Polytechnical University Xi'an China School of Cyber Science and Technology Shenzhen Campus of Sun Yat-sen University Shenzhen China

In real-world scenarios, networks (graphs) and their tasks possess unique characteristics, requiring the development of a versatile graph augmentation (GA) to meet the varied demands of network analysis. Unfortunately, most Graph Contrastive Learning (GCL) frameworks are hampered by the specificity, complexity, and incompleteness of their GA techniques. Firstly, GAs designed for specific scenarios may compromise the universality of models if mishandled. Secondly, the process of identifying and generating optimal augmentations generally involves substantial computational overhead. Thirdly, the effectiveness of the GCL, even the learnable ones, is constrained by the finite selection of GAs available. To overcome the above limitations, this paper introduces a novel unified GA module dubbed UGA after reinterpreting the mechanism of GAs in GCLs from a message-passing perspective. Theoretically, this module is capable of unifying any explicit GAs, including node, edge, attribute, and subgraph augmentations. Based on the proposed UGA, a novel generalized GCL framework dubbed Graph cOntrastive UnifieD Augmentations (GOUDA) is proposed. It seamlessly integrates widely adopted contrastive losses and an introduced independence loss to fulfill the common requirements of consistency and diversity of augmentation across diverse scenarios. Evaluations across various datasets and tasks demonstrate the generality and efficiency of the proposed GOUDA over existing state-of-the-art GCLs. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Drug-Protein Interaction Prediction by Fusion of Attention and Graph Neural Network

Drug-Protein Interaction Prediction by Fusion of Attention a...

引用

Chinese Control Conference (CCC)

作者： Tianrui Chen Shouheng Tuo Zengyu Feng School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Shaanxi China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an Shaanxi China

The identification of drug-protein interactions (DTIs) is a critical step in drug development and repositioning. However, detecting these interactions using scientific methods presents a formidable challenge. Existing models often struggle to extract relevant information from drug-protein sequences, and they fail to consider pre-existing interactions between pairs. Here, we introduce a deep learning model, DPAG, based on attention mechanisms and graph neural networks, which overcomes these limitations. DPAG leverages information from both the drug and protein sequences, as well as the association between drug-protein pairs, to predict DTIs. We conducted multiple experiments to evaluate the performance of the model in benchmark datasets, and the results showed that DPAG achieved excellent performance in terms of AUC, AUPR, precision, and recall. Our findings suggest that DPAG holds significant potential as a promising tool for predicting DTIs in drug development and repositioning. Code is available at https://***/veresse/DPAG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A New Model Based on Differential Evolutionary Algorithm and Markov Clustering for Identifying Protein Complexes

A New Model Based on Differential Evolutionary Algorithm and...

引用

Chinese Control Conference (CCC)

作者： Zengyu Feng Shouheng Tuo Tianrui Chen School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Shaanxi China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an Shaanxi China

As the material basis for all life activities, proteins play a crucial role in performing life activities. Most real-life proteins perform various functions in the form of protein complexes, so it is essential for understanding of life activities to accurately identify protein complexes. Most of the existing approaches learn protein interactions directly from protein topology, ignoring the biological characteristics of the actual proteins. Nevertheless, actual protein complexes are usually composed of protein cores and protein attachments. In this study, a new MP-DE algorithm is designed from the core-attachment structure to generate protein complex cores using Markov clustering, while searching for attached proteins in the second-order neighborhood of core protein complexes based on differential evolution(DE) algorithm. The experimental results show that the proposed method has high detection accuracy and efficiency on the current mainstream protein-protein interaction(PPI) database.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：