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

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

作者： Li, Gang Hao, Zhi Feng Wei, Hang Huang, Han School of Computer and Engineering South China University of Technology Guangzhou China School of Mathematics and Big Data Foshan University Foshan China School of Medical Information Engineering Guangzhou University of Chinese Medicine Guangzhou China School of Software Engineering South China University of Technology Guangzhou510006 China

ISBN: (纸本)9783319687582

In a traveling salesman problem (TSP), the contribution of a variable to fitness depends on the state of other variables. This characteristic can be referred to as entire linkage, utilizing which evolutionary algorithms can significantly enhance performance, especially in cases of large scale problems. In this paper, a construction graph-based evolutionary algorithm (CGEA) to learn variable interactions in TSP is presented. The proposed method employs real adjacency matrix-coding based on construction graph to make population individuals as carriers of variable interaction degrees through evolution. Iteratively, variable interactions are discovered by a parameterless search scheme, called matrix recombination-difference. In order to explore features of CGEA, an entire linkage index (ELI) is proposed to measure the entire linkage level of TSP. The experimental results show CGEA is promising for TSP, especially with a high entire linkage level. © Springer International Publishing AG 2017.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Deep Multi-Metric Learning for Person Re-Identification

Deep Multi-Metric Learning for Person Re-Identification

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yongxin Ge Xinqian Gu Min Chen Hongxing Wang Dan Yang Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education (Chongqing University) Chongqing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China School of Big Data & Software Engineering Chongqing University Chongqing China

In this paper, to exploit more discriminative information of the global-body and body-parts features, we present a novel deep multi-metric learning (DMML) network for person re-identification under the triplet framework. The main novelty of our learning framework lies in two aspects: 1) Unlike most existing metric learning-based approaches, which learn only one distance metric for comparison, our DMM-L method aims to learn different metrics for the global-body and body-parts features respectively by using convolutional neural network (CNN); 2) A new multi-metric loss function is proposed to train the DMML network, under which the distance of each negative pair is greater than that of each positive pair by a predefined margin, and the correlations of different metrics are maximized. Compared with the previous person re-identification methods that have shown state-of-the-art performances, our DMML approach can achieve competitive results on the challenging CUHK03, CUHKOl, VIPeR and iLIDS datasets.

关键词： Measurement Image color analysis Feature extraction Training Machine learning Kernel Learning systems

来源：评论

学校读者我要写书评

暂无评论

A random sample partition data model for big data analysis

arXiv

引用

arXiv 2017年

作者： Salloum, Salman He, Yulin Huang, Joshua Zhexue Zhang, Xiaoliang Emara, Tamer Z. Wei, Chenghao He, Heping Big Data Institute College of Computer Science and Software Engineering Shenzhen University ShenzhenGuangdong518060 China

big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks, where each RSP data block has a probability distribution similar to the whole big data set. Under this data model, efficient block level sampling is used to randomly select RSP data blocks, replacing expensive record level sampling to select sample data from a big distributed data set on a computing cluster. We show how RSP data blocks can be employed to estimate statistics of a big data set and build models which are equivalent to those built from the whole big data set. In this approach, analysis of a big data set becomes analysis of few RSP data blocks which have been generated in advance on the computing cluster. Therefore, the new method for data analysis based on RSP data blocks is scalable to big data. Copyright © 2017, The Authors. All rights reserved.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Two-phase locality-sensitive hashing for privacy-preserving distributed service recommendation 1

引用

9th International Symposium on Cyberspace Safety and Security, CSS 2017

作者： Qi, Lianyong Dou, Wanchun Zhang, Xuyun School of Information Science and Engineering Qufu Normal University Jining China Chinese Academy of Education Big Data Qufu Normal University Jining China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Electrical and Computer Engineering University of Auckland Auckland New Zealand

ISBN: (数字)9783319694719

ISBN: (纸本)9783319694702

With the ever-increasing volume of services registered in various web communities, it becomes a challenging task to find the web services that a target user is really interested in from the massive candidates. In this situation, Collaborative Filtering (i.e., CF) technique is introduced to alleviate the heavy burden on the service selection decisions of target users. However, present CF-based recommendation approaches often assume that the recommendation bases, i.e., historical service quality data are centralized, without considering the distributed service recommendation scenarios where data are multi-sourced. Furthermore, distributed service recommendation calls for the collaborations among multiple involved parties, during which the private information of users may be exposed. In view of these challenges, we propose a novel privacy-preserving distributed service recommendation approach based on two-phase Locality-Sensitive Hashing (LSH), named SerRectwo-LSH, in this paper. Concretely, in SerRectwo-LSH, we first look for the "similar friends" of a target user through a privacy-preserving two-phase LSH process;afterwards, we determine the services preferred by the "similar friends" of the target user, and then recommend them to the target user. Finally, through a set of experiments conducted on a real distributed service quality dataset WS-DREAM, we validate the feasibility of our proposal in terms of recommendation accuracy and efficiency while guaranteeing privacy-preservation. © 2017, Springer International Publishing AG.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Global Pinning Synchronization with PI Controller in General Complex Directed Networks

Global Pinning Synchronization with PI Controller in General...

引用

第37届中国控制会议

作者： Peng Liu Haibo Gu Jinhu Lü Yu Kang Department of Automation University of Science and Technology of China LSC Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environmentand Beijing Advanced Innovation Center for Big Data and Brain Machine IntelligenceBeihang University

