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

HAM:a deep collaborative ranking method incorporating textual information

Frontiers of Information Technology & Electronic Engineering 2020年第8期21卷 1206-1216页

作者： Cheng-wei WANG Teng-fei ZHOU Chen CHEN Tian-lei HU Gang CHEN The Key Laboratory of Big Data Intelligent Computing of Zhejiang Province Hangzhou 310027China State Key Lab of CAD&CG Zhejiang UniversityHangzhou 310027China College of Computer Science and Technology Zhejiang UniversityHangzhou 310027China

The recommendation task with a textual corpus aims to model customer preferences from both user feedback and item textual *** is highly desirable to explore a very deep neural network to capture the complicated nonlinear ***,training a deeper recommender is not as effortless as simply adding layers.A deeper recommender suffers from the gradient vanishing/exploding issue and cannot be easily trained by gradient-based ***,textual descriptions probably contain noisy word *** extracting feature vectors from them can harm the recommender’s *** overcome these difficulties,we propose a new recommendation method named the HighwAy reco Mmender(HAM).HAM explores a highway mechanism to make gradient-based training methods stable.A multi-head attention mechanism is devised to automatically denoise textual ***,a block coordinate descent method is devised to train a deep neural *** studies show that the proposed method outperforms state-of-the-art methods significantly in terms of accuracy.

关键词： Deep learning Recommendation system Highway network Block coordinate descent

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based forgery attack on document images

arXiv

引用

arXiv 2021年

作者： Zhao, Lin Chen, Changsheng Huang, Jiwu the Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology College of Electronics and Information Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

With the ongoing popularization of online services, the digital document images have been used in various applications. Meanwhile, there have emerged some deep learning-based text editing algorithms which alter the textual information of an image in an end-to-end fashion. In this work, we present a low-cost document forgery algorithm by the existing deep learning-based technologies to edit practical document images. To achieve this goal, the limitations of existing text editing algorithms towards complicated characters and complex background are addressed by a set of network design strategies. First, the unnecessary confusion in the supervision data is avoided by disentangling the textual and background information in the source images. Second, to capture the structure of some complicated components, the text skeleton is provided as auxiliary information and the continuity in texture is considered explicitly in the loss function. Third, the forgery traces induced by the text editing operation are mitigated by some post-processing operations which consider the distortions from the print-and-scan channel. Quantitative comparisons of the proposed method and the exiting approach have shown the advantages of our design by reducing the about 2/3 reconstruction error measured in MSE, improving reconstruction quality measured in PSNR and in SSIM by 4 dB and 0.21, respectively. Qualitative experiments have confirmed that the reconstruction results of the proposed method are visually better than the existing approach in both complicated characters and complex texture. More importantly, we have demonstrated the performance of the proposed document forgery algorithm under a practical scenario where an attacker is able to alter the textual information in an identity document using only one sample in the target domain. The forged-and-recaptured samples created by the proposed text editing attack and recapturing operation have successfully fooled some existing document authenticat

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer Networks 2025年 268卷

作者： Yingya Guo Cen Chen College of Computer and Data Science Fuzhou University PR China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University PR China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian PR China

As an emerging computing paradigm, Mobile Edge computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios.

关键词： Access delay Deep reinforcement learning Edge server placement Mobile edge computing User mobility

来源：评论

学校读者我要写书评

暂无评论

Random Forest-Based Ensemble Estimator for Concrete Compressive Strength Prediction via AdaBoost Method 15th

Random Forest-Based Ensemble Estimator for Concrete Compress...

引用

15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th International Conference on Harmony Search, Soft computing and Applications, ICHSA 2019

作者： Lv, Yuanxin Shi, Xiaoyu Ran, Longyu Shang, Mingsheng College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783030325909

As one of the most important building materials, the quality of concrete directly affects the safety of buildings. Hence, it is an important and hot issue to predict the compressive strength of concrete with highly accuracy. Most of existing methods heavily depend on building a single model to predict the compressive strength of concrete. However, the proposed single models are not one-size-fits-all, different model have different limitations, making them a better or worse fit for different situation. To address this issue, this paper proposes a novel predict model for concrete compressive strength based on ensemble learning method. In detail, we build our ensemble framework via using the AdaBoost method, while the random forests methods as weak classifier are integrated to the AdaBoost framework. For dealing with the noisy and missing value problems, a set of statistical methods are employed. Furthermore, we utilize the Pearson correlation coefficient to analysis the relationship between different input materials, which can effectively drop out the irrelevant and redundant features. Experimental results on two industrial data sets show that proposed ensemble estimator can significantly improve the prediction accuracy in comparing with other five state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Computer-Automated Design of Self-Aligned Multi-Ball Pitch Artifact with High Precision

SSRN

引用

SSRN 2024年

作者： Zhu, Hongjun Liu, Binghong Zhou, Sen Zhang, Xiaoyan Xin, Liu Chen, Kuo Qian, Ying School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Engineering Research Center of Software Quality Assurance Testing and Assessment Chongqing400065 China College of Mechanical and Vehicle Engineering Chongqing University Chongqing400044 China Chongqing Academy of Metrology and Quality Inspection Chongqing401121 China School of Engineering Computer and Mathematical Sciences Auckland University of Technology Auckland1010 New Zealand Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

