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

Attributes-based person re-identification via CNNs with coupled clusters loss

Journal of Systems engineering and Electronics 2020年第1期31卷 45-55页

作者： SUN Rui HUANG Qiheng FANGWei ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification(re-id)involves matching a person across nonoverlapping views,with different poses,illuminations and *** attributes are understandable semantic information to help improve the issues including illumination changes,viewpoint variations and *** paper proposes an end-to-end framework of deep learning for attribute-based person *** the feature representation stage of framework,the improved convolutional neural network(CNN)model is designed to leverage the information contained in automatically detected attributes and learned low-dimensional CNN ***,an attribute classifier is trained on separate data and includes its responses into the training process of our person re-id *** coupled clusters loss function is used in the training stage of the framework,which enhances the discriminability of both types of *** combined features are mapped into the Euclidean *** L2 distance can be used to calculate the distance between any two pedestrians to determine whether they are the *** experiments validate the superiority and advantages of our proposed framework over state-of-the-art competitors on contemporary challenging person re-id datasets.

关键词： person re-identification(re-id) convolutions neural network(CNN) attributes coupled clusters loss(CCL)

来源：评论

学校读者我要写书评

暂无评论

Convolution Neural Network for Renal Function Assessment Based on Glomerular Filtration Rate

Convolution Neural Network for Renal Function Assessment Bas...

引用

2021 International Conference on Advanced Technologies and Applications of Modern Industry, ATAMI 2021

作者： Wu, Congzhong Wang, Lulu Yang, Zhen Wang, Jing Han, Li Li, Fei Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230601 China School of Computer and Information Hefei University of Technology Hefei Anhui230601 China The Second Hospital of Anhui Medical University Hefei Anhui230601 China

Objective: To develop a Convolution Neural Network (CNN) and discuss its performance in the estimation of Glomerular Fifiltration Rate (GFR) for patients with chronic kidney disease (CKD). Methods: A total of 112 patients with chronic kidney disease were enrolled in this study. The GFR is measured by 99mTc-DTPA renal dynamic and used as standard GFR after normalization by body surface area imaging. We established a CNN model and verified the performance of the model by comparing the GFR predicted by the model with the standard GFR. It turned out that the CNN could better evaluate the GFR of patients which is superior to the CG formula, MDRD formula, CKD-EPI formula and GRNN model. Conclusions: The CNN significantly evaluated GFR for patients with CKD, and it showed better performance than traditional methods and GRNN model and closer to the results of 99mTc-DTPA. The experimental results demonstrated that CNN could be used to estimate GFR. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Unveiling Funded Research: Impact and Dual Innovation

SSRN

引用

SSRN 2023年

作者： Yang, Alex Jie School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China International Joint Informatics Laboratory Nanjing University Nanjing210023 China

In the relentless pursuit of scientific advancement, comprehending the profound impact and innovation nature inherent in funded research projects assumes paramount significance. To illuminate this matter, I delve into the realm of research supported by the esteemed National Institutes of Health (NIH) and the distinguished National Science Foundation (NSF). Our evaluative framework encompasses a spectrum of metrics, including the 5-year citation, normalized citation, and citation to patents, as markers of research impact. Moreover, I embrace ex-ante innovation (Novelty) and ex-post innovation (Disruption) as dual indispensable yardsticks for evaluating the innovative nature of research projects. Novelty denotes the manifestation of atypical combinations of existing knowledge, while Disruption signifies the extent of paradigm-shifting potential and the ability to exert a disruptive influence on future research endeavors. First, the analysis reveals that funded research projects manifest a conspicuously heightened impact in comparison to their non-funded counterparts. Second, I uncover a noteworthy finding, namely that funded research demonstrates significantly higher levels of ex-ante innovation (Novelty). However, in a surprising twist, the investigation also uncovers that funded research exhibits significantly lower levels of ex-post innovation (Disruption). Additionally, I undertake a meticulous scrutiny of the robustness of the research findings by scrutinizing patterns across disparate years and fields. This comprehensive analysis further unveils inconspicuous heterogeneity, thus substantiating the multifaceted nature of funded research and the vast potential for its innovation across various disciplines and temporal dimensions. © 2023, The Authors. All rights reserved.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Global and Adaptive Local Label Correlation for Multi-label Learning with Missing Labels

