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

arXiv 2019年

作者： Zhang, Si-Ping Zhang, Ji-Qiang Chen, Li Liu, Xu-Dong Key Laboratory of Biomedical Information Engineering Ministry of Education Key Laboratory of Neuro-informatics & Rehabilitation Engineering Ministry of Civil Affairs Institute of Health and Rehabilitation Science School of Life Science and Technology Xi'an Jiaotong University Xi'an710049 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China School of Physics and Information Technology Shaanxi Normal University Xi'an710062 China

Large-scale cooperation underpins the evolution of ecosystems and the human society, and the collective behaviors by self-organization of multi-agent systems are the key for understanding. As artificial intelligence (AI) prevails in almost all branches of science, it would be of great interest to see what new insights of collective behavior could be obtained from a multi-agent AI system. Here, we introduce a typical reinforcement learning (RL) algorithm - Q learning into evolutionary game dynamics, where agents pursue optimal action on the basis of the introspectiveness rather than the birth-death or imitation processes in the traditional evolutionary game (EG). We investigate the cooperation prevalence numerically for a general 2 × 2 game setting. We find that the cooperation prevalence in the multi-agent AI is amazingly of equal level as in the traditional EG in most cases. However, in the snowdrift games with RL we also reveal that explosive cooperation appears in the form of periodic oscillation, and we study the impact of the payoff structure on its emergence. Finally, we show that the periodic oscillation can also be observed in some other EGs with the RL algorithm, such as the rock-paper-scissors game. Our results offer a reference point to understand emergence of cooperation and oscillatory behaviors in nature and society from AI's perspective. Copyright © 2019, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

MemNetAR: Memory Network with Adversative Relation for Target-Level Sentiment Classification

MemNetAR: Memory Network with Adversative Relation for Targe...

引用

2019 IEEE Global Communications Conference (GLOBECOM)

作者： Yiwei Gao Jianwei Niu Xuefeng Liu Kaili Mao Shui Yu State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing (BDBC) Beihang University Hangzhou Innovation Research Institute Beihang University School of Computer Science and Cyber Engineering Guangzhou University Guangdong China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

Target-level sentiment classification aims to identify the sentiment of multiple targets in a sentence. Although existing approaches based on neural network have achieved good performance in this task, we find that many approaches tend to give the same predictions for instances that have multiple targets, and this tendency can make a low accuracy for those instances that have different classes for different targets. Based on this observation, we propose MemNetAR, a memory network which can explicitly leverage the adversative relation among multiple targets in a sentence. Specifically, we add an adversative loss to the cross-entropy loss when there are adversative words between targets. The experimental results on public laptop and restaurant datasets prove that our model can improve 0.84% and 0.8% on total test dataset, and improve 2.97% and 2.68% on the dataset consisting of those instances with multiple targets but different classes by leveraging this new adversative information.

关键词： Task analysis Feature extraction Sentiment analysis Portable computers Machine learning Training Predictive models

来源：评论

学校读者我要写书评

暂无评论

Facial expression recognition via weighted group sparsity

引用

Frontiers of Computer Science 2017年第2期11卷 266-275页

作者： Hao ZHENG Xin GENG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University Nanjing 211171 China School of Computer Science and Engineering Southeast University Nanjing 211189 China

Considering the distinctiveness of different group features in the sparse representation, a novel joint multi- task and weighted group sparsity （JMT-WGS） method is pro- posed. By weighting popular group sparsity, not only the rep- resentation coefficients from the same class over their asso- ciate dictionaries may share some similarity, but also the rep- resentation coefficients from different classes have enough di- versity. The proposed method is cast into a multi-task frame- work with two-stage iteration. In the first stage, representa- tion coefficient can be optimized by accelerated proximal gra- dient method when the weights are fixed. In the second stage, the weights are computed via the prior information about their entropy. The experimental results on three facial expres- sion databases show that the proposed algorithm outperforms other state-of-the-art algorithms and demonstrate the promis- ing performance of the proposed algorithm.

关键词： facial expression recognition multi-task learning group sparsity

来源：评论

学校读者我要写书评

暂无评论

Fine-grained event categorization with heterogeneous graph convolutional networks

arXiv

引用

arXiv 2019年

作者： Peng, Hao Li, Jianxin Gong, Qiran Song, Yangqiu Ning, Yuanxing Lai, Kunfeng Yu, Philip S. Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University Department of Computer Science and Engineering Hong Kong University of Science and Technology Platform and Content Group Tencent Institute for Data Science Tsinghua University Department of Computer Science University of Illinois Chicago United States

