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

SSRN 2024年

作者： Chen, Long Sun, Rui Yu, Yiheng Du, Yun Zhang, Xudong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer and Information Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology Hefei230009 China The School of Computer and Information Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology Hefei230009 China

Visible-thermal Person Re-identification (VT Re-ID) is a challenging task in all-weather surveillance system. Existing methods focus on extracting the modality-shared features, ignoring the discriminative inter-modality complementary features. To tackle this issue, we propose the multi-branch modality residual complementary learning method consisting of modality residual complementary learning (MRCL) module and multi-branch feature learning (MBFL) module. The MRCL module can be easily integrated into existing CNN and Transformer baselines and drive the network to focus on both intra-modality and inter-modality information simultaneously. On one hand, we adopt the basic two-stream network to obtain the intra-modality features, on the other hand, we feed the residual image acquired by cross-modality correlation saliency erasing operation to another two-stream network to capture the inter-modality complementary features. Moreover, we employ the MBFL module to capture local spatial features and local channel features and integrate them with global features to increase the discriminability and robustness of the ultimate representations for handling intra-modality variations. The extensive experiments on RegDB and SYSU-MM01 datasets demonstrate the superiority of our proposed method compared with state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

PNRITR:Research on Positive and Negative Entity Region Perception Methods for Image-Text Retrieval 36

PNRITR:Research on Positive and Negative Entity Region Perce...

引用

36th International Conference on Software engineering and knowledge engineering, SEKE 2024

作者： Zhang, Zhiping Sun, Tao Zheng, Hongyan Liu, Hao Liu, Gengchen Yang, Zhi Wang, Xiaoyu 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

ISBN: (纸本)1891706594

The aim of cross-modal image-text retrieval is to heighten comprehension and to create robust associations between visual and textual content. This process entails a mutual querying and synchronization across various data formats. While conventional techniques have seen enhancements via attention-based approaches, they frequently miss the dynamics between corresponding and non-corresponding entity areas within image-text pairs. These techniques, often fixated on aligning image entities with textual terms, can overlook the congruence of entity characteristics, leading to less accurate localization. This research introduces PNRITR, an innovative strategy for cross-modal retrieval that leverages label learning to discern attributes absent from images, broadening the scope beyond just positive entity areas. PNRITR has delivered notable advancements on the Flickr30K and MS-COCO datasets. © 2024 knowledge Systems Institute Graduate School. All rights reserved.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Low-Sampling-Frequency Plane wave Medical Ultrasound Imaging based on Adversarial Learning

Low-Sampling-Frequency Plane wave Medical Ultrasound Imaging...

引用

IEEE International Conference on Image Processing

作者： Xiaoteng Chen Junying Chen School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education China

In plane wave medical ultrasound imaging, the analog echo signals are received via the transducer, and sampled as digital radio frequency data which is further processed by the beamforming algorithm to obtain the output ultrasound image. The sampling frequency of radio frequency data has a great impact on the image quality. The radio frequency data with higher sampling frequency is closer to the true distribution of the analog echo signals, leading to better image quality. However, high-frequency sampling chips are usually expensive. Thus, improving the plane wave imaging quality for radio frequency data with low sampling frequency has important practical significance. The ultrasound imaging quality is mainly affected by shallow features such as texture and color. However, low-sampling-frequency data has poor shallow features while high-sampling-frequency data has better shallow features. In this work, we propose an adversarial learning method to replace the shallow features of low-frequency data with the shallow features of high-frequency data, but retaining the deep features of low-frequency data. The experiment results demonstrate that the proposed method improves the plane wave imaging quality for low-sampling-frequency data by fusing shallow and deep features.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on long and short-term social recommendation based on convolutional and gated recurrent units 29

Research on long and short-term social recommendation based ...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Jia, Zihe Xue, Peng Dai, Zhiqiang Gao, Qian Zhang, Xiaomeng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China

ISBN: (纸本)9798350330717

