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

A Location Privacy Preserving Scheme Based on Repartitioning Anonymous Region in Mobile Social Network

Procedia Computer Science 2018年 129卷 368-371页

作者： Lina Ni Yanfeng Yuan Xiao Wang Mengmeng Zhang Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Applying the proliferated location-based services (LBS) to social networks has spawned mobile social network (MSN) services that it allows users to discover potential friends around them. In this paper, we focus on the problem of location privacy preserving in MSN. Particularly, we propose a location privacy preserving (RPAR) scheme via to repartition anonymous region where the central anonymous location minimizes the traffic between the anonymous server and the LBS server while protecting the privacy of the user location.

关键词： Privacy preserving mobile social network location-based service location privacy anonymous region repartition

来源：评论

学校读者我要写书评

暂无评论

Hybrid Filtrations Recommendation system based on Privacy Preserving in Edge computing

引用

Procedia Computer Science 2018年 129卷 407-409页

作者： Lina Ni Hongdi Lin Mengmeng Zhang Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

It is challenging to design a secure recommendation system on the Internet which can help users to select their favorite products as less privacy leaked as possible. In this paper, we present a hybrid filtrations recommendation system based on privacy preserving in edge computing (HFRS-PP), which can prevent the users’ privacy information from being leaked via the merits of edge computing in the process of computing and ensure the real-time, accuracy and stability of the query results. Particularly, we propose a privacy-preserving recommendation algorithm to obtain the desired results for the end users through hybrid filtrations. The filtration-rough set theory algorithm is given to distinguish the valid reviews from spam reviews for the next filtration.

关键词： Privacy protection edge computing recommendation system rough set theory

来源：评论

学校读者我要写书评

暂无评论

Forecasting of Forex Time Series Data Based on Deep Learning

引用

Procedia Computer Science 2019年 147卷 647-652页

作者： Lina Ni Yujie Li Xiao Wang Jinquan Zhang Jiguo Yu Chengming Qi College of Computer Science and Engineering Shandong University of Science and Technology Qingdao 266590 China Shandong Province Key Laboratory of Wisdom Mine Information Technology Shandong University of Science and Technology Qingdao 266590 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong 250014 China Shandong Computer Science Center (National Supercomputer Center in Jinan) Jinan Shandong 250014 China Beijing Union University Beijing 100101 China

This paper proposes a C-RNN forecasting method for Forex time series data based on deep-Recurrent Neural Network (RNN) and deep Convolutional Neural Network (CNN), which can further improve the prediction accuracy of deep learning algorithm for the time series data of exchange rate. We fully exploit the spatio-temporal characteristics of forex time series data based on the data-driven method. On the exchange rate data of nine major foreign exchange currencies, the experimental comparison of the forecasting method shows that the C-RNN foreign exchange time series data prediction method constructed in this paper has better applicability and higher accuracy.

关键词： Deep learning Recurrent neural network Convolutional neural network Foreign Exchange Rate Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Maximum delay anonymous clustering feature tree based privacy-preserving data publishing in social networks

引用

Procedia Computer Science 2019年 147卷 643-646页

作者： Jinquan Zhang Bowen Zhao Guochao Song Lina Ni Jiguo Yu College of Computer Science and Engineering Shandong University of Science and Technology Qingdao 266590 China Shandong Province Key Laboratory of Wisdom Mine Information Technology Shandong University of Science and Technology Qingdao 266590 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Qilu University of Technology (Shandong Academy of Sciences) Jinan Shandong 250014 China Shandong Computer Science Center (National Supercomputer Center in Jinan) Jinan Shandong 250014 China

Clustering analysis has been widely used in pattern recognition and image processing in recent years, which is an important research field of data mining. Data publishing in social networks is threatened by the leakage of private information nowadays. This paper proposes a privacy preservation scheme of sensitive data publishing in social networks based on Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) algorithm to tackle this issue. The scheme is divided into an online process and an offline process. Specifically, we present the Maximum Delay Anonymous Clustering Feature (MDACF) tree data publishing algorithm.

