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

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Jian Lin Ming Li Dejun Yang Guoliang Xue Colorado School of Mines Golden CO USA Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Arizona State University Tempe AZ USA

ISBN: (纸本)9781538641293

Crowdsensing leverages the rapid growth of sensor-embedded smartphones and human mobility for pervasive information collection. To incentivize smartphone users to participate in crowdsensing, many auction-based incentive mechanisms have been proposed for both offline and online scenarios. It has been demonstrated that the Sybil attack may undermine these mechanisms. In a Sybil attack, a user illegitimately pretends multiple identities to gain benefits. Sybil-proof incentive mechanisms have been proposed for the offline scenario. However, the problem of designing Sybil-proof online incentive mechanisms for crowdsensing is still open. Compared to the offline scenario, the online scenario provides users one more dimension of flexibility, i.e., active time, to conduct Sybil attacks, which makes this problem more challenging. In this paper, we design Sybil-proof online incentive mechanisms to deter the Sybil attack for crowdsensing. Depending on users' flexibility on performing their tasks, we investigate both single-minded and multi-minded cases and propose SOS and SOM, respectively. SOS achieves computational efficiency, individual rationality, truthfulness, and Sybil-proofness. SOM achieves individual rationality, truthfulness, and Sybil-proofness. Through extensive simulations, we evaluate the performance of SOS and SOM.

关键词： Task analysis Smart phones Sensors Microsoft Windows Conferences Privacy Cost function

来源：评论

学校读者我要写书评

暂无评论

An Improved Convolutional Neural Network Algorithm for Multi-Label Classification

An Improved Convolutional Neural Network Algorithm for Multi...

引用

International Conference on Audio, Language and Image Processing, ICALIP

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

Recent years conventional neural network(CNN) has been applied to different natural language processing(NLP) tasks such as sentence classification, sentence modeling, etc. Some researchers use CNN to do multi-label classification but their work mainly focus on image rather than text. In this paper, we propose an improved CNN via hierarchical dirichlet process(HDP) model to deal with the multi-label classification problem in NLP. We first apply an HDP model to discard some words which are less important semantically. Then we use word embedding methods to transform words to vectors. Finally, we train CNN based on word vectors. Experimental results demonstrate that our method is superior to most traditional multi-label classification methods and TextCNN in terms of performance.

关键词： Feature extraction Training Convolutional neural networks Natural language processing Vocabulary Transforms

来源：评论

学校读者我要写书评

暂无评论

MPPR: Multi Perspective Page Rank for User Influence Estimation

MPPR: Multi Perspective Page Rank for User Influence Estimat...

引用

International Conference on Big data and Smart Computing (BIGCOMP)

作者： Lifang Wu Bowen Yang Meng Jian Jitao Sang Dai Zhang Lei Zhang Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing University of Technology Beijing China Faculty of Information Technology Beijing University of Technology Beijing China Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China

ISBN: (纸本)9781538636503

With the rapid development of social networks, it is important to identify users with high influence. In content curation social networks (CCSNs), there are two kinds of user relations. The one is the explicit user relations from user's following behavior. And the other is the content based user relations from user's repin behavior. Based on these observation, we propose multi perspective page rank (MPPR) to estimate user influence. The proposed algorithm integrates both user relations to calculate influence scores of the users automatically. User influences are computed based on the transition matrix of following and repin relations. When the iteration is convergent, every user will get a fixed influence value. Experiments on the dataset containing 11990 users, 920610 following relations and 39321016 repin relations show that the proposed algorithm outperforms the typical PageRank algorithm.

关键词： Conferences Big data

来源：评论

学校读者我要写书评

暂无评论

Maximum likelihood estimation based on random subspace EDA: Application to extrasolar planet detection 11th

Maximum likelihood estimation based on random subspace EDA: ...

引用

11th International Conference on Simulated Evolution and Learning, SEAL 2017

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

ISBN: (纸本)9783319687582

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. © Springer International Publishing AG 2017.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

A Lexical Updating Algorithm for Sentiment Analysis on Chinese Movie Reviews 5

A Lexical Updating Algorithm for Sentiment Analysis on Chine...

引用

5th International Conference on Advanced Cloud and Big data, CBD 2017

作者： Song, Yiwei Gu, Kaiwen Li, Huakang Sun, Guozi Bell Honor School Nanjing University of Posts and Telecommunications Nanjing China 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: (纸本)9781538610725

With the prevalence of Internet, sentiment analysis gets popularity among the world. Researchers have made use of kinds of online documents like commodities reivews and movie reviews as training samples to train their models and classfiers, by which they could speculate the underlying emotion in new ones. Douban is a Chinese online community where users share their personal reviews to express their feelings about movies. Those Chinese movie reviews were utilized by us to train our lexicon-based model. Yet multiple words in a ready-made lexicon do not agree with the movie reviews in a specific domain, which means the original lexicon acquires being updated to gain higher accuracy. In this paper we introduce a lexical updating algorithm based on a widely used lexicon. After turns of training of updating, this lexicon is capable of classifying sentiment among movie reviews. The experimental result shows our model using the updated lexicon could get a better performance than the primitive lexicon-based model. © 2017 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Hot Topics Discovery Based on Short Texts of Online Reviews

引用

Journal of Physics: Conference Series 2019年第1期1288卷

作者： Zhenyan Liu Yueshi Qiu Zhe Zhang Limin Mao Xiaohan Zheng Beijing Key Laboratory of Software Security Engineering Technology School of computer science & Technology Beijing Institute of Technology Beijing 100081 China Academy of Intelligent Collaborative Cloud System China Aerospace Science and Industry Corporation Limited Beijing 100048 China