Global pinning synchronization in complex networks has been extensively studied in the last decades due to its potential *** question is how to design an available controller to achieve global synchronization when the network is *** we all know,the classical PI controller is most widely and successfully used in engineering systems with nonlinear ***,the global synchronization with PI controller in general complex directed networks still remain *** this paper we will theoretically show that the global synchronization of some directed networks can also be ensured by designing an appropriate PI controller and pioneering some selected nodes,then a simple numerical example will also be given to verify our main results.

关键词： Directed network Pining synchronization PI controller Lyapunov method

来源：评论

学校读者我要写书评

暂无评论

Distributed PI Control for Synchronization in Directed Strongly Connected Complex Dynamical Networks

Distributed PI Control for Synchronization in Directed Stron...

引用

第37届中国控制会议

作者： Haibo Gu Peng Liu Xiong Wang Jinhu L LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Department of Automation University of Science and Technology of China School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Machine Intelligence Beihang University

Synchronization of directed complex networks has been extensively studied in the previous two decades due to its potential applications in the real world practices. To reveal and analyze the inherent mechanism of global synchronization in the complex networks with directed topologies, this paper attempts to developing a novel synchronization approach by using algebraic connectivity and PI control protocols. First, we studied the distributed PI control for synchronization in directed strongly connected networks and obtained some sufficient conditions to guarantee the networks reach global ***, a numerical example is given to verify the effectiveness of the proposed theoretical results.

关键词： Synchronization distributed PI control strongly connected network network control systems

来源：评论

学校读者我要写书评

暂无评论

Robust frequent directions with application in online learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2019年第1期20卷

作者： Luo Luo Cheng Chen Zhihua Zhang Wu-Jun Li Tong Zhang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China National Engineering Lab for Big Data Analysis and Applications School of Mathematical Sciences Peking University Beijing China National Key Laboratory for Novel Software Technology Collaborative Innovation Center of Novel Software Technology and Industrialization Department of Computer Science and Technology Nanjing University Nanjing China Computer Science & Mathematics Hong Kong University of Science and Technology Hong Kong

The frequent directions (FD) technique is a deterministic approach for online sketching that has many applications in machine learning. The conventional FD is a heuristic procedure that often outputs rank deficient matrices. To overcome the rank deficiency problem, we propose a new sketching strategy called robust frequent directions (RFD) by introducing a regularization term. RFD can be derived from an optimization problem. It updates the sketch matrix and the regularization term adaptively and jointly. RFD reduces the approximation error of FD without increasing the computational cost. We also apply RFD to online learning and propose an effective hyperparameter-free online Newton algorithm. We derive a regret bound for our online Newton algorithm based on RFD, which guarantees the robustness of the algorithm. The experimental studies demonstrate that the proposed method outperforms state-of-the-art second order online learning algorithms.

关键词： frequent directions matrix approximation online Newton algorithm online convex optimization sketching

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Deep User Modeling for Content-based Event Recommendation in Event-based Social Networks

Deep User Modeling for Content-based Event Recommendation in...

引用

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

作者： Zhibo Wang Yongquan Zhang Honglong Chen Zhetao Li Feng Xia Jiangsu Key Lab. of Big Data Security & Intelligent Processing NJUPT P. R. China School of Cyber Science and Engineering Wuhan University P. R. China College of Information and Control Engineering China University of Petroleum P. R. China College of Information Engineering Xiangtan University P. R. China School of Software Dalian University of Technology P. R. China

ISBN: (纸本)9781538641293

Event-based social networks (EBSNs) are the newly emerging social platforms for users to publish events online and attract others to attend events offline. The content information of events plays an important role in event recommendation. However, the content-based approaches in existing event recommender systems cannot fully represent the preference of each user on events since most of them focus on exploiting the content information from events' perspective, and the bag-of-words model, commonly used by them, can only capture word frequency but ignore word orders and sentence structure. In this paper, we shift the focus from events' perspective to users' perspective, and propose a Deep User Modeling framework for Event Recommendation (DUMER) to characterize the preference of users by exploiting the contextual information of events that users have attended. Specifically, we utilize convolutional neural network (CNN) with word embedding to deeply capture the contextual information of a user's interested events and build up a user latent model for each user. We then incorporate the user latent model into probabilistic matrix factorization (PMF) model to enhance the recommendation accuracy. We conduct experiments on the real-world dataset crawled from a typical EBSN, ***, and the experimental results show that DUMER outperforms the compared benchmarks.

关键词： Recommender systems Machine learning Social network services Feature extraction Context modeling Conferences Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Network failure–aware redundant virtual machine placement in a cloud data center

Network failure–aware redundant virtual machine placement i...

引用

作者： Zhou, Ao Wang, Shangguang Hsu, Ching-Hsien Kim, Myung Ho Wong, Kok-Seng State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China School of Mathematics and Big Data Foshan University Foshan China Department of Information Engineering and Computer Science Feng Chia University Taichung Taiwan School of Software Soongsil University Seoul Korea Republic of

Cloud has become a very popular infrastructure for many smart city applications. A growing number of smart city applications from all over the world are deployed on the clouds. However, node failure events from the cloud data center have negative impact on the performance of smart city applications. Survivable virtual machine placement has been proposed by the researchers to enhance the service reliability. Because of the ignorance of switch failure, current survivable virtual machine placement approaches cannot achieve the best effect. In this paper, we study to enhance the service reliability by designing a novel network failure–aware redundant virtual machine placement approach in a cloud data center. Firstly, we formulate the network failure–aware redundant virtual machine placement problem as an integer nonlinear programming problem and prove that the problem is NP-hard. Secondly, we propose a heuristic algorithm to solve the problem. Finally, extensive simulation results show the effectiveness of our algorithm. Copyright © 2017 John Wiley & Sons, Ltd.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：