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

MFPR: A Personalized Ranking Recommendation with Multiple Feedback

ACM Transactions on Social Computing 2018年第2期1卷 1–22页

作者： Shi, Chuan Liu, Jian Zhang, Yiding Hu, Binbin Liu, Shenghua Yu, Philip S. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications No. 10 Xi Tu Cheng Road Beijing China Cas Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Beijing China Department of Computer Science University of Illinois at Chicago 851 South Morgan Street Chicago United States

Recently, recommender systems have played an important role in improving web user experiences and increasing profits. Recommender systems exploit users' behavioral history (i.e., feedback on items) to build models. The feedback usually includes explicit feedback (e.g., ratings) and implicit feedback (e.g., browsing history, click logs), which are both useful for improving recommendations. However, as far as we are concerned, no existing works have integrated both explicit and multiple implicit feedback simultaneously. Therefore, we propose a unified and flexible model, named Multiple Feedback-based Personalized Ranking (MFPR), to make full use of multiple feedback, which uses a personalized ranking framework. To train model MFPR, we design an algorithm to generate ordered item pairs as labeled data, with consideration of both rating scores and multiple implicit feedback. Extensive experiments on two real-world datasets validate the effectiveness of the MFPR model. With the integration of multiple feedback, MFPR significantly improves recommendation performance. © 2018 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Graph based Tensor Recovery for Accurate Internet Anomaly Detection

Graph based Tensor Recovery for Accurate Internet Anomaly De...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Xie, Kun Li, Xiaocan Wang, Xin Xie, Gaogang Wen, Jigang Zhang, Dafang College of Computer Science and Electronics Engineering Hunan University China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China Department of Electrical and Computer Engineering State University of New York at Stony Brook United States Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9781538641286

Detecting anomalous traffic is a crucial task of managing networks. Many anomaly detection algorithms have been proposed recently. However, constrained by their matrix-based traffic data model, existing algorithms often suffer from low detection accuracy. To fully utilize the multi-dimensional information hidden in the traffic data, this paper takes an initiative to investigate the potential and methodologies of performing tensor factorization for more accurate Internet anomaly detection. Only considering the low-rank linearity features hidden in the data, current tensor factorization techniques would result in low anomaly detection accuracy. We propose a novel Graph-based Tensor Recovery model (Graph-TR) to well explore both low rank linearity features as well as the non-linear proximity information hidden in the traffic data for better anomaly detection. We encode the non-linear proximity information of the traffic data by constructing nearest neighbor graphs and incorporate this information into the tensor factorization using the graph Laplacian. Moreover, to facilitate the quick building of neighbor graph, we propose a nearest neighbor searching algorithm with the simple locality-sensitive hashing (LSH). We have conducted extensive experiments using Internet traffic trace data Abilene and GEANT. Compared with the state of art algorithms on matrix-based anomaly detection and tensor recovery approach, our Graph-Trcan achieve significantly lower False Positive Rate and higher True Positive Rate. © 2018 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Fair electronic voting via bitcoin deposits 5th

Fair electronic voting via bitcoin deposits

引用

5th International Conference on Geo-Spatial Knowledge and Intelligence, GSKI 2017

作者： Wu, Xijuan Wei, Baodian Tian, Haibo Du, Yusong Ma, Xiao School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China Chongqing Key Lab of Computer Network and Communication Technology Chongqing China

ISBN: (纸本)9789811308956

Bitcoin is the most popular decentralized digital currency now in use. Block chain is the basic technology of Bitcoin, providing a trustable ledger that can be publicly verified. Research on distributed applications based on block chain has become a new trend. We propose an electronic voting scheme based on block chain and prime numbers, which can support voting situations for multiple candidates. We design protocols for the Bitcoin voting situation, in which there are n voters and k candidates. Each voter will vote for one candidate. The proposed protocols could guarantee that the candidate who gets the majority voting wins the game and no individual voting information is disclosed. Due to the nature of the block chain, the voting results could not be tampered. It is transparent since the block chain is open to the public for verification. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Deposits

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Structured Information Extraction of Pathology Reports with Attention-based Graph Convolutional network