The two crucial issues for hot topics discovery based on online reviews are that the sparsity of short text features and the 'long tail' phenomenon of hot topics. This paper focuses on these two key issues, and proposes an improved similarity calculation method to calculate the similarity of short texts, and a novel clustering algorithm based on the time factor and dynamic adjustment of comparison times to automatically discard a large number of outliers. Moreover, the validity and advancement of the new method are presented by comparative experiments using real data sets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis on Attention Mechanism Application Schemes for Automatic Question Answering systems

Analysis on Attention Mechanism Application Schemes for Auto...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Xinyuan Lu Xiaolong Xu Yanfei Sun Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing Jiangsu China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing Jiangsu China Office of Scientific R&D Nanjing University of Posts and Telecommunications Nanjing Jiangsu China

ISBN: (纸本)9781538676738;9781538676721

An automatic question answering system is generally composed of the question analysis module, the information retrieval module, the answer selection module, etc. The core component of automatic question answering system is the answer selection module, which focuses on extracting adequate information from the questions and answers and representing them effectively. The performance of answer selection directly determines the quality of the answers submitted to users. In this paper, we studied the answer selection schemes, especially the Attentive LSTM scheme, focusing on the application of the attention mechanism commonly utilized in deep learning models. Meanwhile, a self-attentive LSTM is proposed by combining the Attentive LSTM with self-attention which is capable of extracting the local features and the global features of texts at the same time. In addition, a multi-attentive LSTM is proposed so that multiple parts of information in the question are available for the answer. We performed a series of experiments based on the datasets InsuranceQA and TrecQA, compared and analyzed on the performances of the above schemes.

关键词： Feature extraction Task analysis Neural networks Logic gates data mining Knowledge discovery Deep learning

来源：评论

学校读者我要写书评

暂无评论

Discovering communities of malapps on android-based mobile cyber-physical systems

arXiv

引用

arXiv 2018年

作者： Su, Dan Liu, Jiqiang Wang, Wei Wang, Xiaoyang Du, Xiaojiang Guizani, Mohsen Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China Dept. of Computer and Information Sciences Temple University PhiladelphiaPA19122 United States Dept. of Electrical and Computer Engineering University of Idaho MoscowID United States

Android-based devices like smartphones have become ideal mobile cyber-physical systems (MCPS) due to their powerful processors and variety of sensors. In recent years, an explosively and continuously growing number of malicious applications (malapps) have posed a great threat to Android-based MCPS as well as users' privacy. The effective detection of malapps is an emerging yet crucial task. How to establish relationships among malapps, discover their potential communities, and explore their evolution process has become a challenging issue in effective detection of malapps. To deal with this issue, in this work, we are motivated to propose an automated community detection method for Android malapps by building a relation graph based on their static features. First, we construct a large feature set to profile the behaviors of malapps. Second, we propose an E-N algorithm by combining epsilon graph and k-nearest neighbor (k-NN) graph for graph construction. It solves the problem of an incomplete graph led by epsilon method and the problem of noise generated by k-NN graph. Finally, a community detection method, Infomap, is employed to explore the underlying structures of the relation graph, and obtain the communities of malapps. We evaluate our community detection method with 3996 malapp samples. Extensive experimental results show that our method outperforms the traditional clustering methods and achieves the best performance with rand statistic of 94.93% and accuracy of 79.53%. Copyright © 2018, The Authors. All rights reserved.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

A relation prediction method based on PU learning

A relation prediction method based on PU learning

引用

International Conference on intelligent system and Knowledge Engineering, ISKE

作者： Gao-Jing Peng Ke-Jia Chen Shijun Xue Bin Liu Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing Jiangsu China

This paper studies relation prediction in heterogeneous information networks under PU learning context. One of the challenges of this problem is the imbalance of data number between the positive set P (the set of node pairs with the target relation) and the unlabeled set U (the set of node pairs without the target relation). We propose a K-means and voting mechanism based technique SemiPUclus to extract the reliable negative set RN from U under a new relation prediction framework PURP. The experimental results show that PURP achieves better performance than comparative methods in DBLP co-authorship network data.

关键词： Reliability Artificial neural networks Clustering algorithms Algorithm design and analysis Prediction methods Sun

来源：评论

学校读者我要写书评

暂无评论

Progressive Refinement Bilateral Filter

Progressive Refinement Bilateral Filter

引用

IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)

作者： Chanyi Lu Yong Zhao Lin Wang Guiying Zhang Fujian Feng Li Zhang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Electronic and Computer Engineering Shenzhen Graduate School of Peking University Shenzhen China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China Department of Medical Information Engineering Zunyi Medical University Zunyi China

ISBN: (纸本)9781538678626;9781538678619

In this paper, a coarse-to-fine framework for image noise removal is proposed. The bilateral filter is redefined by the manner of progressive refining to effectively eliminate noise, thus forming progressive refinement bilateral filter (PRBF), which estimates the pixel values of a noisy image through the method of progressive refinement with gradual recursion and its result retains more details, infinite close to the original image. PRBF is further integrated into the denoising model for the details processing again after denoising of the major part of the image. Our algorithm is evaluated and compared on two large standardized datasets and a number of selected images. The experimental results show that our algorithm consistently outperforms other approaches for image denoising and demonstrates the effectiveness of our framework for stereo matching.

关键词： Noise reduction Image denoising Mathematical model Filtering Filtering algorithms Kernel Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：