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

Proceedings of the 40th ACM/SIGAPP Symposium on Applied Computing

作者： Cristina Herruzo-Lodeiro Francesc Rodríguez-Díaz Alicia Troncoso María Martínez-Ballesteros Department of Languages and Computer Systems University of Seville Sevilla Spain Data Science and Big Data Lab Pablo de Olavide University Sevilla Spain

ISBN: (纸本)9798400706295

The social impact and global health crisis caused by the coronavirus since late 2019 led to the development of a novel bio-inspired algorithm. This algorithm simulates the behavior and spread of the virus, known as the Coronavirus Optimization Algorithm. It provides several advantages over similar approaches and serves as a basis for generalizing pattern or association identification from numerical datasets. In this study, essential updates and modifications are proposed to adapt the CVOA algorithm for mining numerical association rules. These changes involve adjustments to the encoding of individuals and the infection/mutation process. Additionally, parameter values are updated, and a new fitness function is proposed to be maximized. The main objective is to obtain high-quality numerical association rules for any dataset regardless of the number and range of attributes in the dataset. The implemented algorithm is compared to others designed for mining quantitative association rules in order to validate the results. For this reason, different datasets from the BUFA repository are used, confirming that Coronavirus Optimization Algorithm is a promising option for discovering interesting association rules within numerical datasets.

关键词： evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

FedRKG: A Privacy-Preserving Federated Recommendation Framework via Knowledge Graph Enhancement 18th

FedRKG: A Privacy-Preserving Federated Recommendation Framew...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Yao, Dezhong Liu, Tongtong Cao, Qi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9789819998951

Federated Learning (FL) has emerged as a promising approach for preserving data privacy in recommendation systems by training models locally. Recently, Graph Neural Networks (GNN) have gained popularity in recommendation tasks due to their ability to capture high-order interactions between users and items. However, privacy concerns prevent the global sharing of the entire user-item graph. To address this limitation, some methods create pseudo-interacted items or users in the graph to compensate for missing information for each client. Unfortunately, these methods introduce random noise and raise privacy concerns. In this paper, we propose FedRKG, a novel federated recommendation system, where a global knowledge graph (KG) is constructed and maintained on the server using publicly available item information, enabling higher-order user-item interactions. On the client side, a relation-aware GNN model leverages diverse KG relationships. To protect local interaction items and obscure gradients, we employ pseudo-labeling and Local Differential Privacy (LDP). Extensive experiments conducted on three real-world datasets demonstrate the competitive performance of our approach compared to centralized algorithms while ensuring privacy preservation. Moreover, FedRKG achieves an average accuracy improvement of 4% compared to existing federated learning baselines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations

Inductive Relation Prediction with Logical Reasoning Using C...

引用

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

作者： Pan, Yudai Liu, Jun Zhang, Lingling Zhao, Tianzhe Lin, Qika Hu, Xin Wang, Qianying School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Lenovo Research Beijing China

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with SOTA inductive baselines. © 2022 Association for Computational Linguistics.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Fraud Detection of Electricity Consumption Using Robust Exponential and Holt-Winters Smoothing Method 6

Fraud Detection of Electricity Consumption Using Robust Expo...

引用

6th IEEE International Conference on Advanced Systems and Emergent Technologies, IC_ASET 2023

作者： Azzouguer, Dalila Sebaa, Abderrazak Hadjout, Dalil Martínez-Álvarez, Francisco École Supérieure en Sciences et Technologies de l'Informatique et du Numérique Laboratoire Litan RN 75 Bejaia Amizour6300 Algeria Pablo de Olavide University Data Science & Big Data Lab Spain

ISBN: (纸本)9798350321029

Non-technical losses (NTL), especially fraud detection is very important for electricity distribution enterprises. Fraud detection allows for maximizing the effective economic return for such enterprises. This paper provides an electricity fraud detection approach based on robust exponential and Holt-Winters Smoothing methods. The proposed approach is a procedure that aims to discover the fraudulent behavior of electricity consumers and goes through three crucial steps: (1) the prediction of monthly consumption, (2) the detection of abnormal consumption of electrical meters, and (3) the detection of fraud cases of economic customers. The proposed model was trained and evaluated. Its experimental validation is achieved by using a large dataset of real users from the Algerian economic sector with almost 2000 clients and 14 years of monthly electricity consumption. The proposed solution revealed good performance compared to the literature and the comparison with the models implemented in this article: SARIMA for prediction and two sigma for anomaly detection. The results show highly efficient and realistic countermeasures to fraud detection, which leads us to say that this method is robust and can enhance company profit. © 2023 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Deep Knowledge Tracing with Concept Trees 9th

