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

When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactions

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Chunxu Zhang, Zijian Long, Guodong Yan, Peng Zhou, Tianyi Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China College of Computer Science and Technology Jilin University City University of Hong Kong China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia Computer Science and UMIACS University of Maryland Maryland United States

Federated recommendation systems usually trains a global model on the server without direct access to users’ private data on their own devices. However, this separation of the recommendation model and users’ private data poses a challenge in providing quality service, particularly when it comes to new items, namely cold-start recommendations in federated settings. This paper introduces a novel method called Item-aligned Federated Aggregation (IFedRec) to address this challenge. It is the first research work in federated recommendation to specifically study the cold-start scenario. The proposed method learns two sets of item representations by leveraging item attributes and interaction records simultaneously. Additionally, an item representation alignment mechanism is designed to align two item representations and learn the meta attribute network at the server within a federated learning framework. Experiments on four benchmark datasets demonstrate IFedRec’s superior performance for cold-start scenarios. Furthermore, we also verify IFedRec owns good robustness when the system faces limited client participation and noise injection, which brings promising practical application potential in privacy-protection enhanced federated recommendation systems. The implementation code is available1 Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

Automatic Controversy Detection Based on Heterogeneous Signed Attributed Network and Deep Dual-Layer Self-Supervised Community Analysis

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Li, Ying Zhang, Xiao Liang, Yu Li, Qianqian Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Qianjin Street Jilin Changchun130012 China Institutes of Science and Development Chinese Academy of Sciences ZhongGuanCun BeiYiTiao Beijing100190 China School of Public Policy and Management University of Chinese Academy of Sciences ShiJingShan YuQuanLu Beijing100049 China

Controversial analysis entails identifying and scrutinizing contentious events or issues within a specific domain. Detecting controversy, particularly on social media, poses challenges due to the need to consider numerous contents and user interactions. Unlike previous work, rather than studying controversy on limited knowledge of the topic discussion, we introduce multidimensional and heterogeneous information to conduct a comprehensive evaluation. Our method to quantify controversy is based on heterogeneous signed attributed network. This framework constructs a comprehensive heterogeneous signed attributed network to integrate diverse semantic and structural information on social media, encompassing user, retweet, comment, summary, topic, sentiment information, and user attributes. We introduce a deep dual-layer self-supervised algorithm for community detection and controversial analysis within this network. We gauge controversy levels in hot events via community distinctions, betweenness centrality, and user representations. Extensive comparisons of state-of-the-art baseline approaches are performed. We find that existing methods shows instability on different datasets. Whereas our approach integrates the multidimensional features of topics and also takes into account various computational results, our method consistently yields stable results. A user-friendly web server has been developed for accessible analysis of other hot events (http://***/contro/). © 2023, The Authors. All rights reserved.

关键词： Social networking (online)

Aggregation tree constructing algorithm based on energy consumption assessment

学校读者我要写书评

暂无评论

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2008年第1期45卷 104-109页

作者： Sun, Dayang Liu, Yanheng Wang, Aimin College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China College of Computer Science and Technology Harbin Engineering University Harbin 150001 China

This paper first gives an analysis of data aggregation and data compression based on energy consumption of sensor nodes, after which an approach is proposed to construct an aggregation tree in the case of non-perfect aggregation, since GIT considers only the case of perfect aggregation and it does not work well if the aggregation is non-perfect. An assessment scheme that can get the information of hops from the aggregation point to the sink and the hops from the aggregation point to the source node is used to construct such an aggregation tree. Moreover, the energy consumption of the aggregation is also considered. This scheme can be used when perfect aggregation cannot be performed. In this paper, an approach to reduce the cost of reinforcement is also proposed, in which the reinforcement work is done by the source nodes themselves, not by the sink node. Simulation result shows that this approach can save more energy than GIT when the aggregation ratio is small. This result also provides a theoretical limit of aggregation to tell when GIT will lose its superiority and thus gives a direction to choose among the aggregation algorithms. Another result shows that the further the sources are away from the sink, the less reinforcement messages are needed. Finally a guidance to tell when to use the EGA (energy consumption assessment) scheme is given.

关键词： Wireless sensor networks

Digital Mahjong System: Towards Precise Cognitive Assessment with IoT Technologies 1

学校读者我要写书评

暂无评论

24th International Conference on Human-Computer Interaction, HCII 2022

作者： An, Ning Hu, Enze Guo, Yanrui Yang, Jiaoyun Au, Rhoda Ding, Huitong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shenzhen Corecloud Innovation Technology Co. Ltd. Shenzhen China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China Department of Anatomy and Neurobiology Neurology and Framingham Heart Study Boston University School of Medicine Boston United States Department of Epidemiology Boston University School of Public Health Boston United States

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

To the best of our knowledge, this paper is the first to apply IoT technologies to transform the popular Mahjong game into a Digital Mahjong System (DMS) for digitally performing cognitive assessments. People have started exploring digital cognitive assessment tools for better objectivity and simplification. However, most of these tools are not friendly for older adults. This paper aims to address this issue by integrating IoT technologies with Mahjong to make cognitive assessment simpler and more engaging for older adults. DMS has the following features: 1) integrating motion tracking devices into Mahjong tiles and transferring them into Digital Mahjong Tiles (DMTs), which can precisely capture their moving trajectory during the assessment, 2) using a Near Field Communication reader to configure DMT’s primary data, 3) supporting Over-The-Air Device Firmware Update that can be done remotely via Bluetooth, and 4) developing a charging base that can charge 16 DMTs simultaneously using Qi wireless charging standard. With further testing, the DMS has the potential to become a digital platform to implement and test various cognitive assessment tools integrating Mahjong elements. © 2022, Springer Nature Switzerland AG.