Structured Information Extraction of Pathology Reports with ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jialun Wu Kaiwen Tang Haichuan Zhang Chunbao Wang Chen Li School of Computer Science and Technology Xi’an Jiaotong University Xi’an Shaanxi China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Xi’an Shaanxi China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech.R&D Xi’an Jiaotong University Xi’an Shaanxi China School of Computer Science and Technology Qian Xuesen College Xi’an Jiaotong University Xi’an Shaanxi China the First Affiliated Hospital of Xi’an Jiaotong University Xi’an Shaanxi China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Electronic medical data contains biochemical, imaging, pathological information during diagnosis and treatment. The pathology report is a kind of highly liberalized unstructured textual data, which is the basis and gold standard of cancer diagnosis and is very important for the prognosis and treatment of patients. The application of information extraction technology to pathological reports can obtain structured data that can be understood and analyzed by computers, helping pathologists make appropriate decisions. In this work, we proposed an attention-based graph convolutional network (GCN) for converting unstructured pathological reports into a structured form suitable for computer analysis to improve the current pathologist's workflow, collected medical data from different platforms, and provided more accurate assistance for diagnosis and treatment. We used pathology reports data from TCGA (The Cancer Genome Atlas) database with fine-grained annotations on 3632 pathology reports including four types of cancers. Our method performs better in our pathology report dataset with higher F1 score than traditional methods and deep learning methods. The results indicate that our method is robust, thus may work with other types of cancer pathology report.

关键词： Pathology Cancer Task analysis Annotations Information retrieval Medical diagnostic imaging data mining

来源：评论

学校读者我要写书评

暂无评论

Sdgan: Improve Speech Enhancement Quality by Information Filter

引用

Journal of Physics: Conference Series 2021年第1期1871卷

作者： Xiaozhou Guo Yi Liu Wenyu Mao Jixing Li Wenchang Li Guoliang Gong Huaxiang Lu Institute of Semiconductors Chinese Academy of Sciences Beijing 100083 China University of Chinese Academy of Sciences Beijing 100089 China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Beijing 200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing 100083 China

The speech denoising model based on adversarial generative network has achieved better results than the traditional machine learning model. In this paper, for the short cut connection in the generator, we discuss its influence on the information transfer between encoder and decoder, and propose SDGAN at target. SDGAN sets linear and convolution filters in the short cut connection which adaptively learn the optimal information processing. The information filter still enables the generator to solve the gradient vanishing problem, and it can also avoid information redundancy and improve expression ability. In addition, SDGAN replaces the L1 regularization term in loss function with the L2 regularization term, which not only makes the output speech of the generator closer to the clean speech, but also avoids sparsity. In the experiments, SDGAN significantly performs better than other traditional GAN in five performance metrics (such as PESQ), and the effect of convolution filter is better than that of linear filter.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PGGAN: Improve Password Cover Rate Using the Controller

引用

Journal of Physics: Conference Series 2021年第1期1856卷

作者： Xiaozhou Guo Yi Liu Kaijun Tan Min Jin Huaxiang Lu Institute of Semiconductors Chinese Academy of Sciences Beijing 100083 China University of Chinese Academy of Sciences Beijing 100089 China CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences Beijing 200031 China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Lab Beijing 100083 China

Password generation model based on generative adversarial network usually has the problem of high duplicate rate, which further leads to low cover rate. In this regard, we propose PGGAN model. It sets up an additional controller network which is similar to the discriminator in the aspect of structure and function. The discriminator and the controller respectively learn the measure between the distribution of generated password with the real password distribution and the uniform distribution, and then use two measures to teach generator meanwhile. By changing the activation function and loss function of the controller, different measure functions can be selected. The experimental results show that compared with GAN, our PGGAN performs better both in cover rate and duplicate rate. Moreover, Wasserstein distance usually has a better effect to the other measure in model. Specifically, PGGAN with Wasserstein distance can increase the cover rate by 3.57% and reduce the duplicate rate by 30.85% on rockyou dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An application of insurance mechanism in risk management for energy internet

引用

High technology Letters 2018年第2期24卷 196-202页

作者： Yang Yunxue Zhang Qin Zhang Libo CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 P. R. China College of Economics and Management Nanjing University of Aeronautics and Astronautics Nanjing 210016 P. R. China Business College Yantai Nanshan University Yantai 265713 P. R. China

