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

arXiv 2019年

作者： Pang, Liang Xu, Jun Ai, Qingyao Lan, Yanyan Cheng, Xueqi Wen, Jirong CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Renmin University of China Beijing China University of Utah United States

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a document set to a permutation on the set, and should satisfy two critical requirements: (1) it should have the ability to model cross-document interactions so as to capture local context information in a query;(2) it should be permutation-invariant, which means that any permutation of the inputted documents would not change the output ranking. Previous studies on learning-to-rank either design uni-variate scoring functions that score each document separately, and thus failed to model the cross-document interactions;or construct multivariate scoring functions that score documents sequentially, which inevitably sacrifice the permutation invariance requirement. In this paper, we propose a neural learning-to-rank model called SetRank which directly learns a permutation-invariant ranking model defined on document sets of any size. SetRank employs a stack of (induced) multi-head self attention blocks as its key component for learning the embeddings for all of the retrieved documents jointly. The self-attention mechanism not only helps SetRank to capture the local context information from cross-document interactions, but also to learn permutation-equivariant representations for the inputted documents, which therefore achieving a permutation-invariant ranking model. Experimental results on three large scale benchmarks showed that the SetRank significantly outperformed the baselines include the traditional learning-to-rank models and state-of-the-art Neural IR models. Copyright © 2019, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Cake cutting on graphs: A discrete and bounded proportional protocol

arXiv

引用

arXiv 2019年

作者： Bei, Xiaohui Sun, Xiaoming Wu, Hao Zhang, Jialin Zhang, Zhijie Zi, Wei School of Physical and Mathematical Sciences Nanyang Technological University CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among n agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains open to find simpler and more efficient envy-free protocols. In this paper we consider a variation of the cake cutting problem by assuming an underlying graph over the agents whose edges describe their acquaintance relationships, and agents evaluate their shares relatively to those of their neighbors. An allocation is called locally proportional if each agent thinks she receives at least the average value over her neighbors. Local proportionality generalizes proportionality and is in an interesting middle ground between proportionality and envy-freeness: its existence is guaranteed by that of an envy-free allocation, but no simple protocol is known to produce such a locally proportional allocation for general graphs. Previous works showed locally proportional protocols for special classes of graphs, and it is listed in both [1] and [8] as an open question to design simple locally proportional protocols for more general classes of graphs. In this paper we completely resolved this open question by presenting a discrete and bounded locally proportional protocol for any given graph. Our protocol has a query complexity of only single exponential, which is significantly smaller than the six towers of n query complexity of the envy-free protocol given in [5]. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

A reduced collatz dynamics maps to a residue class, and its count of x/2 over count of 3*x+1 is larger than ln3/ln2

TechRxiv

引用

TechRxiv 2020年

