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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Tan, Zihan Wan, Guancheng Huang, Wenke Ye, Mang National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Hubei Key Laboratory of Multimedia and Network Communication Engineering School of Computer Science Wuhan University Wuhan China Taikang Center for Life and Medical Sciences Wuhan University Wuhan China

Personalized Federated Graph Learning (pFGL) facilitates the decentralized training of Graph Neural Networks (GNNs) without compromising privacy while accommodating personalized requirements for non-IID participants. In cross-domain scenarios, structural heterogeneity poses significant challenges for pFGL. Nevertheless, previous pFGL methods incorrectly share non-generic knowledge globally and fail to tailor personalized solutions locally under domain structural shift. We innovatively reveal that the spectral nature of graphs can well reflect inherent domain structural shifts. Correspondingly, our method overcomes it by sharing generic spectral knowledge. Moreover, we indicate the biased message-passing schemes for graph structures and propose the personalized preference module. Combining both strategies, we propose our pFGL framework FedSSP which Shares generic Spectral knowledge while satisfying graph Preferences. Furthermore, We perform extensive experiments on cross-dataset and cross-domain settings to demonstrate the superiority of our framework. The code is available at https://***/OakleyTan/FedSSP. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting Duplicate Contributions in Pull-Based Model CombiningTextual and Change Similarities

引用

Journal of computer Science & Technology 2021年第1期36卷 191-206页

作者： Zhi-Xing Li Yue Yu Tao Wang Gang Yin Xin-Jun Mao Huai-Min Wang Key Laboratory of Parallel and Distributed Computing College of ComputerNational University of Defense Technology Changsha 410073China Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Communication and coordination between OSS developers who do not work physically in the same location have always been the challenging *** pull-based development model,as the state-of-art collaborative development mechanism,provides high openness and transparency to improve the visibility of contributors'***,duplicate contributions may still be submitted by more than one contributors to solve the same problem due to the parallel and uncoordinated nature of this *** not detected in time,duplicate pull-requests can cause contributors and reviewers to waste time and energy on redundant *** this paper,we propose an approach combining textual and change similarities to automatically detect duplicate contributions in pull-based model at submission *** a new-arriving contribution,we first compute textual similarity and change similarity between it and other existing *** then our method returns a list of candidate duplicate contributions that are most similar with the new contribution in terms of the combined textual and change *** evaluation shows that 83.4%of the duplicates can be found in average when we use the combined textual and change similarity compared to 54.8%using only textual similarity and 78.2%using only change similarity.

关键词： Pull-request Duplicate detection textual similarity change similarity

来源：评论

学校读者我要写书评

暂无评论

Robust Multi-Graph Contrastive Network for Incomplete Multi-View Clustering

引用

IEEE Transactions on Multimedia 2023年 27卷 1-13页

作者： Xue, Zhe Li, Yawen Guan, Zhongchao Li, Wenling Liang, Meiyu Zhou, Hai Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia School of Computer Science Beijing University of Posts and Telecommunications Beijing China School of Economics and Management Beijing University of Posts and Telecommunications Beijing China School of Automation Science and Electrical Engineering Beihang University Beijing China

Food categorization is pivotal in numerous aspects of everyday life, assisting in the selection of food, managing diets, and addressing essential survival requirements. By leveraging the complementary information of various views, multi-view learning usually achieves superior performance compared to the single-view learning methods. However, characterized by the unrestrained openness of internet platforms and potential inconsistencies in food data collection processes, multi-view features often suffer from data loss, resulting in incomplete multi-view food data. Conventional multi-view clustering methods often falter in effectively capitalizing on the diverse correlations contained in food data, and exhibit limitations in dealing with the noise and irregularities pervading different views. Addressing these challenges, this paper presents the Robust Multi-Graph Contrastive network (RMGC) for multi-view food clustering. RMGC artfully combines multi-view representation learning with multi-graph contrastive regularization, creating a cohesive framework to manage incomplete multi-view data. By developing a multi-view encoding network, RMGC seamlessly blends various views into a cohesive representation, astutely assessing the significance of each view. More importantly, the proposed robust multi-graph contrastive regularization enhances the precision of the learned representation and successfully counteracts the noise and unreliability in multi-view data. The experiments conducted across several multi-view datasets manifest the effectiveness of RMGC, showing its superiority over existing methods. Our method not only making an advancement in food categorization but also contributes to the broader field of multi-view learning, offering innovative solutions for handling incomplete and noisy multi-view data. IEEE

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Industry Upgrading and Public Opinion Prevention Using BERTopic 1

引用

2nd International Conference on Artificial Intelligence Security and Privacy, AIS and P 2024

作者： Wang, Xinhua Yu, Xiaomei Jiang, Yunmeng Zheng, Xiangwei Li, Wei School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan250358 China Shandong Normal University Library Shandong Normal University Jinan China

ISBN: (数字)9789819611485

ISBN: (纸本)9789819611478

