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

arXiv 2017年

作者： He, Xu Liu, Bin Chen, Ke-Jia School of Computer Science Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China

The growth of Internet commerce has stimulated the use of collaborative filtering (CF) algorithms as recommender systems. A CF algorithmrecommends items of interest to the target user by leveraging the votes given by other similar users. In a standard CF framework, it is assumed that the credibility of every voting user is exactly the same with respect to the target user. This assumption is not satisfied and may lead to misleading recommendations in practice. A natural countermeasure is to design a trust-aware CF algorithm, which can take account of the difference in the credibilities of the voting users when performing CF. To this end, this paper presents a trust inference approach, which can predict the implicit trust of the target user on every voting user from a sparse explicit trust matrix. Then an improvedCF algorithmtermed iTrace is proposed, which employs both the explicit and the predicted implicit trust to provide recommendations. An empirical evaluation on a public dataset demonstrates that the proposed algorithm provides a significant improvement in recommendation quality in terms of mean absolute error. Copyright © 2017, The Authors. All rights reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Image Destriping and Denoising with Spectral Low Rank and Tensor Nuclear Norm

Hyperspectral Image Destriping and Denoising with Spectral L...

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Pengfei Liu Lanlan Liu School of Computer Science Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing China

In this paper, we propose a new method for simultaneous hyperspectral image (HSI) destriping and denoising with spectral low-rank and tensor nuclear norm under the tensor framework. Specifically, the tensor nuclear norm is used to model the tensor low-rank property of stripe. Moreover, the nuclear norm is used to model the low-rank property of spectral gradient of HSI. Then, the ADMM algorithm is used to effectively solve the proposed model. Experimental results on simulated HSI dataset and real HSI dataset verify the superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Evaluating Consideration Level of Responses For Mental Health Chatbots

SSRN

引用

SSRN 2023年

作者： Xu, Bei Zhuang, Ziyuan Wang, Yue Jiangsu Key Laboratory of Big Data Security and Intelligent Processing China School of Computer Science Nanjing University of Posts and Telecommunications China

Mental health chatbots are widely used and proven useful in the conversation of psychological treatments. The users of mental health chatbots require "considerate" responses because they are relatively sensitive or vulnerable. However, current mental health chatbots do not evaluate the consideration level of the responses. Current mental health chatbots generally use the categories of positive and negative to reflect consideration and sharp. This paper proposes a consideration evaluation model (CEM) to evaluate the consideration level of the responses from mental health chatbots. The experiments first prove that positive and negative cannot precisely reflect considerate and sharp, and then prove that CEM can effectively evaluate the consideration level of responses. We further use CEM to test five typical chatbots and the results indicates that some mental health chatbots may give sharp responses. © 2023, The Authors. All rights reserved.

关键词： Computational electromagnetics

来源：评论

学校读者我要写书评

暂无评论

Privacy Protection for Image Sharing Using Reversible Adversarial Examples

Privacy Protection for Image Sharing Using Reversible Advers...

引用

IEEE International Conference on Communications (ICC)

作者： Ping Yin Wei Chen Jiaxi Zheng Yiting Zhang Lifa Wu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Online image sharing on social media platforms faces information leakage due to deep learning-aided privacy attacks. To avoid these attacks, this paper proposes a privacy protection mechanism for image sharing without changing the visual effect, which is based on reversible adversarial examples. Specifically, social media platform users can change the class activation feature to convert the original image into an adversarial image before sharing. When users want to restore the adversarial image to the original image, they can use an improved generative adversarial network model to restore it. The experimental results prove that the conversion model in this paper can effectively prevent privacy attacks from analyzing and stealing users' private information while having no visual impact. At the same time, the proposed restoration model can restore the adversarial examples with high accuracy.

关键词： Training Privacy Image recognition Social networking (online) Perturbation methods Visual effects Information leakage

来源：评论

学校读者我要写书评

暂无评论

Application of C4.5 decision tree for scholarship evaluations

引用

Procedia Computer Science 2019年 151卷 179-184页

作者： X. Wang C. Zhou X. Xu College of Overseas Education Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China

Under the global trend of modern quality education, the set of higher educational scholarship is aimed to reward the students who work hard both inside and outside class activities and achieve great success in kinds of academic competitions. At this time, with great emphasis by governments and outstanding construction on the educational infrastructure, the number of students in universities has been increasing dramatically. Meanwhile, during the development of the education in such a long period, universities generally accumulate a huge amount of the information concerned with the students. What the administrators always do to handle such information are merely storing, querying and doing some other basic manipulations instead of making full use of these data. For example, those manual evaluations of the educational scholarship always revolve around the rank of scholarship and the number of the students who are rewarded rather than analyzing the facts which can influence the achieving of the scholarship. As a result, the evaluation is apparently lack of fairness and efficiency. In this paper, based on C4.5 decision tree, a higher educational scholarship evaluation model is built. By using such algorithm, an efficient and fair scholarship evaluation system can be realized.

关键词： C4.5 Decision Tree Scholarship Evaluation data Mining

来源：评论

学校读者我要写书评

暂无评论

Maximum Likelihood Estimation based on Random Subspace EDA: Application to extrasolar planet detection

arXiv

引用

arXiv 2017年

作者： Liu, Bin Chen, Ke-Jia School of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu210023 China