Global and Adaptive Local Label Correlation for Multi-label ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingxia Jiang Peipei Li Yuhong Zhang Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (the ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui Province China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei Anhui Province China

Label missing is a major challenge in multi-label learning. Many existing methods try to use label correlation to recover ground-truth labels, but they only focus on the label correlation within the original label space, however, the label correlation learned in this way is incomplete. Thus, inspired $b$ y the matrix adaptive column correlation, we propose a method to continuously adjust the label correlation matrix while the labels are filled in by adaptive column correlation learning method. Specifically, to reduce the impact of the missing label s on label correlation, the label space is firstly completed through manifold regularization while learning the local label information by adaptive column correlation learning in the complemented label space. Secondly, the global label correlation is utilized by adding a low-rank constraint to the entire label space. Finally, by jointly taking advantage of the global and adaptive local label correlation, our proposed approach achieves superior performance on both synthetic and real-world data sets from diverse domains compared to state-of-the art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Review-aware Graph Contrastive Learning Framework for Recommendation

arXiv

引用

arXiv 2022年

作者： Shuai, Jie Sun, Peijie Zhang, Kun Hong, Richang Li, Yong Wu, Le Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Beijing National Research Center for Information Science and Technology Department of Electronic Engineering Tsinghua University China

Most modern recommender systems predict users’ preferences with two components: user and item embedding learning, followed by the user-item interaction modeling. By utilizing the auxiliary review information accompanied with user ratings, many of the existing review-based recommendation models enriched user/item embedding learning ability with historical reviews or better modeled user-item interactions with the help of available user-item target reviews. Though significant progress has been made, we argue that current solutions for review-based recommendation suffer from two drawbacks. First, as review-based recommendation can be naturally formed as a user-item bipartite graph with edge features from corresponding user-item reviews, how to better exploit this unique graph structure for recommendation? Second, while most current models suffer from limited user behaviors, can we exploit the unique self-supervised signals in the review-aware graph to guide two recommendation components better? To this end, in this paper, we propose a novel Review-aware Graph Contrastive Learning (RGCL) framework for review-based recommendation. Specifically, we first construct a review-aware user-item graph with feature-enhanced edges from reviews, where each edge feature is composed of both the user-item rating and the corresponding review semantics. This graph with feature-enhanced edges can help attentively learn each neighbor node weight for user and item representation learning. After that, we design two additional contrastive learning tasks (i.e., Node Discrimination and Edge Discrimination) to provide self-supervised signals for the two components in recommendation process. Finally, extensive experiments over five benchmark datasets demonstrate the superiority of our proposed RGCL compared to the state-of-the-art baselines. Copyright © 2022, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Switchable Online knowledge Distillation

arXiv

引用

arXiv 2022年

作者： Qian, Biao Wang, Yang Yin, Hongzhi Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology China The University of Queensland

Online knowledge Distillation (OKD) improves the involved models by reciprocally exploiting the difference between teacher and student. Several crucial bottlenecks over the gap between them — e.g., Why and when does a large gap harm the performance, especially for student? How to quantify the gap between teacher and student? — have received limited formal study. In this paper, we propose Switchable Online knowledge Distillation (SwitOKD), to answer these questions. Instead of focusing on the accuracy gap at test phase by the existing arts, the core idea of SwitOKD is to adaptively calibrate the gap at training phase, namely distillation gap, via a switching strategy between two modes — expert mode (pause the teacher while keep the student learning) and learning mode (restart the teacher). To possess an appropriate distillation gap, we further devise an adaptive switching threshold, which provides a formal criterion as to when to switch to learning mode or expert mode, and thus improves the student’s performance. Meanwhile, the teacher benefits from our adaptive switching threshold and keeps basically on a par with other online arts. We further extend SwitOKD to multiple networks with two basis topologies. Finally, extensive experiments and analysis validate the merits of SwitOKD for classification over the state-of-the-arts. Our code is available at https://***/hfutqian/SwitOKD. Copyright © 2022, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Offline Reinforcement Learning via Conservative Smoothing and Dynamics Controlling

Offline Reinforcement Learning via Conservative Smoothing an...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Chinese Academy of Medical Sciences / Peking Union Medical College Institute of Medical Information / Medical Library China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Offline Reinforcement Learning (RL) optimizes policy using pre-collected data instead of direct environment interaction, offering a safe and cost-effective solution for sequential decision-making in the real world. However, it faces challenges such as distribution shift issues and vulnerability under perturbations. Researchers have developed various conservative methods to improve the robustness of offline RL. Nevertheless, model-based methods can result in transition distribution shift issues, while model-free value-based uncertainty penalty methods may not be sufficiently robust. To address these problems, we propose a new method called Robust Offline RL via Conservative Smoothing and Dynamics Controlling (RCSD). To achieve reliable value estimation of out-of-distribution (OOD) actions, RCSD uses both model-free uncertainty penalty and model-based simulation methods. It introduces a new one-step simulation method with conservative dynamics controlling to avoid value overestimation caused by transition distribution shifts. Moreover, RCSD considers both current and next states when generating OOD states to ensure cautious value estimation and efficient data utilization. RCSD uses conservative Q-smoothing and policy smoothing to strengthen the policy against sudden changes under perturbations. Experiments on D4RL benchmark demonstrate that RCSD can achieve state-of-the-art performance compared to baselines in either benchmark or adversarial attack tests.

关键词： Uncertainty Smoothing methods Perturbation methods Estimation Reinforcement learning Benchmark testing Signal processing Robustness Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

TREC: transient redundancy elimination-based convolution 22

TREC: transient redundancy elimination-based convolution

引用

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

作者： Jiawei Guan Feng Zhang Jiesong Liu Hsin-Hsuan Sung Ruofan Wu Xiaoyong Du Xipeng Shen Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Computer Science Department North Carolina State University

ISBN: (纸本)9781713871088

The intensive computations in convolutional neural networks (CNNs) pose challenges for resource-constrained devices; eliminating redundant computations from convolution is essential. This paper gives a principled method to detect and avoid transient redundancy, a type of redundancy existing in input data or activation maps and hence changing across inferences. By introducing a new form of convolution (TREC), this new method makes transient redundancy detection and avoidance an inherent part of the CNN architecture, and the determination of the best configurations for redundancy elimination part of CNN backward propagation. We provide a rigorous proof of the robustness and convergence of TREC-equipped CNNs. TREC removes over 96% computations and achieves 3.51× average speedups on microcontrollers with minimal (about 0.7%) accuracy loss.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Charge Prediction with Multi-grained Features and Mutual Information 20

Few-Shot Charge Prediction with Multi-grained Features and M...

引用

20th China National Conference on Computational Linguistics, CCL 2021

作者： Zhang, Han Dou, Zhicheng Zhu, Yutao Wen, Jirong School of Information Renmin University of China Beijing China Gaoling School of Artificial Intelligence Renmin University of China Beijing China Université de Montréal Montreal Canada Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

ISBN: (纸本)9783030841850

Charge prediction aims to predict the final charge for a case according to its fact description and plays an important role in legal assistance systems. With deep learning based methods, prediction on high-frequency charges has achieved promising results but that on few-shot charges is still challenging. In this work, we propose a framework with multi-grained features and mutual information for few-shot charge prediction. Specifically, we extract coarse- and fine-grained features to enhance the model’s capability on representation, based on which the few-shot charges can be better distinguished. Furthermore, we propose a loss function based on mutual information. This loss function leverages the prior distribution of the charges to tune their weights, so the few-shot charges can contribute more on model optimization. Experimental results on several datasets demonstrate the effectiveness and robustness of our method. Besides, our method can work well on tiny datasets and has better efficiency in the training, which provides better applicability in real scenarios. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：