The development status of the hotel industry in a city is also an essential factor influencing local tourism revenue. In the tourism industry, besides dining and attractions, which are hotspots for public opinion, the hotel industry is also a key area. The development status of the hotel industry in a city is also an essential factor influencing local tourism revenue. In this context, it is crucial for hotels to address how to prevent such negative public opinion crises. In this paper, we use hotel review texts as an example to discuss how to use BERTopic and GRU networks to extract topics and analyze sentiment from guest reviews. This analysis helps understand guests’ focus and sentiment trends regarding hotels, enabling better grasp public opinion direction and user needs. Through topic extraction and sentiment analysis, we can extract crucial information from large scale hotel review texts. This enables monitor public opinion to help prevent large scale public opinion crises, allows for targeted improvements in the hotel industry, and supports decision-making for hotels and the tourism industry. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Hotels

来源：评论

学校读者我要写书评

暂无评论

A Burst Topic Detection Model Based on HVCH Model and Burst_NBT Method 4

A Burst Topic Detection Model Based on HVCH Model and Burst_...

引用

4th International Symposium on Artificial Intelligence and Intelligent Manufacturing, AIIM 2024

作者： Zhang, Chao Peng, Qingcheng Xiang, Huan Liu, Yaowei Guo, Hong Liu, Wenjun Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou China School of Computer and Software Engineering Xihua University Chengdu China China Electronics Anshi Technology Co. Ltd Chengdu China

ISBN: (纸本)9798331541729

This paper proposes a burst topic detection model based on HVCH model and Burst_NBT method. The model overcomes the sparsity difficulty of microblog by establishing HVCH model, effectively detects topics of microblog. Then the model establishes Burst_NBT method to calculate the burst scores of the words and cluster the burst words of microblog document sets of each topic, and to score and rank the burst word clusters to detect the corresponding burst topics of each topic. The experiment results indicate that the proposed HVCH-Burst_NBT model improve the evaluation indicators compared with the other two burst topic detection models. © 2024 IEEE.

关键词： burst term similarity calculation topic detection

来源：评论

学校读者我要写书评

暂无评论

An Evaluation Approach for Website Promotion Based on Combined Weight and TOPSIS 22

An Evaluation Approach for Website Promotion Based on Combin...

引用

5th International Conference on Big Data Technologies, ICBDT 2022

作者： Wang, Xi Chen, Zhichao Kong, Mingming Li, Bo Fan, Mengmeng School of Computer and Software Engineering Xihua University Chengdu China Intelligent Policing Key Laboratory of Sichuan Province Luzhou China

ISBN: (纸本)9781450396875

In view of the problems existing in the process of website promotion evaluation, such as inadequate decision-making information, strong subjectivity and quantification difficulty of the index weight assignment, and inadequate accuracy of the selected results. For realizing the goal of automatic evaluation for the performance of website promotion, we propose an approach based on Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) through combined weights. Specifically, based on the construction of a comprehensive evaluation index system for website promotion, the subjective and objective weights are determined by using Analytic Hierarchy Process (AHP) and Grey Relational Analysis (GRA). Then the combined weights are obtained by Entropy method, and finally TOPSIS is used to rank the performance of website promotion. Experimental results indicate that the ranking results are consistent, and our method can achieve the greatest degree of discrimination. © 2022 ACM.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Experiments and Analyses of Anonymization Mechanisms for Trajectory Data Publishing

引用

Journal of computer Science & Technology 2022年第5期37卷 1026-1048页

作者： She Sun Shuai Ma Jing-He Song Wen-Hai Yue Xue-Lian Lin Tiejun Ma State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang UniversityBeijing 100191China Department of Decision Analytics and Risk Southampton Business SchoolUniversity of Southampton Southampton SO171BJU.K

With the advancing of location-detection technologies and the increasing popularity of mobile phones and other location-aware devices,trajectory data is continuously *** large-scale trajectories provide opportunities for various applications,the locations in trajectories pose a threat to individual ***,there has been an interesting debate on the reidentifiability of individuals in the Science *** main finding of Sánchez et *** exactly opposite to that of De Montjoye et al.,which raises the first question:"what is the true situation of the privacy preservation for trajectories in terms of reidentification?''Furthermore,it is known that anonymization typically causes a decline of data utility,and anonymization mechanisms need to consider the trade-off between privacy and *** raises the second question:"what is the true situation of the utility of anonymized trajectories?''To answer these two questions,we conduct a systematic experimental study,using three real-life trajectory datasets,five existing anonymization mechanisms(i.e.,identifier anonymization,grid-based anonymization,dummy trajectories,k-anonymity andε-differential privacy),and two practical applications(i.e.,travel time estimation and window range queries).Our findings reveal the true situation of the privacy preservation for trajectories in terms of reidentification and the true situation of the utility of anonymized trajectories,and essentially close the debate between De Montjoye et *** Sánchez et *** the best of our knowledge,this study is among the first systematic evaluation and analysis of anonymized trajectories on the individual privacy in terms of unicity and on the utility in terms of practical applications.

关键词： anonymization privacy reidentification trajectory utility

来源：评论

学校读者我要写书评

暂无评论

A Web Service Recommendation Method Based on Adaptive Gate Network and xDeepFM 1

引用

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

