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

arXiv 2022年

作者： Sciarra, Alessandro Chatterjee, Soumick Dünnwald, Max Placidi, Giuseppe Nürnberger, Andreas Speck, Oliver Oeltze-Jafra, Steffen The Medicine and Digitalization - MedDigit Group Department of Neurology Medical Faculty University Hospital Magdeburg Germany the Department of Biomedical Magnetic Resonance Faculty of Natural Sciences Otto von Guericke University Germany The Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Germany The Genomics Research Centre Human Technopole Milan Italy The Faculty of Computer Science Otto von Guericke University Germany The Department of Life Health and Environmental Sciences University of L'Aquila Italy The Center for Behavioral Brain Sciences Magdeburg Germany The German Center for Neurodegenerative Disease Magdeburg Germany

Motion artefacts in magnetic resonance brain images can have a strong impact on diagnostic confidence. The assessment of MR image quality is fundamental before proceeding with the clinical diagnosis. Motion artefacts can alter the delineation of structures such as the brain, lesions or tumours and may require a repeat scan. Otherwise, an inaccurate (e.g. correct pathology but wrong severity) or incorrect diagnosis (e.g. wrong pathology) may occur."Image quality assessment" as a fast, automated step right after scanning can assist in deciding if the acquired images are diagnostically sufficient. An automated image quality assessment based on the structural similarity index (SSIM) regression through a residual neural network is proposed in this work. Additionally, a classification into different groups - by subdividing with SSIM ranges - is evaluated. Importantly, this method predicts SSIM values of an input image in the absence of a reference ground truth image. The networks were able to detect motion artefacts, and the best performance for the regression and classification task has always been achieved with ResNet-18 with contrast augmentation. The mean and standard deviation of residuals' distribution were µ = −0.0009 and σ = 0.0139, respectively. Whilst for the classification task in 3, 5 and 10 classes, the best accuracies were 97, 95 and 89%, respectively. The results show that the proposed method could be a tool for supporting neuro-radiologists and radiographers in evaluating image quality quickly. Copyright © 2022, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Social emotion mining techniques for facebook posts reaction prediction 10

Social emotion mining techniques for facebook posts reaction...

引用

10th International Conference on Agents and Artificial Intelligence, ICAART 2018

作者： Krebs, Florian Lubascher, Bruno Moers, Tobias Schaap, Pieter Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

ISBN: (纸本)9789897582752

As of February 2016 Facebook allows users to express their experienced emotions about a post by using five so-called ‘reactions’. This research paper proposes and evaluates alternative methods for predicting these reactions to user posts on public pages of firms/companies (like supermarket chains). For this purpose, we collected posts (and their reactions) from Facebook pages of large supermarket chains and constructed a dataset which is available for other researches. In order to predict the distribution of reactions of a new post, neural network architectures (convolutional and recurrent neural networks) were tested using pretrained word embeddings. Results of the neural networks were improved by introducing a bootstrapping approach for sentiment and emotion mining on the comments for each post. The final model (a combination of neural network and a baseline emotion miner) is able to predict the reaction distribution on Facebook posts with a mean squared error (or misclassification rate) of 0.135. Copyright © 2018 by SCITEPRESS – science and Technology Publications, Lda. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Senzi: A sentiment analysis lexicon for the latinised Arabic (Arabizi) 12

Senzi: A sentiment analysis lexicon for the latinised Arabic...

引用

12th International Conference on Recent Advances in Natural Language Processing, RANLP 2019

作者： Tobaili, Taha Fernandez, Miriam Alani, Harith Sharafeddine, Sanaa Hajj, Hazem Glavaš, Goran Knowledge Media Institute Open University United Kingdom Department of Computer Science and Mathematics Lebanese American University Lebanon Department of Electrical and Computer Engineering American University of Beirut Lebanon Data and Web Science Group Universität Mannheim Germany

ISBN: (纸本)9789544520557

Arabizi is an informal written form of dialectal Arabic transcribed in Latin alphanumeric characters. It has a proven popularity on chat platforms and social media, yet it suffers from a severe lack of natural language processing (NLP) resources. As such, texts written in Arabizi are often disregarded in sentiment analysis tasks for Arabic. In this paper we describe the creation of a sentiment lexicon for Arabizi that was enriched with word embeddings. The result is a new Arabizi lexicon consisting of 11.3K positive and 13.3K negative words. We evaluated this lexicon by classifying the sentiment of Arabizi tweets achieving an F1-score of 0.72. We provide a detailed error analysis to present the challenges that impact the sentiment analysis of Arabizi. © 2019 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

knowledge graph enhanced neural collaborative recommendation

引用

Expert Systems with Applications 2021年 164卷 113992-113992页

作者： Sang, Lei Xu, Min Qian, Shengsheng Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 230009 China Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 China Institute of Automation Chinese Academy of Sciences Beijing 100190 China Mininglamp Academy of Sciences Mininglamp Technology Beijing 100084 China

Existing neural collaborative filtering (NCF) recommendation methods suffer from severe sparsity problem. knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem. However, pure NCF models can hardly model the high-order connectivity in KG, and ignores complex pairwise correlations between user/item embedding dimensions. To address these problems, we propose a novel knowledge graph enhanced Neural Collaborative Recommendation (K-NCR) framework, which effectively combines user–item interaction information and auxiliary knowledge information for recommendation task into three parts: (1) For items, the proposed propagating model learns the representation of item entity. It recursively aggregates information from its multi-hop neighbours in KG, and employs an attention mechanism to discriminate the importance of the relation type to mine users’ potential preferences. (2) For users, another heterogeneous attention weights are leveraged to strengthen the embedding learning of users. (3) The user and item embeddings are then fed into a newly designed two-dimensional interaction map with convolutional hidden layers to model the complex pairwise correlations between their embedding dimensions explicitly. Extensive experimental results on three benchmark datasets demonstrate the effectiveness of our K-NCR framework. © 2020