Deep Knowledge Tracing with Concept Trees

引用

19th International Conference on Advanced data Mining and Applications, ADMA 2023

作者： Zhang, Yupei An, Rui Zhang, Wenxin Liu, Shuhui Shang, Xuequn School of Computer Science Northwestern Polytechnical University Xi’an China MIIT Big Data Storage and Management Lab Xi’an China Department of Automation Tsinghua University Beijing China

ISBN: (纸本)9783031466632

Knowledge tracing aims to diagnose the student’s knowledge status and predict the responses to the next questions, which is a critical task in personalized learning. The existing studies consider more academic features, while this paper introduces DKCT, a deep knowledge tracing model with concept trees, to integrate the hierarchical concept tree that describes the structure of concepts in a question. DKCT casts the knowledge concept tree (KCT) in a question from the views of feature, breadth, and difficulty into a KCT representation at first. Then, DKCT is composed of an encoder network with multi-head attention on the question representations and a decoder network with multi-head attention on the interaction embeddings. Finally, DKCT integrates the student embeddings by using fully connected networks to predict the responses to the next questions. Extensive experiments conducted on two real-world educational datasets show that DKCT has a higher prediction accuracy than the currently popular KT models. This work paves the way to consider KCT for knowledge tracing. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding 40

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Cheng, Feng Xiao, Jiang Liu, Cunyang Zhang, Shijie Zhou, Yifan Li, Bo Li, Baochun Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab China Hong Kong University of Science and Technology Hong Kong University of Toronto Canada

ISBN: (纸本)9798350317152

Directed Acyclic Graph (DAG)-based blockchain (a.k.a distributed ledger) has become prevalent for supporting highly concurrent applications. Its inherent parallel data structure accelerates block generation significantly, shifting the bottleneck from performance to storage scalability. An intuitive solution is to apply state sharding that divides the entire ledger (i.e., transactions and states) into multiple shards. While each node only stores proportional transactions, it suffers from the challenges of storing and ensuring the processing consistency of cross-shard transactions. In this paper, we propose SharDAG, a new mechanism that leverages adaptive sharding for DAG-based blockchains to achieve high performance and strong consistency. The key idea of SharDAG is to exploit unique characteristics -silent assets -and design a lightweight processing mechanism based on avatar account caching. Furthermore, we design a Byzantine resilient cross-shard verification mechanism with a theoretically optimal number of participating nodes, which guarantees the consistency and security of avatar account aggregation. Our comprehensive evaluations on real-world workloads demonstrate that SharDAG presents up to 3.8 x throughput improvement compared to the state-of-the-art and reduces the storage overhead of cross-shard transactions. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Real-World Wireless Network Modeling and Optimization:From Model/data-Driven Perspective

引用

Chinese Journal of Electronics 2022年第6期31卷 991-1012页

作者： LI Yang ZHANG Shutao REN Xiaohui ZHU Jianhang HUANG Jiajie HE Pengcheng SHEN Kaiming YAO Zhiqiang GONG Jie CHANG Tsunghui SHI Qingjiang LUO Zhiquan Shenzhen Research Institute of Big Data Pengcheng Lab School of Science and Engineering The Chinese University of Hong Kong (Shenzhen) College of Mathematics and Computational Sciences Xiangtan University School of Computer Science and Engineering Sun Yat-Sen University School of Software Engineering Tongji University

With the rapid development of the fifth-generation wireless communication systems, a profound revolution in terms of transmission capacity, energy efficiency, reliability, latency, and connectivity is highly expected to support a new batch of industries and applications. To achieve this goal, wireless networks are becoming extremely dynamic, heterogeneous, and complex. The modeling and optimization for the performance of realworld wireless networks are extremely challenging due to the difficulty to predict the network performance as a function of network parameters, and the prohibitively huge number of parameters to optimize. The conventional network modeling and optimization approaches rely on drive test, trial-and-error, and engineering experience,which are labor intensive, error-prone, and far from optimal. On the other hand, while the research community has spent significant efforts in understanding the fundamental limits of radio channels and developing physical layer techniques to operate close to it, very little is known about the performance limits of wireless networks, where millions of radio channels interact with one another in complex manners. This paper reviews the very recent mathematical and learning based techniques for modeling and optimizing the performance of real-world wireless networks in five aspects, including channel modeling, user demand and traffic modeling, throughput modeling and prediction, network parameter optimization, and IRS empowered performance optimization, and also presents the corresponding notable performance gains.