作者： Tao, Zhi Cao, Buqing Ye, Hongfan Kang, Guosheng Peng, Zhenlian Wen, Yiping School of Computer Science and Engineering and Hunan Key Laboratory of Service Computing and New Software Service Technology Hunan University of Science and Technology Hunan Xiangtan China School of Computer and Artificial Intelligence Huaihua University Huaihua China

ISBN: (数字)9783031226779

ISBN: (纸本)9783031226762

With the rapid development of service computing technology, more and more companies and organizations are encapsulating and publishing their operational data or resources to the Internet in the form of Web services, resulting in an exponential increase in the number of Web services. To automatically generate or recommend a group of Web services according to the user's natural language requirements description, to build a Mashup application to meet the user's requirement is a hot topic in service computing. Some researchers enhance the quality of Web service recommendation by using auxiliary information into the recommendation system. However, they mainly focus on adding external information (e.g., pre-training of external corpora) to enhance semantic features, while some internal statistical features of the corpus such as word distribution on labels and frequency are not fully exploited. Compared to other exterior knowledge, statistical features are naturally compatible with Web service recommendation tasks. To fully exploit the statistical features, this paper proposes a Web service recommendation method based on adaptive gate network and xDeepFM model. In this method, firstly, the description document of Web services is taken as the basic corpus, the semantic and statistical information in the corpus are mined by utilizing the adaptive gate network, and the statistical features are encoded by a variational encoder. Secondly, the similarity between Web services is derived from the semantic features, at the same time the popularity and co-occurrence of Web services are calculated. Thirdly, the xDeepFM model is used to mine the explicit and implicit higher-order interactions in the sparse matrix which consists of the above information to recommend Web services for Mashup application. Finally, a multiple sets of experiments based on the dataset crawled from the ProgrammableWeb have been conducted to evaluate the proposed method and the experimental result shows that t

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Graph Contrastive Learning with Cohesive Subgraph Awareness 24

Graph Contrastive Learning with Cohesive Subgraph Awareness

引用

33rd ACM Web Conference, WWW 2024

作者： Wu, Yucheng Wang, Leye Han, Xiao Ye, Han-Jia Key Lab of High Confidence Software Technologies Peking University Ministry of Education School of Computer Science Peking University Beijing China School of Information Management and Engineering Shanghai University of Finance and Economics Shanghai China National Key Laboratory for Novel Software Technology Nanjing University School of Artificial Intelligence Nanjing University Nanjing China

ISBN: (纸本)9798400701719

Graph contrastive learning (GCL) has emerged as a state-of-the-art strategy for learning representations of diverse graphs including social and biomedical networks. GCL widely uses stochastic graph topology augmentation, such as uniform node dropping, to generate augmented graphs. However, such stochastic augmentations may severely damage the intrinsic properties of a graph and deteriorate the following representation learning process. We argue that incorporating an awareness of cohesive subgraphs during the graph augmentation and learning processes has the potential to enhance GCL performance. To this end, we propose a novel unified framework called CTAug, to seamlessly integrate cohesion awareness into various existing GCL mechanisms. In particular, CTAug comprises two specialized modules: topology augmentation enhancement and graph learning enhancement. The former module generates augmented graphs that carefully preserve cohesion properties, while the latter module bolsters the graph encoder's ability to discern subgraph patterns. Theoretical analysis shows that CTAug can strictly improve existing GCL mechanisms. Empirical experiments verify that CTAug can achieve state-of-the-art performance for graph representation learning, especially for graphs with high degrees. The code is available at https://***/10.5281/zenodo.10594093, or https://***/wuyucheng2002/CTAug. © 2024 ACM.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

The Power of Age-based Reward in Fresh Information Acquisition 42

The Power of Age-based Reward in Fresh Information Acquisiti...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Wang, Zhiyuan Meng, Qingkai Zhang, Shan Luo, Hongbin Beihang University School of Computer Science and Engineering Beijing China Beihang University State Key Laboratory of Virtual Reality Technology and Systems China Beihang University Institute of Artificial Intelligence Beijing China State Key Laboratory of Software Development Environment China

ISBN: (纸本)9798350334142

Many Internet platforms collect fresh information of various points of interest (PoIs) relying on users who happen to be nearby the PoIs. The platform will offer reward to incentivize users and compensate their costs incurred from information acquisition. In practice, the user cost (and its distribution) is hidden to the platform, thus it is challenging to determine the optimal reward. In this paper, we investigate how the platform dynamically rewards the users, aiming to jointly reduce the age of information (AoI) and the operational expenditure (OpEx). Due to the hidden cost distribution, this is an online non-convex learning problem with partial feedback. To overcome the challenge, we first design an age-based rewarding scheme, which decouples the OpEx from the unknown cost distribution and enables the platform to accurately control its OpEx. We then take advantage of the age-based rewarding scheme and propose an exponentially discretizing and learning (EDAL) policy for platform operation. We prove that the EDAL policy performs asymptotically as well as the optimal decision (derived based on the cost distribution). Simulation results show that the age-based rewarding scheme protects the platform's OpEx from the influence of the user characteristics, and verify the asymptotic optimality of the EDAL policy. © 2023 IEEE.

关键词： Simulation platform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：