The development of the Internet has made people more closely related and has put forward higher requirements for recommendation models. Most recommendation models are studied only for the long-term interests of users. In this paper, the interaction time between the user and the item is introduced as auxiliary information in the model construction. Interaction time is used to determine users' long-term preferences and short-term preferences. In this paper, temporal features are extracted by building a convolutional gated recurrent unit with attention neural network (CNN-GRU-Attention). Firstly, for the problem of accurate feature extraction, CNN are constructed to extract higher-level and more abstract features of themselves and transform high-dimensional data into low-dimensional data;secondly, for the problem of social temporality, GRU are used to not only extract temporal information, but also effectively reduce gradient dispersion, making model convergence and training easier;finally, Graph Attention networks are used to aggregate the social relationship information of users and items respectively, which constitute the final feature representation of users and items respectively. In particular, a modified cosine similarity is used to reduce the error caused by data insensitivity when constructing the social information of the item. In this study, simulation experiments are conducted on two publicly available datasets (Epinions and Ciao), and the experimental results show that the proposed recommended model performs better than other social recommendation models, improving the evaluation metrics of MAE and RMSE by 1.06%-1.33% and 1.19%-1.37%, respectively. The effectiveness of the model innovation is proved. © 2023 IEEE.

关键词： convolutional gated recurrent unit graph attention networks neighborhood recommendation systems social networks

来源：评论

学校读者我要写书评

暂无评论

LEGNN: A Label Ensemble Perspective for Training a Label-Noise-Resistant GNN with Reduced Complexity

arXiv

引用

arXiv 2024年

作者： Zhao, Rui Shi, Bin Liang, Zhiming Ruan, Jianfei Dong, Bo Lin, Lu School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China School of Distance Education Xi'an Jiaotong University China College of Information Sciences and Technology Penn State University United States

Graph Neural Networks (GNNs) have been widely employed for semi-supervised node classification tasks on graphs. However, the performance of GNNs is significantly affected by label noise, that is, a small amount of incorrectly labeled nodes can substantially misguide model training. Mainstream solutions define node classification with label noise (NCLN) as a reliable labeling task, often introducing node similarity with quadratic computational complexity to more accurately assess label reliability. To this end, in this paper, we introduce the Label Ensemble Graph Neural Network (LEGNN), a lower complexity method for robust GNNs training against label noise. LEGNN reframes NCLN as a label ensemble task, gathering informative multiple labels instead of constructing a single reliable label, avoiding high-complexity computations for reliability assessment. Specifically, LEGNN conducts a two-step process: bootstrapping neighboring contexts and robust learning with gathered multiple labels. In the former step, we apply random neighbor masks for each node and gather the predicted labels as a high-probability label set. This mitigates the impact of inaccurately labeled neighbors and diversifies the label set. In the latter step, we utilize a partial label learning based strategy to aggregate the high-probability label information for model training. Additionally, we symmetrically gather a low-probability label set to counteract potential noise from the bootstrapped high-probability label set. Extensive experiments on six datasets demonstrate that LEGNN achieves outstanding performance while ensuring efficiency. Moreover, it exhibits good scalability on dataset with over one hundred thousand nodes and one million edges. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ANIMC: A Soft Approach for Autoweighted Noisy and Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 192-206页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering The School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Multiview clustering has wide real-world applications because it can process data from multiple sources. However, these data often contain missing instances and noises, which are ignored by most multiview clustering methods. Missing instances may make these methods difficult to use directly, and noises will lead to unreliable clustering results. In this article, we propose a novel autoweighted noisy and incomplete multiview clustering (ANIMC) approach via a soft autoweighted strategy and a doubly soft regular regression model. First, by designing adaptive semiregularized nonnegative matrix factorization, the soft autoweighted strategy assigns a proper weight to each view and adds a soft boundary to balance the influence of noises and incompleteness. Second, by proposing θ-norm, the doubly soft regularized regression model adjusts the sparsity of our model by choosing different θ. Compared with previous methods, ANIMC has three unique advantages: 1) it is a soft algorithm to adjust our approach in different scenarios, thereby improving its generalization ability;2) it automatically learns a proper weight for each view, thereby reducing the influence of noises;3) it performs doubly soft regularized regression that aligns the same instances in different views, thereby decreasing the impact of missing instances. Extensive experimental results show its superior advantages over other state-of-the-art works. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Logical Relation Modeling and Mining in Hyperbolic Space for Recommendation 40