关键词： Internet of things

A Novel Drug-Drug Interaction Prediction Model Based on Line Subgraph Generation Strategy

学校读者我要写书评

暂无评论

A Novel Drug-Drug Interaction Prediction Model Based on Line...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Chu Li Xinyue Peng Haotian Guan Zefan Zhang Guishen Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of Software Jilin University Changchun China School of Nursing Jilin University Changchun China School of Life Sciences Jilin University Changchun China College of Computer Science and Engineering Changchun University of Technology Changchun China

Drug-Drug Interaction (DDI) prediction task is helpful for better-understanding drugs. In this paper, we propose a novel drug-drug interaction prediction model based on line subgraph generation strategy, named DDI-LSG model. Our DDI-LSG model consists of three main parts which include drug relation graph construction, line subgraph generation strategy, and graph-level classification. To consider more relationships among drugs, we propose a node feature-enhancing method to encode drug features in drug relation graph construction process. To consider drugs and DDI as equivalent factors of our DDI-LSG model, we introduce line graph transformation to integrate DDI with drug feature enhancing vector. Combining Jaccard similarity with cosine similarity, we propose a line subgraph generation strategy to evaluate node relation and extract key structures around target DDI in the line graph. Then, we reformulate the DDI prediction task into a graph-level classification task for the line subgraph of the target DDI. Therefore, in the final part of our DDI-LSG model, we use a graph-level classifier to classify the line subgraphs. Our DDI-LSG model outperforms better experiment results than baselines. Ablation results have validated the node feature enhancing method and line subgraph generation strategy.

关键词：

Multi-objective Aerial Collaborative Secure Communication Optimization via Generative Diffusion Model-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wu, Qingqing Wang, Jiacheng Niyato, Dusit Liu, Yuanwei The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The College of Computer Science and Technology Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

