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

Aligning Recommendation and Conversation via Dual Imitation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhou, Jinfeng Wang, Bo Huang, Minlie Zhao, Dongming Huang, Kun He, Ruifang Hou, Yuexian College of Intelligence and Computing Tianjin University Tianjin China State Key Laboratory of Communication Content Cognition People’s Daily Online Beijing China The CoAI Group DCST Institute for Artificial Intelligence State Key Lab of Intelligent Technology and Systems Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China AI Lab China Mobile Communication Group Tianjin Co. Ltd. China

Human conversations of recommendation naturally involve the shift of interests which can align the recommendation actions and conversation process to make accurate recommendations with rich explanations. However, existing conversational recommendation systems (CRS) ignore the advantage of user interest shift in connecting recommendation and conversation, which leads to an ineffective loose coupling structure of CRS. To address this issue, by modeling the recommendation actions as recommendation paths in a knowledge graph (KG), we propose DICR (Dual Imitation for Conversational Recommendation), which designs a dual imitation to explicitly align the recommendation paths and user interest shift paths in a recommendation module and a conversation module, respectively. By exchanging alignment signals, DICR achieves bidirectional promotion between recommendation and conversation modules and generates high-quality responses with accurate recommendations and coherent explanations. Experiments demonstrate that DICR outperforms the state-of-the-art models on recommendation and conversation performance with automatic, human, and novel explainability metrics. © 2022, CC BY.

关键词： Knowledge graph

DeepContact: High throughput quantification of membrane contact site based on electron microscopy imaging

学校读者我要写书评

暂无评论

DeepContact: High throughput quantification of membrane cont...

2022生物物理大会

作者： Liqing Liu Shuxin Yang Yang Liu Xixia Li Junjie Hu Li Xiao Tao Xu National Laboratory of Biomacromolecules Institute of Biophysics Chinese Academy of Sciences Center for Biological Imaging Institute of Biophysics Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences College of Life Science University of Chinese Academy of Sciences Ningbo HuaMei Hospital University of Chinese Academy of Sciences School of Biomedical Engineering Guangzhou Medical University

Membrane contact site (MCS)-mediated organelle interactions plays essential roles in the cell. Quantitative analysis of the MCS reveals vital clues for cellular responses under various physiological and pathological conditions. However, an efficient tool is lacking. Here, we developed "DeepContact", a deep learning protocol for optimizing organelle segmentation and contact analysis based on lab.l-free electron microscopy(EM).

关键词： DeepContact High throughput quantification of membrane contact site based on electron microscopy imaging

Exploiting sample correlation for crowd counting with multi-expert network

学校读者我要写书评

暂无评论

Exploiting sample correlation for crowd counting with multi-...

International Conference on Computer Vision (ICCV)

作者： Xinyan Liu Guorong Li Zhenjun Han Weigang Zhang Yifan Yang Qingming Huang Nicu Sebe University of Chinese Academy of Sciences Beijing China Key Lab of Big Data Mining and Knowledge Management UCAS Beijing China Harbin Institute of Technology Weihai China Key Lab of Intelligent Information Processing ICT CAS Beijing China University of Trento Trento Italy

ISBN: (纸本)9781665428132

Crowd counting is a difficult task because of the diversity of scenes. Most of the existing crowd counting methods adopt complex structures with massive backbones to enhance the generalization ability. Unfortunately, the performance of existing methods on large-scale data sets is not satisfactory. In order to handle various scenarios with less complex network, we explored how to efficiently use the multi-expert model for crowd counting tasks. We mainly focus on how to train more efficient expert networks and how to choose the most suitable expert. Specifically, we propose a task-driven similarity metric based on sample’s mutual enhancement, referred as co-fine-tune similarity, which can find a more efficient subset of data for training the expert network. Similar samples are considered as a cluster which is used to obtain parameters of an expert. Besides, to make better use of the proposed method, we design a simple network called FPN with Deconvolution Counting Network, which is a more suitable base model for the multi-expert counting network. Experimental results show that multiple experts FDC (MFDC) achieves the best performance on four public data sets, including the large scale NWPU-Crowd data set. Furthermore, the MFDC trained on an extensive dense crowd data set can generalize well on the other data sets without extra training or fine-tuning. 1

关键词： Training Measurement Computer vision Deconvolution Correlation Design methodology Training data

Quantifying the Dynamics of Harm Caused by Retracted Research

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Huang, Yunyou Zhao, Jiahui Cui, Dandan Yang, Zhengxin Xia, Bingjie Liang, Qi Liu, Wenjing Ma, Li Tang, Suqin Hao, Tianyong Zhang, Zhifei Gao, Wanling Zhan, Jianfeng Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science South China Normal University Guangzhou510631 China Guangxi Key Lab of Multi-Source Information Mining and Security Guangxi Normal University Guilin541004 China Department of Physiology and Pathophysiology Capital Medical University Beijing100069 China The second Affiliated hospital of Guilin medical university Guilin541004 China Guilin Medical University Guilin541100 China XuanJi Technology Co. Ltd. Guilin541012 China University of Chinese Academy of Sciences Beijing100086 China The International Open Benchmark Council Delaware19801 United States