关键词： Privacy protection Data publishing Social networks (α, L)-diversity K-anonymity Clustering feature (CF) tree

来源：评论

学校读者我要写书评

暂无评论

Multi-task variational information bottleneck

arXiv

引用

arXiv 2020年

作者： Qian, Weizhu Chen, Bowei Zhang, Yichao Wen, Guanghui Gechter, Franck Le laboratoire Connaissance et Intelligence Artificielle Distribuées Université Bourgogne Franche-Comté France Adam Smith Business School University of Glasgow United Kingdom Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai200092 China Department of Systems Science School of Mathematics Southeast University Nanjing210016 China School of Engineering RMIT University MelbourneVIC3000 Australia Le laboratoire Connaissance et Intelligence Artificielle Distribuées Université Bourgogne Franche-Comté and Mosel LORIA UMR CNRS Université de Lorraine 7503 France

Multi-task learning (MTL) is an important subject in machine learning and artificial intelligence. Its applications to computer vision, signal processing, and speech recognition are ubiquitous. Although this subject has attracted considerable attention recently, the performance and robustness of the existing models to different tasks have not been well balanced. This article proposes an MTL model based on the architecture of the variational information bottleneck (VIB), which can provide a more effective latent representation of the input features for the downstream tasks. Extensive observations on three public data sets under adversarial attacks show that the proposed model is competitive to the state-of-the-art algorithms concerning the prediction accuracy. Experimental results suggest that combining the VIB and the task-dependent uncertainties is a very effective way to abstract valid information from the input features for accomplishing multiple tasks. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm enhanced automatic data flow management solution for facilitating data intensive applications in the cloud

A genetic algorithm enhanced automatic data flow management ...

引用

作者： Li, Siguang Huang, Zhengwen Han, Liangxiu Jiang, Changjun The Key Laboratory of Embedded Systems and Service Computing Tongji University Shanghai China College of Electrical Engineering Binzhou University Binzhou China Department of Electronic and Computer Engineering Brunel University London London United Kingdom School of Computing Mathematics and Digital Technology Manchester Metropolitan University Manchester United Kingdom

The past few years have witnessed a rapid deployment of computing infrastructures in the cloud in support of data intensive applications. The effort of the existing works is mainly focused on data reusing mechanisms without considering data processing routes, which can significantly affect the computation costs when exchanging data among the computing node in the cloud. This paper presents a genetic algorithm enhanced Automatic Data Flow Management Solution (ADFMS) that facilitates automatic routing function and a self-adjustable intermediate data management mechanism to achieve an efficient data processing structure of cloud computing. Experimental results show that ADFMS optimizes costs in managing intermediate data in the cloud. © 2018 John Wiley & Sons, Ltd.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A Multi-label Classifier for Human Protein Subcellular Localization Based on LSTM Networks

A Multi-label Classifier for Human Protein Subcellular Local...

引用

2018 International Conference on Advanced Control, Automation and Artificial Intelligence (ACAAI2018)

作者： Zhiying Gao Lijun Sun Zhihua Wei Department of Computer Science and Technology Tongji University Research Center of Big Data and Network Security Tongji University Key Laboratory of Embedded System and Service Computing Tongji University

Nowadays, with the increasing number of protein sequences all over the world, more and more people are paying their attention to predicting protein subcellular location. Since wet experiment is costly and time-consuming, the automatic computational methods are urgent. In this paper, we propose a variant model based on Long Short-Term Memory(LSTM) to predict protein subcellular location. In this model, we employ LSTM to capture long distance dependency features of the sequence data. Moreover, we adjust the loss function of the loss layer to solve multi-label classification problem. Experimental results demonstrate that, compared with the traditional machine learning methods, our method achieves the best performance in various evaluation metrics.

关键词： LSTM multi-label classification protein subcellular localization

来源：评论