Due to flexibility and low-cost, unmanned aerial vehicles (UAVs) are increasingly crucial for enhancing coverage and functionality of wireless networks. However, incorporating UAVs into next-generation wireless communication systems poses significant challenges, particularly in sustaining high-rate and long-range secure communications against eavesdropping attacks. In this work, we consider a UAV swarm-enabled secure surveillance network system, where a UAV swarm forms a virtual antenna array to transmit sensitive surveillance data to a remote base station (RBS) via collaborative beamforming (CB) so as to resist mobile eavesdroppers. Specifically, we formulate an aerial secure communication and energy efficiency multi-objective optimization problem (ASCEE-MOP) to maximize the secrecy rate of the system and to minimize the flight energy consumption of the UAV swarm. To address the non-convex, NP-hard and dynamic ASCEE-MOP, we propose a generative diffusion model-enabled twin delayed deep deterministic policy gradient (GDMTD3) method. Specifically, GDMTD3 leverages an innovative application of diffusion models to determine optimal excitation current weights and position decisions of UAVs. The diffusion models can better capture the complex dynamics and the trade-off of the ASCEE-MOP, thereby yielding promising solutions. Simulation results highlight the superior performance of the proposed approach compared with traditional deployment strategies and some other deep reinforcement learning (DRL) benchmarks. Moreover, performance analysis under various parameter settings of GDMTD3 and different numbers of UAVs verifies the robustness of the proposed approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy efficiency

Iterated fractal based on distance ratio

学校读者我要写书评

暂无评论

Ruan Jian Xue Bao/Journal of Software 2006年第SUPPL.期17卷 70-77页

作者： Zhang, Xi-Zhe Lu, Tian-Yang Wang, Zheng-Xuan College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China Department of Computer Science and Technology Harbin Engineering University Harbin 150001 China

The escape time algorithm cannot render the convergence region of mapping, so there are some black regions in escape time fractal. In this paper, a novel method is presented to construct fractal image, which is named the distance ratio iteration method. This method performs iteration on two points and render fractal image by using their distance ratio convergence times. Taking complex mapping z←zα+c as example, the generalized Mandelbrot and Julia sets are constructed based on distance ratio and their visual properties are analyzed. The result fractal image has complex and self-similarity structure in inner convergence region. It is proved that the boundary of distance ratio fractal is the same as M-J set when α>0, and some visual structure of it with various exponent α are discussed. When α<0, the generalized Mandelbrot and Julia set based on distance ratio have some complex structures which M-J set does not have.

关键词： Computer graphics

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

M3oE: Multi-Domain Multi-Task Mixture-of-Experts Recommendation Framework

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Zijian Cai, Qingpeng Liu, Ziru Hu, Lantao Liu, Shuchang Zhao, Xiangyu Liu, Qidong Jiang, Peng Yu, Jiaao Zhang, Chunxu Zhao, Hongwei Gai, Kun Jilin University City University of Hong Kong Jilin China Kuaishou Technology Beijing China City University of Hong Kong Hong Kong Xi’an Jiaotong University City University of Hong Kong Xi’an China Jilin University Jilin China Beijing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

Multi-domain recommendation and multi-task recommendation have demonstrated their effectiveness in leveraging common information from different domains and objectives for comprehensive user modeling. Nonetheless, the practical recommendation usually faces multiple domains and tasks simultaneously, which cannot be well-addressed by current methods. To this end, we introduce M3oE, an adaptive Multi-domain Multi-task Mixture-of-Experts recommendation framework. M3oE integrates multi-domain information, maps knowledge across domains and tasks, and optimizes multiple objectives. We leverage three mixture-of-experts modules to learn common, domain-aspect, and task-aspect user preferences respectively to address the complex dependencies among multiple domains and tasks in a disentangled manner. Additionally, we design a two-level fusion mechanism for precise control over feature extraction and fusion across diverse domains and tasks. The framework’s adaptability is further enhanced by applying AutoML technique, which allows dynamic structure optimization. To the best of the authors’ knowledge, our M3oE is the first effort to solve multi-domain multi-task recommendation self-adaptively. Extensive experiments on two benchmark datasets against diverse baselines demonstrate M3oE’s superior performance. The implementation code is available to ensure reproducibility1 Copyright © 2024, The Authors. All rights reserved.

关键词： Recommender systems