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

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial keyword Query in Cloud

IEEE Internet of Things Journal 2025年第12期12卷 20498-20511页

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for Distributed Deep Learning 24

Hybrid Parameter Update: Alleviating Imbalance Impacts for D...

引用

24th IEEE International Conference on High Performance computing and Communications, 8th IEEE International Conference on Data Science and Systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Li, Hongliang Xu, Dong Xu, Zhewen Li, Xiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

ISBN: (纸本)9798350319934

Nowadays, data parallelism has been widely applied to train large datasets on distributed deep learning clusters, but it has suffered from costly global parameter updates at batch barriers. Performance imbalance among worker instances, introduced by uneven workload partitioning or biased resource allocation, can cause straggly workers, which can lead to severe impacts on both training speed and result accuracy. This paper studies the issue focusing on the tradeoff between training speed and result accuracy. We propose Cooperate Grouping Parallel (CGP), a hybrid parameter update solution that allows the flexibility of both synchronous and asynchronous update schemes. We introduce a novel Cooperate Worker Grouping Problem (CWGP) that seeks a task grouping configuration that leads to maximum model accuracy and holds customized training speed guarantees. We propose an evolution-based Pareto local searching algorithm to compute efficient worker grouping configurations. Comprehensive evaluation results are presented to demonstrate the effectiveness of CGP under both persistent and fluctuant imbalances. The proposed method alleviates the imbalance impacts without introducing extra adjustment over-heads. © 2022 IEEE.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

In-context decision transformer: reinforcement learning via hierarchical chain-of-thought 24

In-context decision transformer: reinforcement learning via ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Sili Huang Jifeng Hu Hechang Chen Lichao Sun Bo Yang School of Artificial Intelligence and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Artificial Intelligence Jilin University China Lehigh University Bethlehem Pennsylvania Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

In-context learning is a promising approach for offline reinforcement learning (RL) to handle online tasks, which can be achieved by providing task prompts. Recent works demonstrated that in-context RL could emerge with self-improvement in a trial-and-error manner when treating RL tasks as an across-episodic sequential prediction problem. Despite the self-improvement not requiring gradient updates, current works still suffer from high computational costs when the across-episodic sequence increases with task horizons. To this end, we propose an In-context Decision Transformer (IDT) to achieve self-improvement in a high-level trial-and-error manner. Specifically, IDT is inspired by the efficient hierarchical structure of human decision-making and thus reconstructs the sequence to consist of high-level decisions instead of low-level actions that interact with environments. As one high-level decision can guide multi-step low-level actions, IDT naturally avoids excessively long sequences and solves online tasks more efficiently. Experimental results show that IDT achieves state-of-the-art in long-horizon tasks over current in-context RL methods. In particular, the online evaluation time of our IDT is 36× times faster than baselines in the D4RL benchmark and 27× times faster in the Grid World benchmark.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structure-Based Uncertainty Estimation for Source-Free Active Domain Adaptation

引用

IET Computer Vision 2025年第1期19卷

作者： Ouyang, Jihong Zhang, Zhengjie Meng, Qingyi Chi, Jinjin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Active domain adaptation (active DA) provides an effective solution by selectively labelling a limited number of target samples to significantly enhance adaptation performance. However, existing active DA methods often struggle in real-world scenarios where, due to data privacy concerns, only a pre-trained source model is available, rather than the source samples. To address this issue, we propose a novel method called the structure-based uncertainty estimation model (SUEM) for source-free active domain adaptation (SFADA). To be specific, we introduce an innovative active sample selection strategy that combines both uncertainty and diversity sampling to identify the most informative samples. We assess the uncertainty in target samples using structure-wise probabilities and implement a diversity selection method to minimise redundancy. For the selected samples, we not only apply standard-supervised loss but also conduct interpolation consistency training to further explore the structural information of the target domain. Extensive experiments across four widely used datasets demonstrate that our method is comparable to or outperforms current UDA and active DA methods. © 2025 The Author(s). IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： computer vision convolutional neural nets image classification

来源：评论

学校读者我要写书评

暂无评论

SMRI: A New Method for siRNA Design for COVID-19 Therapy