Events are happening in real-world and real-time, which can be planned and organized occasions involving multiple people and objects. Social media platforms publish a lot of text messages containing public events with comprehensive topics. However, mining social events is challenging due to the heterogeneous event elements in texts and explicit and implicit social network structures. In this paper, we design an event meta-schema to characterize the semantic relatedness of social events and build an event-based heterogeneous information network (HIN) integrating information from external knowledge base, and propose a novel Pairwise Popularity Graph Convolutional Network (PP-GCN) based fine-grained social event categorization model. We propose a Knowledgeable meta-paths Instances based social Event Similarity (KIES) between events and build a weighted adjacent matrix as input to the PP-GCN model. Comprehensive experiments on real data collections are conducted to compare various social event detection and clustering tasks. Experimental results demonstrate that our proposed framework outperforms other alternative social event categorization techniques. Copyright © 2019, The Authors. All rights reserved.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

Linearized Proximal Alternating Direction Method of Multipliers for Parallel Magnetic Resonance Imaging

引用

IEEE/CAA Journal of Automatica Sinica 2017年第4期4卷 763-769页

作者： Benxin Zhang Zhibin Zhu School of Electronic Engineering and Automation and Guangxi Key Laboratory of Automatic Detecting Technology and Instruments Guilin University of Electronic Technology School of Mathematics and Computing Science and Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation Guilin University of Electronic Technology

In this study, we propose a linearized proximal alternating direction method with variable stepsize for solving total variation image reconstruction problems. Our method uses a linearized technique and the proximal function such that the closed form solutions of the subproblem can be easily *** the subproblem, we apply a variable stepsize, that is like Barzilai-Borwein stepsize, to accelerate the algorithm. Numerical results with parallel magnetic resonance imaging demonstrate the efficiency of the proposed algorithm.

关键词： Alternating direction method Barzilai-Borwein stepsize parallel magnetic resonance imaging total variation image reconstruction

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2019年

作者： Liao, Hao Liu, Ming-Kai Mariani, Manuel Sebastian Zhou, Mingyang Wu, Xingtong National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610051 China URPP Social Networks Universität Zürich CH-8050 Switzerland

When investigating the spreading of a piece of information or the diffusion of an innovation, we often lack information on the underlying propagation network. Reconstructing the hidden propagation paths based on the observed diffusion process is a challenging problem which has recently attracted attention from diverse research fields. To address this reconstruction problem, based on static similarity metrics commonly used in the link prediction literature, we introduce new node-node temporal similarity metrics. The new metrics take as input the time-series of multiple independent spreading processes, based on the hypothesis that two nodes are more likely to be connected if they were often infected at similar points in time. This hypothesis is implemented by introducing a time-lag function which penalizes distant infection times. We find that the choice of this time-lag strongly affects the metrics' reconstruction accuracy, depending on the network's clustering coefficient and we provide an extensive comparative analysis of static and temporal similarity metrics for network reconstruction. Our findings shed new light on the notion of similarity between pairs of nodes in complex networks. Copyright © 2019, The Authors. All rights reserved.

关键词： Information services

来源：评论

学校读者我要写书评

暂无评论

An Early Stage Researcher's Primer on Systems Medicine Terminology

Network and Systems Medicine

引用

Network and Systems Medicine 2021年第1期4卷 2-50页

