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

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dynamic-Sensitive centrality of nodes in temporal networks

引用

Scientific Reports 2017年第1期7卷 1-11页

作者： Huang, Da-Wen Yu, Zu-Guo Key Laboratory of Intelligent Computing Info. Proc. of Min. of Educ. and Hunan Key Lab. for Computation and Simulat. in Sci. and Engineering Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia

Locating influential nodes in temporal networks has attracted a lot of attention as data driven and diverse applications. Classic works either looked at analysing static networks or placed too much emphasis on the topological information but rarely highlighted the dynamics. In this paper, we take account the network dynamics and extend the concept of Dynamic-Sensitive centrality to temporal network. According to the empirical results on three real-world temporal networks and a theoretical temporal network for susceptible-infected-recovered (SIR) models, the temporal Dynamic-Sensitive centrality (TDC) is more accurate than both static versions and temporal versions of degree, closeness and betweenness centrality. As an application, we also use TDC to analyse the impact of time-order on spreading dynamics, we find that both topological structure and dynamics contribute the impact on the spreading influence of nodes, and the impact of time-order on spreading influence will be stronger when spreading rate b deviated from the epidemic threshold b c, especially for the temporal scale-free networks. © 2017 The Author(s).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantitative composite decision-theoretic rough set

Quantitative composite decision-theoretic rough set

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Linna Wang Ling Liu Xin Yang Pan Zhuo School of Electronic and Information Engineering Sichuan Technology and Business University Chengdu China Key Lab of Cloud Computing and Intelligent Information Processing Sichuan Technology and Business University Chengdu China

In practical decision-making, we prefer to characterize the uncertain problems with the hybrid data, which consists of various types of data, e.g., categorical, numerical, set-valued and interval-valued. The extended rough sets can deal with single types of data based on specific binary relation, including the equivalence relation, neighborhood relation, partial order relation, tolerance relation, etc. However, the fusion of these relations is a significant challenge task in such composite information table. To tackle this issue, this paper proposes the intersection and union composite relation, and further introduces a quantitative composite decision-theoretic rough set model. Moreover, we present a novel matrix-based approach to compute the upper and lower approximations in proposed model. Finally, an numerical example is conducted to illustrate the efficiency of proposed method.

关键词： Rough sets Numerical models Mathematical model Computational modeling Data models Probabilistic logic Business

来源：评论

学校读者我要写书评

暂无评论

Abstractive news summarization based on event semantic link network 26

Abstractive news summarization based on event semantic link ...

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Li, Wei He, Lei Zhuge, Hai Key Lab. of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences Beijing China Aston University Birmingham United Kingdom

ISBN: (纸本)9784879747020

This paper studies the abstractive multi-document summarization for event-oriented news texts through event information extraction and abstract representation. Fine-grained event mentions and semantic relations between them are extracted to build a unified and connected event semantic link network, an abstract representation of source texts. A network reduction algorithm is proposed to summarize the most salient and coherent event information. New sentences with good linguistic quality are automatically generated and selected through sentences over-generation and greedy-selection processes. Experimental results on DUC 2006 and DUC 2007 datasets show that our system significantly outperforms the state-of-the-art extractive and abstractive baselines under both pyramid and ROUGE evaluation metrics. © 1963-2018 ACL.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Interactive attention for neural machine translation 26

Interactive attention for neural machine translation

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Meng, Fandong Lu, Zhengdong Li, Hang Liu, Qun AI Platform Department Tencent Technology Co. Ltd. China Noah's Ark Lab. Huawei Technologies China ADAPT Centre School of Computing Dublin City University Ireland Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Ireland

ISBN: (纸本)9784879747020

Conventional attention-based Neural Machine Translation (NMT) conducts dynamic alignment in generating the target sentence. By repeatedly reading the representation of source sentence, which keeps fixed after generated by the encoder (Bahdanau et al., 2015), the attention mechanism has greatly enhanced state-of-the-art NMT. In this paper, we propose a new attention mechanism, called INTERACTIVE ATTENTION, which models the interaction between the decoder and the representation of source sentence during translation by both reading and writing operations. INTERACTIVE ATTENTION can keep track of the interaction history and therefore improve the translation performance. Experiments on NIST Chinese-English translation task show that INTERACTIVE ATTENTION can achieve significant improvements over both the previous attention-based NMT baseline and some state-of-the-art variants of attention-based NMT (i.e., coverage models (Tu et al., 2016)). And neural machine translator with our INTERACTIVE ATTENTION can outperform the open source attention-based NMT system Groundhog by 4.22 BLEU points and the open source phrase-based system Moses by 3.94 BLEU points averagely on multiple test sets. © 1963-2018 ACL.