As a completely new residential distribution infrastructure,energy internet facilitates transactions of equipment,energy and services. However,there is security risk under all the *** paper proposes an electricity pricing model based on insurance from the perspective of maximizing the benefits of Energy Internet service providers by using the principal-agent theory. The consumer prepays the provider insurance premiums and signs a contract. The provider sets electricity price according to the premiums and therefore provides differentiated electric services for the consumer. Loss suffered by the consumer due to the power failure is compensated by the provider according to the contract. The equivalent model is presented and a necessary condition of the optimal strategy is obtained on the basis of Pontryagin's maximum principle. At last,a numerical example is presented,which illustrates the effectiveness of the proposed model.

关键词： energy internet insurance risk management optimal control fuzzy theory

来源：评论

学校读者我要写书评

暂无评论

MQGrad: Reinforcement learning of gradient quantization in parameter server

arXiv

引用

arXiv 2018年

作者： Cui, Guoxin Xu, Jun Zeng, Wei Lan, Yanyan Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of ComputingTechnology Chinese Academy of Sciences Beijing100190 China

One of the most significant bottleneck in training large scale machine learning models on parameter server (PS) is the communication overhead, because it needs to frequently exchange the model gradients between the workers and servers during the training iterations. Gradient quantization has been proposed as an effective approach to reducing the communication volume. One key issue in gradient quantization is setting the number of bits for quantizing the gradients. Small number of bits can significantly reduce the communication overhead while hurts the gradient accuracies, and vise versa. An ideal quantization method would dynamically balance the communication overhead and model accuracy, through adjusting the number bits according to the knowledge learned from the immediate past training iterations. Existing methods, however, quantize the gradients either with fixed number of bits, or with predefined heuristic rules. In this paper we propose a novel adaptive quantization method within the framework of reinforcement learning. The method, referred to as MQGrad, formalizes the selection of quantization bits as actions in a Markov decision process (MDP) where the MDP states records the information collected from the past optimization iterations (e.g., the sequence of the loss function values). During the training iterations of a machine learning algorithm, MQGrad continuously updates the MDP state according to the changes of the loss function. Based on the information, MDP learns to select the optimal actions (number of bits) to quantize the gradients. Experimental results based on a benchmark dataset showed that MQGrad can accelerate the learning of a large scale deep neural network while keeping its prediction accuracies. Copyright © 2018, The Authors. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Dynamic-K recommendation with personalized decision boundary 23rd

Dynamic-K recommendation with personalized decision boundary

引用

23rd China conference on Information Retrieval, CCIR 2017

作者： Gao, Yan Guo, Jiafeng Lan, Yanyan Liao, Huaming CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319686981

In this paper, we investigate the recommendation task in the most common scenario with implicit feedback (e.g., clicks, purchases). State-of-the-art methods in this direction usually cast the problem as to learn a personalized ranking on a set of items (e.g., webpages, products). The top-N results are then provided to users as recommendations, where the N is usually a fixed number pre-defined by the system according to some heuristic criteria (e.g., page size, screen size). There is one major assumption underlying this fixed-number recommendation scheme, i.e., there are always sufficient relevant items to users’ preferences. Unfortunately, this assumption may not always hold in real-world scenarios. In some applications, there might be very limited candidate items to recommend, and some users may have very high relevance requirement in recommendation. In this way, even the top-1 ranked item may not be relevant to a user’s preference. Therefore, we argue that it is critical to provide a dynamic-K recommendation, where the K should be different with respect to the candidate item set and the target user. We formulate this dynamic-K recommendation task as a joint learning problem with both ranking and classification objectives. The ranking objective is the same as existing methods, i.e., to create a ranking list of items according to users’ interests. The classification objective is unique in this work, which aims to learn a personalized decision boundary to differentiate the relevant items from irrelevant items. Based on these ideas, we extend two state-of-the-art ranking-based recommendation methods, i.e., BPRMF and HRM, to the corresponding dynamic-K versions, namely DK-BPRMF and DK-HRM. Our experimental results on two datasets show that the dynamic-K models are more effective than the original fixed-N recommendation methods. © Springer International Publishing AG 2017.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：