学校读者我要写书评

暂无评论

A Novel Mutual Information based Ant Colony Classifier 5

A Novel Mutual Information based Ant Colony Classifier

引用

2017 International Conference on Progress in Informatics and computing(PIC)

作者： Hang Yu Xiaoxiao Qian Yang Yu Jiujun Cheng Ying Yu Shangce Gao College of Computer Science and Technology Taizhou University Faculty of Engineering University of Toyama Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

ISBN: (纸本)9781538619797;9781538619780

By constructing a list of IF-THEN rules, the traditional ant colony optimization(ACO) has been successfully applied on data classification with not only a promising accuracy but also a user comprehensibility. However, as the collected data to be classified usually contain large volumes and redundant features, it is challenging to further improve the classification accuracy and meanwhile reduce the computational time for *** paper proposes a novel hybrid mutual information based ant colony algorithm(mrAM+) for classification. First, a maximum relevance minimum redundancy feature selection method is used to select the most informative and discriminative attributes in a dataset. Then, we use the enhanced ACO classifier(i.e., AM+)to perform the classification. Experimental results show that the proposed mrAM+ outperforms other seven state-of-art related classification algorithms in terms of accuracy and the size of model.

关键词： ant colony optimization mutual information classification data mining feature selection

来源：评论

学校读者我要写书评

暂无评论

A rich ranking model based on the matthew effect optimization 7th

A rich ranking model based on the matthew effect optimizatio...

引用

7th International Conference on Computational Data and Social Networks, CSoNet 2018

作者： Li, Jinzhong Liu, Guanjun Department of Computer Science and Technology College of Electronic and Information Engineering Jinggangshan University Ji’an343009 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu610054 China Department of Computer Science and Technology College of Electronic and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030046477

Most existing approaches of learning to rank treat the effectiveness of each query equally which results in a relatively lower ratio of queries with high effectiveness (i.e. rich queries) in the produced ranking model. Such ranking models need to be further optimized to increase the number of rich queries. In this paper, queries with different effectiveness are distinguished, and the queries with higher effectiveness are given higher weights. We modify the gradient in the LambdaMART algorithm based on a new perspective of Matthew effect to highlight the optimization of the rich queries and to produce the rich ranking model, and we present a consistency theorem for the modified optimization objective. Based on the effectiveness evaluation criteria for information retrieval, we introduce the Gini coefficient, mean-variance and quantity statistics to measure the performances of the ranking models. Experimental results show that the ranking models produced by the gradient-modified LambdaMART algorithm based on Matthew effect exhibit a stronger Matthew effect compared to the original LambdaMART algorithm. © Springer Nature Switzerland AG 2018.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Transfer learning-based online multiperson tracking with Gaussian process regression

Transfer learning-based online multiperson tracking with Gau...

引用

作者： Zhang, Baobing Li, Siguang Huang, Zhengwen Rahi, Babak H. Wang, Qicong Li, Maozhen Department of Electronic and Computer Engineering Brunel University London London United Kingdom The Key Laboratory of Embedded Systems and Service Computing Tongji University Shanghai China College of Electrical Engineering Binzhou University Binzhou China Department of Computer Science Xiamen University Xiamen China

Most existing tracking-by-detection approaches are affected by abrupt pedestrian pose changes, lighting conditions, scale changes, and real-time processing, which leads to issues such as detection errors and drifts. To deal with these issues, we present a novel multi-person tracking framework by introducing a new Gaussian Process Regression based observation model, which learns in a semi-supervised manner. The background information is taken into consideration to build the discriminative tracker, training samples are re-weighted appropriately to ease the impact of the potential sample misalignment and noisy during model updating. Unlabeled samples from the current frame provide rich information, which is used for enhancing the tracking inference. Experimental results show that the proposed approach outperforms a number of state-of-the-art methods on some benchmark datasets. © 2018 John Wiley & Sons, Ltd.

关键词： Gaussian noise (electronic)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：