关键词： Neural machine translation

来源：评论

学校读者我要写书评

暂无评论

Personalizing EEG-based affective models with transfer learning 25

Personalizing EEG-based affective models with transfer learn...

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Zheng, Wei-Long Lu, Bao-Liang Center for Brain-like Computing and Machine Intelligence Department of Computer Science and Engineering China Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering China Brain Science and Technology Research Center Shanghai Jiao Tong University Shanghai China

Individual differences across subjects and nonstationary characteristic of electroencephalography (EEG) limit the generalization of affective braincomputer interfaces in real-world applications. On the other hand, it is very time consuming and expensive to acquire a large number of subjectspecific lab.led data for learning subject-specific models. In this paper, we propose to build personalized EEG-based affective models without lab.led target data using transfer learning techniques. We mainly explore two types of subject-to-subject transfer approaches. One is to exploit shared structure underlying source domain (source subject) and target domain (target subject). The other is to train multiple individual classifiers on source subjects and transfer knowledge about classifier parameters to target subjects, and its aim is to learn a regression function that maps the relationship between feature distribution and classifier parameters. We compare the performance of five different approaches on an EEG dataset for constructing an affective model with three affective states: positive, neutral, and negative. The experimental results demonstrate that our proposed subject transfer framework achieves the mean accuracy of 76.31% in comparison with a conventional generic classifier with 56.73% in average.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

Social sensing enhanced time estimation for bus service

引用

作者： Liu, Jin Li, Juan Cui, Xiaohui Niu, Xiaoguang Sun, Xiaoping Zhou, Jing State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEAs and road condition attributions PRCAs. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEAs of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. © 2015 John Wiley & Sons, Ltd.

关键词： Buses

来源：评论

学校读者我要写书评

暂无评论

Constructing Multiple Scene Graphs in Distributed Environment

引用

Computer Aided Drafting,Design and Manufacturing 2015年第1期25卷 16-21页

作者： XIA Rui WANG Guo-ping LI Sheng WANG Heng Shenzhen Key Lab for Cloud Computing Technology and Applications Shenzhen Graduate School of Peking University Graphics & Interaction Lab. School of Electronics Engineering and Computer SciencesPeking University Beijing Engineering Technology Research Center of Virtual Simulation and Visualization Peking University

Scene graph is a infrastructure of the virtual reality system to organize the virtual scene with abstraction, it can provide facility for the rendering engine and should be integrated effectively on demand into a real-time system, where a large quantities of scene objects and resources can be manipulated and managed with high flexibility and reliability. We present a new scheme of multiple scene graphs to accommodate the features of rendering engine and distributed systems. Based upon that, some other functions, e.g. block query, interactive editing, permission management, instance response, ＂redo＂ and ＂undo＂, are implemented to satisfy various requirements. At the same time, our design has compatibility to popular C/S architecture with good concurrent performance. Above all, it is convenient to be used for further development. The results of experiments including responding time demonstrate its good performance.

关键词： multiple scene graphs authority scene editing distributed systems

来源：评论

学校读者我要写书评

暂无评论

A light rule-based approach to english subject-verb agreement errors on the third person singular forms 29

A light rule-based approach to english subject-verb agreemen...

引用

29th Pacific Asia Conference on Language, Information and Computation, PACLIC 2015

作者： Wang, Yuzhu Zhao, Hai Shi, Dan Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai200240 China LangYing NLP Research Institute Shanghai Lang Ying Education Technology Co. Ltd China

Verb errors are one of the most common grammar errors made by non-native writers of English. This work especially focus on an important type of verb usage errors, subject-verb agreement for the third person singular forms, which has a high proportion in errors made by non-native English learners. Existing work has not given a satisfied solution for this task, in which those using supervised learning method usually fail to output good enough performance, and rule-based methods depend on advanced linguistic resources such as syntactic parsers. In this paper, we propose a rule-based method to detect and correct the concerned errors. The proposed method relies on a series of rules to automatically locate subject and predicate in four types of sentences. The evaluation shows that the proposed method gives state-of-The-Art performance with quite limited linguistic resources.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：