This study presents a computational methodology for developing a multi-ball system that automatically aligns during assembly processes. The contributions of this work are threefold: Firstly, a comprehensive error analysis of the multi-ball system is performed. It is found that temperature and pressure-induced deformations should not be ignored when micrometer-level precision is required. Secondly, a novel process flow for designing the multi-ball pitch artifact is introduced, which enables optimization decision-making. Lastly, a series of experiments are conducted on standard bearing balls (grade G20). The resulting artifact meets the Class 1 standards. It is reasonable to assume that, by using balls of grade G3 precision, the multi-ball artifact can achieve accuracy at the sub-micrometer level. © 2024, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Improving Incremental Learning: A Closer Look at the Softmax Function

SSRN

引用

SSRN 2024年

作者： Zhai, Zheng Zhang, Jiali Wang, Haiyu Wu, Mingxin Yang, Keshun Qiao, Xiaoyan Sun, Qiang Beijing Normal University No.18 Jinfeng Road Guangdong Zhuhai519087 China Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong China School of Mathematics Sichuan University Chengdu China College of Liberal Arts and Sciences University of Illinois Urbana-Champaign IL United States Department of Statistical Sciences University of Toronto ON Canada Department of Computer Science University of Toronto ON Canada Department of Statistics and Data Science MBZUAI Abu Dhabi United Arab Emirates

This paper investigates the limitations of the widely adopted softmax cross-entropy loss in incremental learning problems. Specifically, we highlight how the shift-invariant property of this loss function can lead to multiple optimal solutions and imbalanced weights across different tasks, which exacerbates catastrophic forgetting. To address these issues, we propose two key modifications to the objective function: (1) regularizing or replacing the original joint distillation loss with a summation of task-specific distillation losses, and/or (2) utilizing a shift-sensitive prediction loss function, such as the binary cross-entropy loss. Numerical experiments validate the effectiveness of these proposals, demonstrating improved prediction accuracy and a significant reduction in forgetting. © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

arXiv

引用

arXiv 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian Key Laboratory of Network Fuzhou350002 China Computing and Intelligent Information Processing [Fuzhou University Fuzhou350116 China Department of Computer Science Faculty of Environment Science and Economy University of Exeter ExeterEX4 4QF United Kingdom School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Informatics University of Oslo Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Deep Sentiment Learning Network for Temporal-aware Recommendation Based on User Reviews

Deep Sentiment Learning Network for Temporal-aware Recommend...

引用

IEEE International Conference on big data Analysis (ICBDA)

作者： Xinxin Li Tianqi Shang Dezhong Peng Xiaoyu Shi School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China College of Computer Science Sichuan University Chengdu China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Recently, many websites encourage users to fill in reviews on items and services to improve the quality of personalized recommendation, because of the rich sentiment information hidden in user reviews. However, most existing recommendation methods based on reviews heavily emphasize extracting the rich sentiment information from reviews by using deep learning technologies as far as possible and always ignore the effects of temporal dynamical of user preferences. To address the above issues, we propose DSL- TR, a deep sentiment learning framework for the temporal-aware recommendation, using an intricate combination of bidirectional long short-term memory (BLSTM) and Convolution Neural Network (CNN). It consists of four layers: embedding layer, BLSTM layer, CNN layer and feature fusion layer. In the embedding layer, we explicitly combine the time information in the review embedding layer by regarding the review time as an independent factor. Then, we utilize the BLSTM and CNN networks to extract the long and short-terms of latent features of user and item in parallel. Finally, the factorization machine technique, as a rating predictor, is introduced on the last layer to estimate the rating based on the learned user and item latent features. We conduct extensive experiments on Amazon's four data sets. The results demonstrate that our proposed method outperforms several state-of-art methods consistently.

关键词： Deep learning Convolution Conferences Neural networks big data Feature extraction data mining

来源：评论

学校读者我要写书评

暂无评论

Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction Networks

Graph Regularized Nonnegative Latent Factor Analysis Model f...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Yue Zhou ZhiGang Liu Ye Yuan School of Computer Science and Technology Choncgqing University of Posts and Telecommunications Chongqing China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing 400714 China and with the Chongqing School University of Chinese Academy of Sciences Chongqing China College of Computer and Information Science Southwest University Chongqing China

ISBN: (纸本)9781665472449

With the development of blockchain technology, a cryptocurrency based on blockchain technology is becoming more and more popular. The huge cryptocurrency transaction network has therefore received widespread attention. The link prediction learning structure of the network is supportive to understand the mechanism of networks, so it also has been widely studied in the cryptocurrency network. However, the dynamics of cryptocurrency transaction networks have been neglected in past studies. In this study, therefore, we use a graph-regularized method to link past transaction records with future transactions. Based on this, we propose a single latent factor-dependent, nonnegative, multiplicative, and graph regularized-incorporated update (SLF-NMGRU) algorithm and further propose a graph regularized nonnegative latent factor analysis (GrNLFA) model. Eventually, the experimental results on a real cryptocurrency transaction network show that the proposed method improves both the accuracy and computational efficiency.

关键词： Analytical models Tensors Computational modeling Heuristic algorithms Optimization methods Predictive models Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：