This paper addresses maximum likelihood (ML) estimation based model fitting in the context of extrasolar planet detection. This problem is featured by the following properties: 1) the candidate models under consideration are highly nonlinear;2) the likelihood surface has a huge number of peaks;3) the parameter space ranges in size from a few to dozens of dimensions. These properties make the ML search a very challenging problem, as it lacks any analytical or gradient based searching solution to explore the parameter space. A population based searching method, called estimation of distribution algorithm (EDA), is adopted to explore the model parameter space starting from a batch of random locations. EDA is featured by its ability to reveal and utilize problem structures. This property is desirable for characterizing the detections. However, it is well recognized that EDAs can not scale well to large scale problems, as it consists of iterative random sampling and model fitting procedures, which results in the well-known dilemma curse of dimensionality. A novel mechanism to perform EDAs in interactive random subspaces spanned by correlated variables is proposed and the hope is to alleviate the curse of dimensionality for EDAs by performing the operations of sampling and model fitting in lower dimensional subspaces. The effectiveness of the proposed algorithm is verified via both benchmark numerical studies and real data analysis. Copyright © 2017, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance op timization of dynamic random forest

Implementation and performance op timization of dynamic rand...

引用

第九届网络分布式计算与知识发现国际会议( 2017 International Conference on Cyber-enabled distributed computing and knowledge discovery)

作者： Xiaolong Xu Wen Chen School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and

Bernard combines the weight updating of the boosting algorithm with the Random Forest(RF),and proposes a new RF induction algorithm called Dynamic Random Forest(DRF).The idea with DRF is to grow only trees that would fit the sub-forest already built,use the existing forest to update the weight of each randomly selected training instance,force the next tree to pay attention to those samples that can not be classified well by the current forest,thus improving the RF ***,this weight updating method is still flawed,which does not make a good distinction between the samples classified correctly and the samples classified wrongly by the current *** this paper,we implement the DRF algorithm,and propose a new weight update method,that is,giving higher weight to the samples classified wrongly by the current forest,giving lower weight to the samples classified correctly by the current forest,so that the next tree will be more concerned with those misclassified *** results show that our method is better than DRF algorithm and traditional RF algorithm.

关键词： Random forest Boosting Dynamic random forest Weight updating

来源：评论

学校读者我要写书评

暂无评论

PM$^{2}$2VE: Power Metering Model for Virtualization Environments in Cloud data Centers

引用

IEEE Transactions on Cloud Computing 2023年第3期11卷 3126-3138页

作者： Ziyu Shen Xusheng Zhang Zheng Liu Yun Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory for Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Virtualization technologies provide solutions for cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many practical models for estimating the power consumption of virtual machines (VMs) have been proposed, few power estimation models of containers have been put forth. In this article, we propose a fast-training piecewise regression model based on a decision tree for VM power metering and estimate the power of containers configured on the VM by treating the container as a group of processes on the VM. We select appropriate features from the collected metrics of VMs/containers to help our model fit the nonlinear relationship between power and features well. Besides, we optimize the leaf nodes of the regression tree, realizing the effective power metering of virtualization environments. We evaluate the proposed model on 13 tasks in PARSEC and compare it with several commonly used models in data centers. The experimental results prove the effectiveness of the proposed model, and the estimated power of containers is in line with expectations.

关键词： Containers data centers Power demand Estimation data models Virtualization Servers

来源：评论

学校读者我要写书评

暂无评论

SCALABLE ATTRIBUTION OF ADVERSARIAL ATTACKS VIA MULTI-TASK LEARNING

arXiv

引用

arXiv 2023年

作者： Guo, Zhongyi Han, Keji Ge, Yao Ji, Wei Li, Yun Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Deep neural networks (DNNs) can be easily fooled by adversarial attacks during inference phase when attackers add imperceptible perturbations to original examples, i.e., adversarial examples. Many works focus on adversarial detection and adversarial training to defend against adversarial attacks. However, few works explore the tool-chains behind adversarial examples, which can help defenders to seize the clues about the originator of the attack, their goals, and provide insight into the most effective defense algorithm against corresponding attacks. With such a gap, it is necessary to develop techniques that can recognize tool-chains that are leveraged to generate the adversarial examples, which is called Adversarial Attribution Problem (AAP). In this paper, AAP is defined as the recognition of three signatures, i.e., attack algorithm, victim model and hyperparameter. Current works transfer AAP into single label classification task and ignore the relationship between these signatures. The former will meet combination explosion problem as the number of signatures is increasing. The latter dictates that we cannot treat AAP simply as a single task problem. We first conduct some experiments to validate the attributability of adversarial examples. Furthermore, we propose a multi-task learning framework named Multi-Task Adversarial Attribution (MTAA) to recognize the three signatures simultaneously. MTAA contains perturbation extraction module, adversarial-only extraction module and classification and regression module. It takes the relationship between attack algorithm and corresponding hyperparameter into account and uses the uncertainty weighted loss to adjust the weights of three recognition tasks. The experimental results on MNIST and ImageNet show the feasibility and scalability of the proposed framework as well as its effectiveness in dealing with false alarms. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

On Link Formation in Heterogeneous Information Networks: A View Based on Multi-Label Learning

On Link Formation in Heterogeneous Information Networks: A V...

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Ke-Jia Chen Shijun Xue Yun Li Bin Liu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu China College of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu China

ISBN: (数字)9781450349932

ISBN: (纸本)9781450349932

This paper studies the problem of relationship prediction in heterogeneous information networks. Our goal is not only to predict links/relationships more accurately but also to provide more viable paths to facilitate the formation of new links/relationships. A relationship prediction method based on multi-label learning named ML 3 P is proposed. In ML 3 P, each meta-path between nodes is regarded as a type of relationship and is given a label. Under the framework of multi-label learning, any potential relationship including the target relationship can be predicted. The results of comparative experiments in DBLP and Twitter datasets show that ML 3 P better uses heterogeneous information in supervised learning process and thus achieves better performance. Moreover, our method can output the correlation between relationships.

关键词： Twitter Task analysis Feature extraction Training Measurement Correlation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：