引用

Journal of Computer Science & Technology 2022年第4期37卷 991-1002页

作者： Meng-Xin Chen Xiao-Dong Zhu Hao Zhang Zhen Liu Yuan-Ning Liu College of Software Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Jilin UniversityChangchun 130012China College of Computer Science and Technology Jilin UniversityChangchun 130012China Graduate School of Engineering Nagasaki Institute of Applied ScienceNagasaki 851-0193Japan

First discovered in Wuhan, China, SARS-CoV-2 is a highly pathogenic novel coronavirus, which rapidly spreads globally and becomes a pandemic with no vaccine and limited distinctive clinical drugs available till March 13th, 2020. Ribonucleic Acid interference (RNAi) technology, a gene-silencing technology that targets mRNA, can cause damage to RNA viruses effectively. Here, we report a new efficient small interfering RNA (siRNA) design method named Simple Multiple Rules Intelligent Method (SMRI) to propose a new solution of the treatment of COVID-19. To be specific, this study proposes a new model named Base Preference and Thermodynamic Characteristic model (BPTC model) indicating the siRNA silencing efficiency and a new index named siRNA Extended Rules index (SER index) based on the BPTC model to screen high-efficiency siRNAs and filter out the siRNAs that are difficult to take effect or synthesize as a part of the SMRI method, which is more robust and efficient than the traditional statistical indicators under the same circumstances. Besides, to silence the spike protein of SARS-CoV-2 to invade cells, this study further puts forward the SMRI method to search candidate high-efficiency siRNAs on SARS-CoV-2's S gene. This study is one of the early studies applying RNAi therapy to the COVID-19 treatment. According to the analysis, the average value of predicted interference efficiency of the candidate siRNAs designed by the SMRI method is comparable to that of the mainstream siRNA design algorithms. Moreover, the SMRI method ensures that the designed siRNAs have more than three base mismatches with human genes, thus avoiding silencing normal human genes. This is not considered by other mainstream methods, thereby the five candidate high-efficiency siRNAs which are easy to take effect or synthesize and much safer for human body are obtained by our SMRI method, which provide a new safer, small dosage and long efficacy solution for the treatment of COVID-19.

关键词： COVID-19 SARS-CoV-2 RibonucleicAcid interference

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Multi-label Learning with Balanced Binary Angular Margin Loss 38

Semi-supervised Multi-label Learning with Balanced Binary An...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Li, Ximing Liang, Silong Li, Changchun Wang, Pengfei Gu, Fangming College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Computer Network Information Center Chinese Academy of Sciences China University of Chinese Academy of Sciences Chinese Academy of Sciences China

Semi-supervised multi-label learning (SSMLL) refers to inducing classifiers using a small number of samples with multiple labels and many unlabeled samples. The prevalent solution of SSMLL involves forming pseudo-labels for unlabeled samples and inducing classifiers using both labeled and pseudo-labeled samples in a self-training manner. Unfortunately, with the commonly used binary type of loss and negative sampling, we have empirically found that learning with labeled and pseudo-labeled samples can result in the variance bias problem between the feature distributions of positive and negative samples for each label. To alleviate this problem, we aim to balance the variance bias between positive and negative samples from the perspective of the feature angle distribution for each label. Specifically, we extend the traditional binary angular margin loss to a balanced extension with feature angle distribution transformations under the Gaussian assumption, where the distributions are iteratively updated during classifier training. We also suggest an efficient prototype-based negative sampling method to maintain high-quality negative samples for each label. With this insight, we propose a novel SSMLL method, namely Semi-Supervised Multi-Label Learning with Balanced Binary Angular Margin loss (S2ML2-BBAM). To evaluate the effectiveness of S2ML2-BBAM, we compare it with existing competitors on benchmark datasets. The experimental results validate that S2ML2-BBAM can achieve very competitive performance. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Structure-and Logic-Aware Heterogeneous Graph Learning for Recommendation 40

Structure-and Logic-Aware Heterogeneous Graph Learning for R...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Li, Anchen Yang, Bo Huo, Huan Hussain, Farookh Khadeer Xu, Guandong College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Aalto University Espoo Finland School of Computer Science University of Technology Sydney Sydney Australia Education University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9798350317152