关键词： network parameter optimization telecommunication computing optimisation mathematical techniques wireless channels performance optimization learning based techniques telecommunication traffic mathematical analysis physical layer techniques channel modeling wireless network modeling fifth generation wireless communication systems learning (artificial intelligence) model-data-driven perspective IRS empowered performance optimization radio channels traffic modeling radio networks

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Interest Modeling of Long-tailed Users for Click-Through Rate Prediction 39

Hierarchical Interest Modeling of Long-tailed Users for Clic...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Xie, Xu Niu, Jin Deng, Lifang Wang, Dan Zhang, Jiandong Wu, Zhihua Bian, Kaigui Cao, Gang Cui, Bin China Alibaba Group China Lazada National Engineering Lab for Big Data Analysis and Applications China China Peking University Institute of Computational Social Science Qingdao China

ISBN: (纸本)9798350322279

Click-through rate (CTR) prediction, whose purpose is to predict the probability of a user clicking on an item, plays a pivotal role in recommender systems. Capturing users' accurate preferences from their historical interactions (e.g., clicks) is an essential step for handling this task and has aroused wide concern in both academia and industry. However, most of the previous methods focus on the users with abundant clicks and ill-serve the users who rarely click or purchase items. Though the ratio of these long-tailed users may be small on popular platforms, such as Amazon and Taobao, they are the majority on the newborn e-commerce company like Lazada. To extract the interests of long-tailed users, several works attempt to integrate the side information, such as demographic features. Nevertheless, these features are usually not available and may even lead to privacy concerns. Therefore, how to utilize the noisy and limited clicks becomes the key *** this paper, we propose a novel model called Hierarchical Interest Modeling (HIM). It hierarchically utilizes long-tailed users' limited behaviors and captures their preferences from both personalized and group-wise perspectives. HIM consists of two main components, including User Behavior Pyramid (UBP) and User Behavior Clustering (UBC). The UBP module utilizes additional negative feedback to reduce the noises in positive feedback, thus obtaining reliable user personalized representations. Then, the UBC module automatically discovers latent user groups with self-supervised reconstruction loss and learns another interest representation for each user in a group-wise aspect. Extensive experiments on both public and industrial datasets verify the superiority of HIM compared with the state-of-the-art baselines. Moreover, HIM has already been deployed on Lazada recommendation scenario and gains 3.38% on CTR prediction on average on the online A/B test. Our codes are available in https://***/xiaojin-nj/HIM. © 2

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Remote Memory Paging for Disaggregated Memory Systems 1

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Wang, Tao Liu, Haikun Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (数字)9783031226779

ISBN: (纸本)9783031226762

Memory disaggregation has attracted increasing attention in recent years because it is a cost-efficient approach to scale memory capacity for applications in a data center. However, the latency of remote memory access is a major concern in disaggregated memory systems. This paper presents VANDI, a virtual memory paging mechanism that allows applications to use remote memory pools transparently. VANDI enables effective data caching and prefetching mechanisms to address the problem of high access latency in disaggregated memory systems. VANDI exploits a low-complexity cache replacement strategy to optimize the asynchronous staging queue so that the remote write latency can be significantly reduced. VANDI can also prefetch data in multi-granularity from a remote memory pool in an adaptive manner, and thus further improves the hit rate of the local cache to reduce the read latency of remote memory. Our extensive experiments using micro-benchmarks show that VANDI can improve the performance of typical remote paging system–Infiniswap by up to 15 × –102 ×. VANDI can also improve the performance of state-of-the-art disaggregated memory system–Valet by 1.2 × –2.7 ×. For typical machine learning workloads, VANDI can achieve 20% to 80% performance improvement compared with the state-of-the-art Valet. © 2023, Springer Nature Switzerland AG.

关键词： Paging systems

来源：评论

学校读者我要写书评

暂无评论

Frontiers of Artificial Intelligent and Quantitative Management: Preface for ITQM 2024

引用

Procedia Computer science 2024年 242卷 1-8页

作者： Filip, Florin Gheorghe Shi, Yong Pocatilu, Paul Ciurea, Cristian-Eugen Li, Jianping Tien, James M. Berg, Daniel Romanian Academy Information Science and Technology Section Bucharest Romania Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States Bucharest University of Economic Studies Bucharest Romania College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：