作者： Ren, Wei School of Computer Science China University of Geosciences Wuhan China Key Laboratory of Network Assessment Technology CAS [Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Guizhou Provincial Key Laboratory Public Big Data Guizhou University Guizhou China

We propose Reduced Collatz conjecture and prove that it is equivalent to Collatz conjecture but more primitive due to reduced dynamics. We study reduced dynamics (that consists of occurred computations from any starting integer to the first integer less than it), because it is the component of original dynamics (from any starting integer to 1). Reduced dynamics is denoted as a sequence of "I" that represents (3*x+1)/2 and "O" that represents x/2. Here 3*x+1 and x/2 are combined together because 3*x+1 is always even and thus followed by x/2. We discover and prove two key properties on reduced dynamics: (1) Reduced dynamics is invertible. That is, given a reduced dynamics, a residue class that presents such reduced dynamics, can be computed directly by our derived formula. (2) Reduced dynamics can be constructed algorithmically, instead of by computing concrete 3*x+1 and x/2 step by step. We discover the sufficient and necessary condition that guarantees a sequence consisting of "I" and "O" to be a reduced dynamics. Counting from the beginning of a sequence, if and only if the count of x/2 over the count of 3*x+1 is larger than ln3/ln2, reduced dynamics will be obtained (i.e., current integer will be less than starting integer). © 2020, CC BY.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Graph wavelet neural network

arXiv

引用

arXiv 2019年

作者： Xu, Bingbing Shen, Huawei Cao, Qi Qiu, Yunqi Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained via a fast algorithm without requiring matrix eigendecomposition with high computational cost. Moreover, graph wavelets are sparse and localized in vertex domain, offering high efficiency and good interpretability for graph convolution. The proposed GWNN significantly outperforms previous spectral graph CNNs in the task of graph-based semi-supervised classification on three benchmark datasets: Cora, Citeseer and Pubmed. Copyright © 2019, The Authors. All rights reserved.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Parameter estimation with the ordered 2 regularization via an alternating direction method of multipliers

arXiv

引用

arXiv 2019年

作者： Humayoo, Mahammad Cheng, Xueqi CAS Key Laboratory of Network Data Science & Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China

Regularization is a popular technique in machine learning for model estimation and for avoiding overfitting. Prior studies have found that modern ordered regularization can be more effective in handling highly correlated, high-dimensional data than traditional regularization. The reason stems from the fact that the ordered regularization can reject irrelevant variables and yield an accurate estimation of the parameters. How to scale up the ordered regularization problems when facing large-scale training data remains an unanswered question. This paper explores the problem of parameter estimation with the ordered 2-regularization via Alternating Direction Method of Multipliers (ADMM), called ADMM-O2. The advantages of ADMM-O2 include (i) scaling up the ordered 2 to a large-scale dataset, (ii) predicting parameters correctly by excluding irrelevant variables automatically, and (iii) having a fast convergence rate. Experimental results on both synthetic data and real data indicate that ADMM-O2 can perform better than or comparable to several state-of-the-art baselines. Copyright © 2019, The Authors. All rights reserved.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Coupled graph neural networks for predicting the popularity of online content

arXiv

引用

arXiv 2019年

作者： Cao, Qi Shen, Huawei Gao, Jinhua Wei, Bingzheng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China WeChat Tencent Inc

Predicting the popularity of online content in social network is an important problem for the practice of information dissemination, advertising, and recommendation. Previous methods mainly leverage demographics, temporal and structural patterns of early adopters for popularity prediction. These methods ignore the interaction between early adopters and potential adopters or the interactions among potential adopters over social networks. Consequently, they fail to capture the cascading effect triggered by early adopters in social networks, and thus have limited predictive power. In this paper, we consider the problem of network-aware popularity prediction, leveraging both early adopters and social networks among users for popularity *** propose a novel method, namely Coupled-GNNs, which use two coupled graph neural networks to capture the cascading effect in information diffusion. One graph neural network models the interpersonal influence, gated by the adoption state of users. The other graph neural network models the adoption state of users via interpersonal influence from their neighbors. Through such an iterative aggregation of the neighborhood, the proposed method naturally captures the cascading effect of information diffusion in social networks. Experiments conducted on both synthetic data and real-world SinaWeibo data demonstrate that our method significantly outperforms the state-of-the-art methods for popularity prediction. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

MMCGAN: Generative Adversarial network with explicit manifold prior

arXiv

引用

arXiv 2020年

作者： Zheng, Guanhua Sang, Jitao Xu, Changsheng University of Science and Technology of China School of Computer and Information Technology Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China National Lab of Pattern Recognition Institute of Automation CAS University of Chinese Academy of Sciences Beijing100190 China

Generative Adversarial network(GAN) provides a good generative framework to produce realistic samples, but suffers from two recognized issues as mode collapse and unstable training. In this work, we propose to employ explicit manifold learning as prior to alleviate mode collapse and stabilize training of GAN. Since the basic assumption of conventional manifold learning fails in case of sparse and uneven data distribution, we introduce a new target, Minimum Manifold Coding (MMC), for manifold learning to encourage simple and unfolded manifold. In essence, MMC is the general case of the shortest Hamiltonian Path problem and pursues manifold with minimum Riemann volume. Using the standardized code from MMC as prior, GAN is guaranteed to recover a simple and unfolded manifold covering all the training data. Our experiments on both the toy data and real datasets show the effectiveness of MMCGAN in alleviating mode collapse, stabilizing training, and improving the quality of generated samples. Copyright © 2020, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Generalized association and deep understanding method for big video data processing

Generalized association and deep understanding method for bi...

引用

2019 IEEE International Conferences on Ubiquitous computing and Communications and data science and Computational Intelligence and Smart computing, networking and Services, IUCC/DSCI/SmartCNS 2019

作者： Xu, Lin Wu, Wei Lv, Wanghan Wang, Dong Science and Technology in Information System Engineering Lab Nanjing Research Institute of Electronic Engineering Nanjing China School of Information Science and Engineering University of Jinan China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China

ISBN: (纸本)9781728152097

In Big data Era, it is becoming more and more important to timely and efficient processing of massive videos, and mining of the value information contained in them. This paper studies chaotic compressed sensing theory and uses Long-term and short-term memory networks (LSTM) algorithm to generate a summary of the content of video behavior track. It has already to apply the proposed method in target recognition and tracking, and the recognition rate achieves more than 86%. © 2019 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Fair and autonomous sharing of federate learning models in mobile Internet of Things

arXiv

引用

arXiv 2020年

作者： Hao, Xiaohan Ren, Wei Xiong, Ruoting Zheng, Xianghan Zhu, Tianqing Xiong, Neal N. School of Computer Science China University of Geoscience Wuhan China Guangxi Key Laboratory of Cryptography and Information Security Guilin541004 China Key Laboratory of Network Assessment Technology CAS Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Mingbyte Technology QingDao China School of Software University of Technology Sydney UltimoNSW2007 Australia Dept. of Mathematics and Computer Science Northeastern State University United States

Federate learning can conduct machine learning as well as protect the privacy of self-owned training data on corresponding ends, instead of having to upload to a central trusted data aggregation server. In mobile scenarios, a centralized trusted server may not be existing, and even though it exists, the delay will not be manageable, e.g., smart driving cars. Thus, mobile federate learning at the edge with privacy-awareness is attracted more and more attentions. It then imposes a problem - after data are trained on a mobile terminal to obtain a learned model, how to share the model parameters among others to create more accurate and robust accumulative final model. This kind of model sharing confronts several challenges, e.g., the sharing must be conducted without a third trusted party (autonomously), and the sharing must be fair as model training (by training data)is valuable. To tackle the above challenges, we propose a smart contract and IPFS (Inter-Planetary File System) based model sharing protocol and algorithms to address the challenges. The proposed protocol does not rely on a trusted third party, where individual-learned models are shared/stored in corresponding ends. Conducted through extensive experiments, three main steps of the proposed protocol are evaluated. The average executive time of the three steps are 0.059s, 0.060s and 0.032s, demonstrating its efficiency. Copyright © 2020, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

HAS-QA: Hierarchical answer spans model for open-domain question answering

arXiv

引用

arXiv 2019年

作者： Pang, Liang Lan, Yanyan Guo, Jiafeng Xu, Jun Su, Lixin Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Statistics University of California Berkeley

This paper is concerned with open-domain question answering (i.e., OpenQA). Recently, some works have viewed this problem as a reading comprehension (RC) task, and directly applied successful RC models to it. However, the performances of such models are not so good as that in the RC task. In our opinion, the perspective of RC ignores three characteristics in OpenQA task: 1) many paragraphs without the answer span are included in the data collection;2) multiple answer spans may exist within one given paragraph;3) the end position of an answer span is dependent with the start position. In this paper, we first propose a new probabilistic formulation of OpenQA, based on a three-level hierarchical structure, i.e., the question level, the paragraph level and the answer span level. Then a Hierarchical Answer Spans Model (HAS-QA) is designed to capture each probability. HAS-QA has the ability to tackle the above three problems, and experiments on public OpenQA datasets show that it significantly outperforms traditional RC baselines and recent OpenQA baselines. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：