Logical Relation Modeling and Mining in Hyperbolic Space for...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Tan, Yanchao Lv, Hang Zhou, Zihao Guo, Wenzhong Xiong, Bo Liu, Weiming Chen, Chaochao Wang, Shiping Yang, Carl College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Institute for Artificial Intelligence University of Stuttgart Stuttgart Germany College of Computer Science Zhejiang University Hangzhou China Emory University Department of Computer Science Atlanta United States

ISBN: (纸本)9798350317152

The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent logical relations among items and tags (e.g., membership, hierarchy, and exclusion), which can be leveraged to enhance the accuracy of modeling user preferences and conducting recommendations. To this end, we propose to extract logical relations among item tags from existing tag taxonomies and exploit the individual strengths of the Poincaré and the Lorentz models in hyperbolic space for logical relation modeling towards enhanced recommendations. Moreover, we find that the logical relations directly extracted from existing tag taxonomies can be inaccurate and coarse. Therefore, we further devise innovative consistency-based and granularity-based weighting mechanisms based on user behavior patterns for data-driven logical relation mining that can be jointly optimized along with recommendations in an end-to-end fashion. Extensive experiments on four real-world benchmark datasets show drastic performance gains brought by our proposed framework, which constantly achieves an average of 8.25% improvement over state-of-the-art competitors regarding both Recall and NDCG metrics. Insightful case studies further demonstrate that our automatically refined logical relations are highly accurate and interpretable. © 2024 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-Fuzzy-Constrained Strong Simulation

引用

ACM Transactions on knowledge Discovery from data 2021年第3期16卷 1–27页

作者： Guliu Liu Lei Li Guanfeng Liu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province (Hefei University of Technology) and Hefei University of Technology Macquarie University NSW Australia Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education and Mininglamp Academy of Sciences Mininglamp Technology

Traditional social group analysis mostly uses interaction models, event models, or other social network analysis 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 interactions between members of the group. Generally, Graph Pattern Matching (GPM) technique 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 article, first, a social group query problem that needs to consider the trust between members of the group is proposed. Then, to solve this problem, a multi-fuzzy-constrained strong simulation matching model is proposed based on multi-constrained simulation, and a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence is proposed. Aiming at the inefficiency of the NTSS algorithm when pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matching 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.

关键词： Graph pattern matching contextual social network multi-fuzzy-constrained strong simulation social group query

来源：评论

学校读者我要写书评

暂无评论

Personalized Recommendation Based on Entity Attributes and Graph Features 12

Personalized Recommendation Based on Entity Attributes and G...

引用

12th IEEE International Conference on big knowledge, ICBK 2021

作者： Zhu, Yi Dong, Bingbing Sha, Zhiqing Yangzhou University School of Information Engineering Yangzhou China 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 China Institute of Big Knowledge Science Hefei University of Technology Hefei China

ISBN: (纸本)9781665438582

With the rapid increase in the amount of website data, it has been a more difficult task for users to get the infor-mation they are interested in. Personalized recommendation is an important bridge to find the information which users really need on the website. Many recent studies have introduced additional attribute information about users and/or items to the rating matrix for alleviating the problem of data sparsity. In order to make full use of the attribute information and scoring matrix, deep learning based recommendation methods are proposed, especially the autoencoder model has attracted much attention because of its strong ability to learn hidden features. However, most of the existing autoencoder- based models require that the dimension of the input layer is equal to the dimension of the output layer, which may increase model complexity and certain information loss when using attribute information. In addition, as users' awareness of privacy protection increases, user attribute information is difficult to obtain. To address the above problems, in this paper, we propose a hybrid personalized recommendation model, which uses a semi-autoencoder to jointly embed the item's score vector and internal graph features (short for Co-Agpre). Specifically, we regard the user-item historical interaction matrix as a bipartite graph, and the Laplacian of the user-item co-occurrence graph is utilized to obtain the graph features of the item for solving the problem of sparse attributes. Then a semi-autoencoder is introduced to learn the hidden features of the item and perform rating prediction. The proposed model can flexibly use information from different sources to reduce the complexity of the model. Experiments on two real-world datasets demonstrate the effectiveness of the proposed Co-Agpre compared with state-of-the-art methods. © 2021 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：