作者： Zanin, Massimiliano Aitya, Nadim A.A. Basilio, José Baumbach, Jan Benis, Arriel Behera, Chandan K. Bucholc, Magda Castiglione, Filippo Chouvarda, Ioanna Comte, Blandine Dao, Tien-Tuan Ding, Xuemei Pujos-Guillot, Estelle Filipovic, Nenad Finn, David P. Glass, David H. Harel, Nissim Iesmantas, Tomas Ivanoska, Ilinka Joshi, Alok Boudjeltia, Karim Zouaoui Kaoui, Badr Kaur, Daman Maguire, Liam P. McClean, Paula L. McCombe, Niamh De Miranda, João Luís Moisescu, Mihnea Alexandru Pappalardo, Francesco Polster, Annikka Prasad, Girijesh Rozman, Damjana Sacala, Ioan Sanchez-Bornot, Jose M. Schmid, Johannes A. Sharp, Trevor Solé-Casals, Jordi Spiwok, Vojtěch Spyrou, George M. Stalidzans, Egils Stres, Blaa Sustersic, Tijana Symeonidis, Ioannis Tieri, Paolo Todd, Stephen Van Steen, Kristel Veneva, Milena Wang, Da-Hui Wang, Haiying Wang, Hui Watterson, Steven Wong-Lin, Kongfatt Yang, Su Zou, Xin Schmidt, Harald H.H.W. Centro de Tecnología Biomédica Universidad Politécnica de Madrid Madrid Spain Intelligent Systems Research Centre School of Computing Engineering and Intelligent Systems Ulster University Ulster United Kingdom Center for Physiology and Pharmacology Institute of Vascular Biology and Thrombosis Research Medical University of Vienna Vienna Austria TUM School of Life Sciences Weihenstephan Technical University of Munich Freising Germany Holon Israel CNR National Research Council IAC Institute for Applied Computing Rome Italy Lab of Computing Medical Informatics and Biomedical Imaging Technologies School of Medicine Aristotle University of Thessaloniki Thessaloniki Greece Université Clermont Auvergne INRAE UNH Plateforme d'Exploration du Métabolisme MetaboHUB Clermont Clermont-Ferrand France Université de Technologie de Compiègne Compiègne France Labex MS2T Control of Technological Systems-of-Systems CNRS and Université de Technologie de Compiègne Compiègne France Faculty of Engineering University of Kragujevac Kragujevac Serbia Kragujevac Serbia Steinbeis Advanced Risk Technologies Institute Doo Kragujevac Kragujevac Serbia Pharmacology and Therapeutics School of Medicine Galway Neuroscience Centre National University of Ireland Galway Ireland School of Computing Ulster University Ulster United Kingdom Holon Israel Department of Mathematics and Natural Sciences Kaunas University of Technology Kaunas Lithuania Faculty of Computer Science and Engineering Ss. Cyril and Methodius University Skopje Macedonia Medicine Faculty Université Libre de Bruxelles CHU de Charleroi Charleroi Belgium Northern Ireland Centre for Stratified Medicine Biomedical Sciences Research Institute Ulster University Ulster United Kingdom Escola Superior de Tecnologia e Gestão Instituto Politécnico de Portalegre Portalegre Portugal Instituto Superior Técnico Universidade de Lisboa Lisboa Portugal Faculty of Automatic Control and Computers University Politehnica of B

Background: Systems Medicine is a novel approach to medicine, that is, an interdisciplinary field that considers the human body as a system, composed of multiple parts and of complex relationships at multiple levels, and further integrated into an environment. Exploring Systems Medicine implies understanding and combining concepts coming from diametral different fields, including medicine, biology, statistics, modeling and simulation, and data science. Such heterogeneity leads to semantic issues, which may slow down implementation and fruitful interaction between these highly diverse fields. Methods: In this review, we collect and explain more than100 terms related to Systems Medicine. These include both modeling and data science terms and basic systems medicine terms, along with some synthetic definitions, examples of applications, and lists of relevant references. Results: This glossary aims at being a first aid kit for the Systems Medicine researcher facing an unfamiliar term, where he/she can get a first understanding of them, and, more importantly, examples and references for digging into the topic. © Massimiliano Zanin et al., 2021;Published by Mary Ann Liebert, Inc. 2021.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Ultra-scalable spectral clustering and ensemble clustering

arXiv

引用

arXiv 2019年

作者： Huang, Dong Wang, Chang-Dong Wu, Jian-Sheng Lai, Jian-Huang Kwoh, Chee-Keong College of Mathematics and Informatics South China Agricultural University Guangzhou China School of Computer Science and Engineering Nanyang Technological University Singapore Singapore School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China School of Information Engineering Nanchang University Nanchang China School of Computer Science and Engineering Nanyang Technological University Singapore Singapore

This paper focuses on scalability and robustness of spectral clustering for extremely large-scale datasets with limited resources. Two novel algorithms are proposed, namely, ultra-scalable spectral clustering (U-SPEC) and ultra-scalable ensemble clustering (U-SENC). In U-SPEC, a hybrid representative selection strategy and a fast approximation method for K-nearest representatives are proposed for the construction of a sparse affinity sub-matrix. By interpreting the sparse sub-matrix as a bipartite graph, the transfer cut is then utilized to efficiently partition the graph and obtain the clustering result. In U-SENC, multiple U-SPEC clusterers are further integrated into an ensemble clustering framework to enhance the robustness of U-SPEC while maintaining high efficiency. Based on the ensemble generation via multiple U-SEPC's, a new bipartite graph is constructed between objects and base clusters and then efficiently partitioned to achieve the consensus clustering result. It is noteworthy that both U-SPEC and U-SENC have nearly linear time and space complexity, and are capable of robustly and efficiently partitioning ten-million-level nonlinearly-separable datasets on a PC with 64GB memory. Experiments on various large-scale datasets have demonstrated the scalability and robustness of our algorithms. The MATLAB code and experimental data are available at https://***/publication/330760669. Copyright © 2019, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Time-aware conversion prediction