Despite enormous efforts devoted to understanding the characteristics and impacts of retracted papers, little is known about the mechanisms underlying the dynamics of their harm and the dynamics of its propagation. Here, we propose a citation-based framework to quantify the harm caused by retracted papers, aiming to uncover why their harm persists and spreads so widely. We uncover an "attention escape" mechanism, wherein retracted papers postpone significant harm, more prominently affect indirectly citing papers, and inflict greater harm on citations in journals with an impact factor less than 10. This mechanism allows retracted papers to inflict harm outside the attention of authors and publishers, thereby evading their intervention. This study deepens understanding of the harm caused by retracted papers, emphasizes the need to activate and enhance the attention of authors and publishers, and offers new insights and a foundation for strategies to mitigate their harm and prevent its spread. Copyright © 2024, The Authors. All rights reserved.

关键词：

A Recommender System for Metaheuristic Algorithms for Continuous Optimization Based on Deep Recurrent Neural Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Artificial Intelligence

IEEE Transactions on Artificial Intelligence 2020年第1期1卷 5-18页

作者： Tian, Ye Peng, Shichen Zhang, Xingyi Rodemann, Tobias Tan, Kay Chen Jin, Yaochu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei 230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230601 China Honda Research Institute Europe Offenbach 63073 Germany Department of Computer Science City University of Hong Kong Kowloon Tong Hong Kong Hong Kong Department of Computer Science University of Surrey Guildford GU2 7XH United Kingdom Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang 110819 China

As revealed by the no free lunch theorem, no single algorithm can outperform any others on all classes of optimization problems. To tackle this issue, methods for recommending an existing algorithm for solving given problems have been proposed. However, existing recommendation methods for continuous optimization suffer from low practicability and transferability, mainly due to the difficulty in extracting features that can effectively describe the problem structure and lack of data for training a recommendation model. This work proposes a generic recommender system to address the above two challenges. First, a novel method is proposed to represent an analytic objective function of a continuous optimization problem as a tree, which is directly used as the features of the problem. For black-box optimization problems whose objective function is unknown, a symbolic regressor is adopted to estimate the tree structure. Second, a large number of benchmark problems are randomly created based on the proposed tree representation, providing an abundant amount of training data with various levels of difficulty. By employing a deep recurrent neural network, a recommendation model is trained to recommend a most suitable metaheuristic algorithm for white- or black-box optimization, making a significant step forward towards fully automated algorithm recommendation for continuous optimization. Experimental results on 100 000 benchmark problems show that the proposed recommendation model achieves considerably better performance than existing ones, and exhibits high transferability to real-world problems. Impact Statement—Real-world optimization problems, such as aerodynamic design of turbine engines and automated trading, have been successfully solved by metaheuristics. However, practitioners are confronted with the challenge of how to choose an appropriate metaheuristic algorithm to solve a particular instance of these problems. This paper proposes a recommender system that can auto

关键词： Algorithm recommendation continuous optimization problem decision tree deep recurrent neural network metaheuristics symbolic regression

Neural Network-Assisted Hybrid Model Based Message Passing for Parametric Holographic MIMO Near Field Channel Estimation

学校读者我要写书评

暂无评论

IEEE Transactions on Wireless Communications 2025年

作者： Yuan, Zhengdao Guo, Yabo Gao, Dawei Guo, Qinghua Wang, Zhongyong Huang, Chongwen Jin, Ming Wong, Kai-Kit Henan Open University Artificial Intelligence Technology Engineering Research Center Zhengzhou450002 China University of Wollongong School of Electrical Computer and Telecommunications Engineering WollongongNSW2522 Australia Zhengzhou University School of Information Engineering Zhengzhou450002 China Xidian University Hangzhou Institute of Technology Hangzhou311200 China University of Wollongong School of Electrical Computer and Telecommunications Engineering NSW2522 Australia Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China Ningbo University Faculty of Electrical Engineering and Computer Science Ningbo315211 China University College London Department of Electronic and Electrical Engineering Torrington Place WC1E 7JE United Kingdom Yonsei University Yonsei Frontier Lab Seoul Korea Republic of

Holographic multiple-input and multiple-output (HMIMO) is a promising technology with the potential to achieve high energy and spectral efficiencies, enhance system capacity and diversity, etc. In this work, we address the challenge of HMIMO near field (NF) channel estimation, which is complicated by the intricate model introduced by the dyadic Green's function. Despite its complexity, the channel model is governed by a limited set of parameters. This makes parametric channel estimation highly attractive, offering substantial performance enhancements and enabling the extraction of valuable sensing parameters, such as user locations, which are particularly beneficial in mobile networks. However, the relationship between these parameters and channel gains is nonlinear and compounded by integration, making the estimation a formidable task. To tackle this problem, we propose a novel neural network (NN) assisted hybrid method. With the assistance of NNs, we first develop a novel hybrid channel model with a significantly simplified expression compared to the original one, thereby enabling parametric channel estimation. Using the readily availab.e training data derived from the original channel model, the NNs in the hybrid channel model can be effectively trained offline. Then, building upon this hybrid channel model, we formulate the parametric channel estimation problem with a probabilistic framework and design a factor graph representation for Bayesian estimation. Leveraging the factor graph representation and unitary approximate message passing (UAMP), we develop an effective message passing-based Bayesian channel estimation algorithm. Extensive simulations demonstrate the superior performance of the proposed method. © 2025 IEEE.