Recently, there has been a surge in recommendations based on heterogeneous information networks (HINs), attributed to their ability to integrate complex and rich semantics. Despite this advancement, most HIN-based recommenders overlook two critical aspects. First, they often fail to consider HIN's heterophily nature, hindering the capture of non-local structures in HINs. Second, most methods lack the capability for logical reasoning. In this paper, we propose a novel structure-and logic-aware heterogeneous graph learning framework for recommender systems (SLHRec). Our SLHRec contains a structure-aware module and a logic-aware module. The former uses network geometry to construct non-local neighborhoods for nodes in HINs, and then introduces a graph neural network to integrate constructed neighbors for modeling the heterophily of HINs. The logic-aware module uses the Markov logic network (MLN) to infuse logic rules into heterogeneous graph learning, thereby boosting logic reasoning in recommendations. Furthermore, we utilize contrastive learning to model cooperative signals between modules, enabling them to complement each other. In the prediction stage, both modules contribute to generating recommendations. Compared with several strong recommender baselines, our SLHRec achieves superior performance on four real-world datasets. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Injecting Revenue-awareness into Cold-start Recommendation: The Case of Online Insurance 29

Injecting Revenue-awareness into Cold-start Recommendation: ...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Li, Yu Zhang, Yi Chang, Helen He Li, Qiang Jilin University College of Computer Science and Technology China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China WeSure Inc. Ping An Technology Shenzhen Co. Ltd China

ISBN: (纸本)9798350330717

In online insurance, one of the central challenges is the cold-starting of new insurance products, which means there are no previous samples to refer to. Previous studies have mainly focused on improving the prediction accuracy of new items, but they have failed to consider the revenue generated by existing items. As a result, the total revenue may suffer a loss even if new items get conversions. To address this issue, in this paper we propose RACRec, a Revenue-Aware Cold-start Recommendation framework for online insurance. Unlike previous works, RACRec uses a revenue-based objective function to ensure profitability when cold-starting new items. With this dedicated objective, RACRec orchestrates the cold-start and warm-start model by predicting their expected revenue from each user, thereby preserving the total profit. In order to accurately predict revenue, a double-ranking scheme is designed for the warm-start model to mitigate position bias, while an item embedding alignment algorithm is proposed for the cold-start model to learn the revenue of new items from similar old items. Furthermore, a reinforced orchestrate update scheme is designed to eliminate the impact of sparse conversions and continuously update revenue estimation. Extensive offline and online experiments have been conducted to validate the effectiveness of RACRec. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Measuring drug similarity using drug–drug interactions

引用

Quantitative Biology 2024年第2期12卷 164-172页

作者： Ji Lv Guixia Liu Yuan Ju Houhou Huang Ying Sun College of Computer Science and Technology Jilin UniversityChangchunChina Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchunChina Sichuan University Library Sichuan UniversityChengduChina College of Chemistry Jilin UniversityChangchunChina Department of Respiratory Medicine The First Hospital of Jilin UniversityChangchunChina

Combination therapy is a promising approach to address the challenge of antimicrobial resistance,and computational models have been proposed for predicting drug–drug *** existing models rely on drug similarity measures based on characteristics such as chemical structure and the mechanism of *** this study,we focus on the network structure itself and propose a drug similarity measure based on drug–drug interaction *** explore the potential applications of this measure by combining it with unsupervised learning and semi-supervised learning *** unsupervised learning,drugs can be grouped based on their interactions,leading to almost monochromatic group–group *** addition,drugs within the same group tend to have similar mechanisms of action(MoA).In semi-supervised learning,the similarity measure can be utilized to construct affinity matrices,enabling the prediction of unknown drug–drug *** method exceeds existing approaches in terms of ***,our experiments demonstrate the effectiveness and practicability of the proposed similarity *** the one hand,when combined with clustering algorithms,it can be used for functional annotation of compounds with unknown *** the other hand,when combined with semi-supervised graph learning,it enables the prediction of unknown drug–drug interactions.

关键词： drug similarity drug–drug interactions drug combinations synergy effect clustering semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：