引用

Frontiers of Computer Science 2017年第4期11卷 702-716页

作者： Wendi JI Xiaoling WANG Feida ZHU Shanghai Key Laboratory of Trustworthy Computing Institute for Data Science and Engineering East China Normal University Shanghai 200062 China School of Information Systems Singapore Management University Singapore 188065 Singapore

The importance of product recommendation has been well recognized as a central task in business intelligence for e-commerce websites. Interestingly, what has been less aware of is the fact that different products take different time periods for conversion. The ＂conversion＂ here refers to actu- ally a more general set of pre-defined actions, including for example purchases or registrations in recommendation and advertising systems. The mismatch between the product＇s ac- tual conversion period and the application＇s target conversion period has been the subtle culprit compromising many exist- ing recommendation algorithms. The challenging question： what products should be recom- mended for a given time period to maximize conversion--is what has motivated us in this paper to propose a rank-based time-aware conversion prediction model （rTCP）, which con- siders both recommendation relevance and conversion time. We adopt lifetime models in survival analysis to model the conversion time and personalize the temporal prediction by incorporating context information such as user preference. A novel mixture lifetime model is proposed to further accom- modate the complexity of conversion intervals. Experimental results on two real-world data sets illustrate the high good- ness of fit of our proposed model rTCP and demonstrate its effectiveness in time-aware conversion rate prediction for ad- vertising and product recommendation.

关键词： conversion time survival analysis product rec-ommendation advertising

来源：评论

学校读者我要写书评

暂无评论

Feature extraction for hyperspectral imagery: The evolution from shallow to deep

arXiv

引用

arXiv 2020年

作者： Rasti, Behnood Hong, Danfeng Hang, Renlong Ghamisi, Pedram Kang, Xudong Chanussot, Jocelyn Benediktsson, Jon Atli Machine Learning Group Exploration Division Helmholtz Institute Freiberg for Resource Technology Helmholtz-Zentrum Dresden-Rossendorf Freiberg09599 Germany Univ. Grenoble Alpes CNRS Grenoble INP GIPSAlab Grenoble38000 France Jiangsu Key Laboratory of Big Data Analysis Technology School of Automation Nanjing University of Information Science and Technology Nanjing210044 China Machine Learning Group Exploration Division Helmholtz Institute Freiberg for Resource Technology Helmholtz-Zentrum Dresden-Rossendorf Freiberg09599 Germany College of Electrical and Information Engineering Hunan University Changsha410082 China Key Laboratory of Visual Perception and Artificial Intelligence of Hunan Province Changsha410082 China Univ. Grenoble Alpes Inria CNRS Grenoble INP LJK GrenobleF-38000 France Faculty of Electrical and Computer Engineering University of Iceland Reykjavik101 Iceland Faculty of Electrical and Computer Engineering University of Iceland Reykjavik107 Iceland

The final version of the paper can be found in IEEE Geoscience and Remote Sensing Magazine. Hyperspectral images provide detailed spectral information through hundreds of (narrow) spectral channels (also known as dimensionality or bands) with continuous spectral information that can accurately classify diverse materials of interest. The increased dimensionality of such data makes it possible to significantly improve data information content but provides a challenge to the conventional techniques (the so-called curse of dimensionality) for accurate analysis of hyperspectral images. Feature extraction, as a vibrant field of research in the hyperspectral community, evolved through decades of research to address this issue and extract informative features suitable for data representation and classification. The advances in feature extraction have been inspired by two fields of research, including the popularization of image and signal processing as well as machine (deep) learning, leading to two types of feature extraction approaches named shallow and deep techniques. This article outlines the advances in feature extraction approaches for hyperspectral imagery by providing a technical overview of the state-of-the-art techniques, providing useful entry points for researchers at different levels, including students, researchers, and senior researchers, willing to explore novel investigations on this challenging topic. In more detail, this paper provides a bird's eye view over shallow (both supervised and unsupervised) and deep feature extraction approaches specifically dedicated to the topic of hyperspectral feature extraction and its application on hyperspectral image classification. Additionally, this paper compares 15 advanced techniques with an emphasis on their methodological foundations in terms of classification accuracies. Furthermore, to push this vibrant field of research forward an impressive amount of codes and libraries is shared at: https://***/Behnoo

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：