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

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

Frontiers of Engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

Using Deep Active Learning to Save Sensing Cost When Estimating Overall Air Quality 15th

Using Deep Active Learning to Save Sensing Cost When Estimat...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Lei, Dehao Yu, Zhiyong Li, Peiguan Han, Lei Huang, Fangwan College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

Air quality is widely concerned by the governments and people. To save cost, air quality monitoring stations are deployed at only a few locations, and the stations are actuated at partial time. Therefore, it is necessary to study how to actively collect a subset of air quality data to maximize the estimation accuracy of air quality at other locations and time. In order to solve this challenge, we propose the active variational adversarial model (AVAM) that selects the most valuable unlabeled samples through two iterative phases of active learning. In the first phase of our model, a candidate set with unlabeled samples is selected through traditional active learning. In the second phase, variational auto-encoder (VAE) is used to obtain the compressed representation of the candidate set and the training set with labeled samples, then a discriminator based on three-layer neural network is trained from the compressed representation. Finally the discriminator can output the most valuable unlabeled samples from the candidate set. The experimental results show that the AVAM proposed in this paper is superior to active learning models with the first or second phase only. © 2020, Springer Nature Switzerland AG.

关键词： Air quality

来源：评论

学校读者我要写书评

暂无评论

Echo State Network Based on L0 Norm Regularization for Chaotic Time Series Prediction 15th

Echo State Network Based on L0 Norm Regularization for Chaot...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Li, Li Huang, Fangwan Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

The echo state network introduces a large and sparse reservoir to replace the hidden layer of the traditional recurrent neural network, which can solve the gradient-based problem of most recurrent neural networks in the training process. However, there may be an ill-posed problem when the least square method is used to calculate the output weight. In this paper, we proposed an echo state network based on L0 norm regularization. The main idea is to limit the number of output connections to compute the output effectively by removing unimportant ones. The simulation results of the chaotic time series prediction show the effectiveness of the proposed model. © 2020, Springer Nature Switzerland AG.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

An Improved Sparse Representation Classifier Based on data Augmentation for Time Series Classification 15th

An Improved Sparse Representation Classifier Based on Data A...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Lu, Juhong Huang, Fangwan Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

Sparse Representation-based Classification (SRC), which has achieved good performance in face recognition and other image classification, has been successfully extended to time series classification in recent years. As a generalization of the nearest subspace classifier, the performance of SRC depends on a rich set of training samples for each class, which can span as many variations of each class as possible under testing conditions. However, due to the difficulty of sample collection, many important applications can only provide a few or even a single sample for each class, which inevitably affects the performance of SRC. To address the problem of insufficient training samples, ESRC (Extended SRC) was proposed to put some samples that reflect the variations within the class into the dictionary, to obtain better generalization ability than SRC for under-sampled face recognition. In this paper, a new approach IESRC (Improved extend sparse representation based classification) is developed by splitting the dictionary into an original dictionary and auxiliary dictionary. The proposed model was first evaluated in 30 baseline data sets in the University of California, Riverside time series classification archive and then applied to classify the effects of aerobic exercise intervention in 24 young hypertensive patients based on the time series of the cardiopulmonary exercise test. Experimental results show that the proposed model can achieve better performance than SRC and ESRC in time series classification. © 2020, Springer Nature Switzerland AG.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

An Improved Leaky-ESN for Electricity Load Forecasting 15th

An Improved Leaky-ESN for Electricity Load Forecasting

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Lin, Qiaoying Huang, Fangwan Yu, Zhiyong Li, Li College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030642426

In the recent decade, recurrent neural networks become a hot research field, with the powerful capability to capture temporal information from time series. To avoid the vanishing/exploding gradient problem caused by the gradient descent algorithm involved in most recurrent networks, echo state network (ESN) was proposed to contain a large but sparse reservoir instead of traditional hidden layers. However, the performance of ESN is very sensitive to the parameters of the reservoir. In this paper, we focus on the improvements of ESN in the background of electricity load forecasting. With the goal of effectively and efficiently computation in the context of pervasive and cloud computing, two versions of adaptive echo state network (AESN) are designed to adopt a modular control strategy to automatically adjust some parameters of the reservoir. Applying AESN on two synthetic datasets and two real world electricity datasets, experimental results demonstrate that AESN is viable. © 2020, Springer Nature Switzerland AG.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Dist-PU: Positive-Unlabeled Learning from a Label Distribution Perspective

arXiv

引用

arXiv 2022年

作者： Zhao, Yunrui Xu, Qianqian Jiang, Yangbangyan Wen, Peisong Huang, Qingming School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

Positive-Unlabeled (PU) learning tries to learn binary classifiers from a few labeled positive examples with many unlabeled ones. Compared with ordinary semi-supervised learning, this task is much more challenging due to the absence of any known negative labels. While existing cost-sensitive-based methods have achieved state-of-the-art performances, they explicitly minimize the risk of classifying unlabeled data as negative samples, which might result in a negative-prediction preference of the classifier. To alleviate this issue, we resort to a label distribution perspective for PU learning in this paper. Noticing that the label distribution of unlabeled data is fixed when the class prior is known, it can be naturally used as learning supervision for the model. Motivated by this, we propose to pursue the label distribution consistency between predicted and ground-truth label distributions, which is formulated by aligning their expectations. Moreover, we further adopt the entropy minimization and Mixup regularization to avoid the trivial solution of the label distribution consistency on unlabeled data and mitigate the consequent confirmation bias. Experiments on three benchmark datasets validate the effectiveness of the proposed method. Code available at: https://***/Ray-rui/Dist-PU-Positive-UnlabeledLearning-from-a-Label-Distribution-Perspective. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ER: Equivariance Regularizer for Knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming 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 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 Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Geometry Interaction Knowledge Graph Embeddings

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming 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 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 Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：