关键词： Green's function

Global-and-Local Collab.rative Learning for Co-Salient Object Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cong, Runmin Yang, Ning Li, Chongyi Fu, Huazhu Zhao, Yao Huang, Qingming Kwong, Sam The Institute of Information Science Beijing Jiaotong University Beijing100044 China The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The Department of Computer Science City University of Hong Kong Hong Kong The School of Computer Science and Engineering Nanyang Technological University Singapore A*STAR Singapore The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Peng Cheng Laboratory Shenzhen518055 China The City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

The goal of co-salient object detection (CoSOD) is to discover salient objects that commonly appear in a query group containing two or more relevant images. Therefore, how to effectively extract inter-image correspondence is crucial for the CoSOD task. In this paper, we propose a global-and-local collab.rative learning architecture, which includes a global correspondence modeling (GCM) and a local correspondence modeling (LCM) to capture comprehensive inter-image corresponding relationship among different images from the global and local perspectives. Firstly, we treat different images as different time slices and use 3D convolution to integrate all intra features intuitively, which can more fully extract the global group semantics. Secondly, we design a pairwise correlation transformation (PCT) to explore similarity correspondence between pairwise images and combine the multiple local pairwise correspondences to generate the local inter-image relationship. Thirdly, the inter-image relationships of the GCM and LCM are integrated through a global-and-local correspondence aggregation (GLA) module to explore more comprehensive inter-image collab.ration cues. Finally, the intra- and inter-features are adaptively integrated by an intra-and-inter weighting fusion (AEWF) module to learn co-saliency features and predict the co-saliency map. The proposed GLNet is evaluated on three prevailing CoSOD benchmark datasets, demonstrating that our model trained on a small dataset (about 3k images) still outperforms eleven state-of-the-art competitors trained on some large datasets (about 8k̴200k images). © 2022, CC BY-NC-SA.

关键词： Convolution

MaxMatch: Semi-Supervised Learning with Worst-Case Consistency

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jiang, Yangbangyan Li, Xiaodan Chen, Yuefeng He, Yuan Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China Security Department of Alibaba Group Hangzhou311121 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Shenzhen518107 China University of Chinese Academy of Sciences Beijing101408 China Peng Cheng Laboratory Shenzhen518055 China

In recent years, great progress has been made to incorporate unlab.led data to overcome the inefficiently supervised problem via semi-supervised learning (SSL). Most state-of-the-art models are based on the idea of pursuing consistent model predictions over unlab.led data toward the input noise, which is called consistency regularization. Nonetheless, there is a lack of theoretical insights into the reason behind its success. To bridge the gap between theoretical and practical results, we propose a worst-case consistency regularization technique for SSL in this paper. Specifically, we first present a generalization bound for SSL consisting of the empirical loss terms observed on lab.led and unlab.led training data separately. Motivated by this bound, we derive an SSL objective that minimizes the largest inconsistency between an original unlab.led sample and its multiple augmented variants. We then provide a simple but effective algorithm to solve the proposed minimax problem, and theoretically prove that it converges to a stationary point. Experiments on five popular benchmark datasets validate the effectiveness of our proposed method. Copyright © 2022, The Authors. All rights reserved.

关键词： Image classification

A Review of Artificial Fish Swarm Algorithms: Recent Advances and Applications

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pourpanah, Farhad Wang, Ran Lim, Chee Peng Wang, Xi-Zhao Yazdani, Danial College of Mathematics and Statistics Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Department of Electrical and Computer Engineering University of Windsor Canada College of Mathematics and Statistics Shenzhen Key Lab. of Advanced Machine Learning and Applications Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China Institute for Intelligent Systems Research and Innovation Deakin University Australia College of Computer Science and Software Engineering Guangdong Key Lab. of Intelligent Information Processing Shenzhen University China School of Computer Science and Engineering Southern University of Science and Technology China

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming and following behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the continuous AFSA, encompassing the original ASFA, its improvements and hybrid models, as well as their associated applications. We focus on articles published in high-quality journals since 2013. Our review provides insights into AFSA parameters modifications, procedure and sub-functions. The main reasons for these enhancements and the comparison results with other hybrid methods are discussed. In addition, hybrid, multi-objective and dynamic AFSA models that have been proposed to solve continuous optimization problems are elucidated. We also analyse possible AFSA enhancements and highlight future research directions for advancing AFSA-based models. Copyright © 2020, The Authors. All rights reserved.

关键词： Multiobjective optimization