关键词： Attention mechanism Graph convolutional networks knowledge graph Neural collaborative filtering Recommendation system

来源：评论

学校读者我要写书评

暂无评论

Unsupervised vehicle re-identification with progressive adaptation

arXiv

引用

arXiv 2020年

作者： Peng, Jinjia Wang, Yang Wang, Huibing Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University LiaoningDalian China Pengcheng Laboratory ShenzhenGuangdong China Key Laboratory of Knowledge Engineering with Big Data Ministry of education Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

Vehicle re-identification (reID) aims at identifying vehicles across different non-overlapping cameras views. The existing methods heavily relied on well-labeled datasets for ideal performance, which inevitably causes fateful drop due to the severe domain bias between the training domain and the real-world scenes;worse still, these approaches required full annotations, which is labor-consuming. To tackle these challenges, we propose a novel progressive adaptation learning method for vehicle reID, named PAL, which infers from the abundant data without annotations. For PAL, a data adaptation module is employed for source domain, which generates the images with similar data distribution to unlabeled target domain as "pseudo target samples". These pseudo samples are combined with the unlabeled samples that are selected by a dynamic sampling strategy to make training faster. We further proposed a weighted label smoothing (WLS) loss, which considers the similarity between samples with different clusters to balance the confidence of pseudo labels. Comprehensive experimental results validate the advantages of PAL on both VehicleID and VeRi-776 dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

MDPL-net: Multi-layer Dictionary Learning Network with Added Skip Dense Connections

MDPL-net: Multi-layer Dictionary Learning Network with Added...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Lin Wu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Dictionary learning (DL) is powerful for representation learning, while it fails to capture the deep hierarchical information hidden in data. In this paper, we propose a new generalized end-to-end mulita-layer representation learning architecture referred to as Multi-layer Dictionary Pair Learning Network (MDPL-net) for the deep sparse and hierarchical representation of images. To enable MDPL-net to conduct accurate classification, MDPL-net clearly integrates the skip connection end-to-end network and multi-layer deep sparse dictionary learning into a unified architecture. The representation learning module has several hidden DL blocks, where each hidden DL block has a dictionary pair learning (DPL) layer, a batch-norm layer and an activation function layer, and the DL blocks are connected in a feed-forward manner. To further improve the information flow and maintain the privileged features between different DL blocks, a novel skip dense connectivity pattern is deployed between hidden DL blocks, which can obtain more stable and discriminative features. The DPL layer jointly formulates the discriminative synthesis dictionary and analysis dictionary by minimizing reconstruction error within each batch over the feature maps from front layers. Extensive results on benchmark databases demonstrate the effectiveness of MDPL-net for discriminative representation and robust image classification.

关键词： Dictionaries databases Conferences Machine learning data mining Image reconstruction Image classification

来源：评论

学校读者我要写书评

暂无评论

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

arXiv

引用

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Autoregressive convolutional recurrent neural network for univariate and multivariate time series prediction

arXiv

引用

arXiv 2019年

作者： Maggiolo, Matteo Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University Maastricht6200MD Netherlands

Time Series forecasting (univariate and multivariate) is a problem of high complexity due the different patterns that have to be detected in the input, ranging from high to low frequencies ones. In this paper we propose a new model for timeseries prediction that utilizes convolutional layers for feature extraction, a recurrent encoder and a linear autoregressive component. We motivate the model and we test and compare it against a baseline of widely used existing architectures for univariate and multivariate timeseries. The proposed model appears to outperform the baselines in almost every case of the multivariate timeseries datasets, in some cases even with 50% improvement which shows the strengths of such a hybrid architecture in complex timeseries. Copyright © 2019, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

On multi-objective minimum spanning tree under the framework of uncertainty theory

引用

AIP Conference Proceedings 2023年第1期2851卷

作者： Swapna Halder Saibal Majumder Arindam Biswas Bijoy Kumar Mandal Sheng-Lung Peng Department of Computer Science and Engineering St. Thomas College of Engineering & Technology Kolkata West Bengal India Centre for IOT and AI Integration with Education -Industry-Agriculture Kazi Nazrul University Asansol West Bengal India Department of Computer Science and Engineering (Data Science) Dr. B. C. Roy Engineering College Durgapur West Bengal India School of Mines and Metallurgy Kazi Nazrul University Asansol West Bengal India Department of Computer Science and Engineering NSHM Knowledge Campus Durgapur West Bengal India Department of Creative Technologies and Product Design National Taipei University of Business Taoyuan Taiwan

Aminimum spanning tree with multiple objectives is one type of NP hard problem, and it has a wide application area in ourdaily life. Modelling real world problems, requires many associated parameters which are not well-defined and are indeterminate in nature. Thus, it is rational to consider these indeterminate parameters while modelling real life problems. This article, investigates onthe study of minimum spanning tree with multiple objectives which are uncertain in nature. The proposed multiple objectives minimum spanning tree has two uncertain parameters associated with it, they are time and cost. Both of these parameters are indeterminate in nature and characterizedas uncertain variables. The expected value model (EVM) of multiple objectives minimum spanning tree is formulatedin this study and convex combination method is used to solve this problem. Finally to achieve the nondominated solutions of this problem, we have solved the EVM by varying the related weights of its objectives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：