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

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

来源：评论

学校读者我要写书评

暂无评论

Itrace: An implicit trust inference method for trust-aware collaborative filtering

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

UB-CQA: A user attribute based community question answering system

UB-CQA: A user attribute based community question answering ...

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Ziye Zhu Xiaoqian Liu Huakang Li Tao Li School of Computer Science Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

intelligent Community Question Answering (CQA) system is a popular research topic in Natural Language processing (NLP) area. Recently, the development of distributed data mining has significantly improved the efficiency of the searching and sorting operations in CQA database. However, problems are left unanswered such as how to choose the best answer among multiple candidates for a single question. To solve this issue, we design a CQA system called UB-CQA. First, in database refinement part, we construct an optimized and structured database by the best answer choosing method leveraging user attribute provided by the response provider. Second, in human-computer part, the UB-CQA is able to search and provide a more satisfying answer to users by similarity calculation and re-ranking method leveraging text categorization information. Empirical evaluations show that the best answer choosing and the candidate question re-ranking methods bring great improvements in accuracy and reliability.

关键词： databases Knowledge based systems Mathematical model Knowledge discovery Internet computer science

来源：评论

学校读者我要写书评

暂无评论

Named entity recognition for Chinese telecommunications field based on Char2Vec and Bi-LSTMs

Named entity recognition for Chinese telecommunications fiel...

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Yu Wang Bin Xia Zheng Liu Yun Li Tao Li School of Computer Science Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing Jiangsu China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

Named Entity Recognition (NER) is a basic task in Natural Language processing (NLP), which extracts the meaningful named entities from the text. Compared with the English NER, the Chinese NER is more challenge, since there is no tense in the Chinese language. Moreover, the omissions and the Internet catchwords in the Chinese corpus make the NER task more difficult. Traditional machine learning methods (e.g., CRFs) cannot address the Chinese NER effectively because they are hard to learn the complicated context in the Chinese language. To overcome the aforementioned problem, we propose a deep learning model Char2Vec+Bi-LSTMs for Chinese NER. We use the Chinese character instead of the Chinese word as the embedding unit, and the Bi-LSTMs is used to learn the complicated semantic dependency. To evaluate our proposed model, we construct the corpus from the China TELECOM FAQs. Experimental results show that our model achieves better performance than other baseline methods and the character embedding is more appropriate than the word embedding in the Chinese language.

关键词： Hidden Markov models Logic gates computer architecture Machine learning Semantics Telecommunications

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Temporal data fusion at the edge

arXiv

引用

arXiv 2019年

作者： Yang, Linfu Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

—As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge. Copyright © 2019, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Temporal data Fusion at the Edge

Temporal Data Fusion at the Edge

引用

IEEE International Symposium on Parallel and Distributed processing with Applications and IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC)

作者： Linfu Yang Bin Liu School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152103

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge.

关键词： data privacy Gaussian processes Internet of Things sensor fusion data fusion Gaussian processes Internet of things data integration data privacy Sensor fusion Edge of a figure or solid data capture Privacy

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：