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

SSRN 2023年

作者： Zhang, Jing Shi, Wenlong Ye, Xiucai Tsai, Peiwei School of Computer Science and Mathematics Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou China Department of Computer Science University of Tsukuba Tsukuba Japan Department of Computer Science and Software Engineering Swinburne University of Technology Hawthorn Australia

Traffic prediction is of vital importance in intelligent transportation systems. It can realize efficient route planning, avoid traffic congestion and reduce travel time, etc. However, it is difficult to make accurate road traffic prediction, due to the complex spatiotemporal dependencies of the traffic network. The construction and learning of spatial dependencies play a pivotal role in road traffic prediction, laying the foundation for accurate traffic prediction. Regrettably, most of the existing methods for capturing spatial dependencies only consider a single spatial relationship, ignoring other potential temporal and spatial correlations in the traffic network. Moreover, the end-to-end training methods are difficult to control the training direction during graph learning. Additionally, the result of traffic forecasting lacks of fusing multiple traffic data information. All of these have adverse effects on road traffic prediction. In other to capture the spatiotemporal dependencies of the traffic network accurately, a novel traffic prediction framework, Adaptive Spatio-Temporal Graph Neural Network based on Multi-graph Fusion (DTS-adapSTNet), is proposed. First of all, in order to better extract the hidden spatial dependencies, a method of fusing multiple factors is designed, which includs the distance relationship, transfer relationship and same-road segment relationship of traffic data, etc. Secondly, an adaptive learning method is proposed, which can control the learning direction of parameters better by the adaptive matrix generation module and traffic prediction module. Thirdly, an improved loss function is designed for training processes and a multi-matrix fusion module is designed to perform weighted fusion of the learned matrices, updating the spatial adjacency matrix continuously, which fuses as much traffic information as possible for more accurate traffic prediction. Finally, based on the experiments by two large real-world datasets, the DTS-adapSTNe

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

SSC- l0 : Sparse Subspace Clustering with the l0 Inequality Constraint 7th

SSC- l0 : Sparse Subspace Clustering with the l0 Inequality...

引用

7th Asian Conference on Pattern Recognition, ACPR 2023

作者： Wang, Yangbo Zhou, Jie Lin, Qingshui Lu, Jianglin Gao, Can National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Basic Teaching Department Liaoning Technical University Huludao125105 China College of Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9783031476648

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using all points to represent a fixed sample in a class under the self-expression framework may not be ideal, as points from other classes participate in the representing process. To alleviate this issue, this study attempts to achieve representation learning between points only coming from the same class. In practice, it is easier for data points from the same class to represent each other than that from different classes. So, when reconstructing a point, if the number of non-zero elements in the coefficient vector is limited, a model is more likely to select data points from the class where the reconstructed point lies to complete the reconstruction work. Based on this idea, we propose Sparse Subspace Clustering with the l0 inequality constraint (SSC- l0 ). In SSC- l0, the l0 inequality constraint determines the maximum number of non-zero elements in the coefficient vector, which helps SSC- l0 to conduct representation learning among the points in the same class. After introducing the simplex constraint to ensure the translation invariance of the model, an optimization method concerning l0 inequality constraint is formed to solve the proposed SSC- l0, and its convergence is theoretically analyzed. Extensive experiments on well-known datasets demonstrate the superiority of SSC- l0 compared to several state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction and Reconstruction of Multivariate Time Series 19

PRAD: Unsupervised KPI Anomaly Detection by Joint Prediction...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Xiong, Zhiying Fan, Qilin Wang, Kai Li, Xiuhua Zhang, Xu Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing China Chongqing University Chongqing Key Laboratory of Digital Cinema Art Theory and Technology Chongqing China Harbin Institute of Technology School of Computer Science and Technology Weihai China Harbin Institute of Technology Research Institute of Cyberspace Security Weihai China Haihe Laboratory of Information Technology Application Innovation Tianjin China University of Exeter Department of Computer Science Exeter United Kingdom

ISBN: (纸本)9798350346558

Detecting anomalies for key performance indicator (KPI) data is of paramount importance to ensure the quality and reliability of network services. However, building the anomaly detection system for KPI is challenging due to the scarcity of abnormal labels and highly dynamic or even unseen patterns. In this paper, we propose an unsupervised KPI anomaly detection framework named PRAD by jointly optimizing prediction-based and reconstruction-based modules. Specifically, PRAD employs two parallel graph attention networks (GATs) to learn metric-oriented and time-oriented relationships. A temporal convolutional attention network (TCAN) is used to capture complex long-term dependencies. Furthermore, to tackle the overfitting issue in the variational auto-encoder (VAE), PRAD designs a reconstruction-based module that combines VAE with a generative adversarial network (GAN). The experimental results on the two public datasets demonstrate that the proposed PRAD outperforms existing anomaly detection methods. © 2022 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Local Entropy Based Fuzzy Connectedness Segmentation for Thyroid Ultrasound Images

Local Entropy Based Fuzzy Connectedness Segmentation for Thy...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yixuan Fu Kai Li Junying Chen Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education School of Software Engineering South China University of Technology Guangzhou China Department of Ultrasound Third Affiliated Hospital of Sun Yat-sen University Guangzhou China

Although deep learning methods are popular in recent years to achieve dominant image segmentation performance, the carefully annotated training images are very difficult to obtain in clinical medicine, and the deep learning model training demands a lot of computing resources which are not always available. To overcome these difficulties, it is very necessary to investigate segmentation algorithms which do not require any training data. In this work, we improve a semi-automatic conventional segmentation algorithm, fuzzy connectedness segmentation, by introducing the local information entropy of the ultrasound image into the fuzzy affinity membership function. The proposed semi-automatic local entropy based fuzzy connectedness (LEFC) segmentation algorithm is further modified by incorporating the popular deep learning methods to make the LEFC algorithm fully automatic. The proposed semi-automatic LEFC algorithm achieves better performance than other representative fuzzy connectedness segmentation algorithms with the accuracy and IoU values increased by 5.9~14% and 5~10.5%, and achieves very close segmentation performance as compared with the best deep learning model in the experiments (0.2% lower accuracy and 0.2% lower IoU compared to CE-Net). Besides, the automatic LEFC algorithm improves the segmentation results obtained by the corresponding deep learning based coarse segmentation modules with the accuracy and IoU increased by 0.2~8% and 0.1~3.8%, respectively. Furthermore, the experiment results demonstrate that the proposed automatic LEFC algorithm obtains stably good segmentation performance even with limited training data, achieving the accuracy and IoU values (at the stable state) 23.6 % and 18.5% higher than those of the corresponding U-Net model which is trained with the samesized dataset.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Deep Active Contour Model Based on Local Image Characteristics

Automatic Deep Active Contour Model Based on Local Image Cha...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Haijun You Kai Li Junying Chen Key Laboratory of Big Data and Intelligent Robot (SCUT) Ministry of Education School of Software Engineering South China University of Technology Guangzhou China Department of Ultrasound Third Affiliated Hospital of Sun Yat-sen University Guangzhou China

In recent years, convolutional neural networks have made remarkable achievements in medical image segmentation. Unclear margins and fuzzy boundary regions are formed surrounding the thyroid gland area under the influence of artifacts and speckles, which increases the difficulty of thyroid ultrasound image segmentation. However, building an effective CNN model usually requires massive computing resources, long training time, and large amounts of carefully labeled data. In this work, we develop a fast, compact, accurate and robust image segmentation model for automatic thyroid segmentation in medical ultrasound images. We propose an automatic deep active contour (DAC) model based on local image characteristics, which utilizes the deep neural network model to obtain the initial contour and constructs external energy items based on the local image characteristics of contour points. Compared with the deep neural network model, the DAC model requires less training data, and the segmentation performance of the DAC model on a small dataset can reach that of the deep neural network model on a larger dataset. The proposed DAC model can be used for automatic thyroid segmentation in medical ultrasound images, which does not require massive computing resources, long training time, and large amounts of carefully labeled data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence-based Service Chains Scheduling for Medical Emergency in Healthcare 7

Artificial Intelligence-based Service Chains Scheduling for ...

引用

7th International Conference on Contemporary Computing and Informatics, IC3I 2024

作者： Soni, Mukesh Rusho, Maher Ali Byeon, Haewon Alghamdi, Azzah Hannan, Shaikh Abdul Dave, Parth Rameshchandra Dr. D. Y. Patil School of Science & Technology Tathawade Dr. D. Y. Patil Vidyapeeth Marashtra Pune India University of Colorado Department of Lockheed Martin Engineering Management BoulderCO80309 United States Inje University Department of Ai and Software & Medical Big Data Research Centre Gimhae50834 Korea Republic of Imam Abdalrhman Bin Faisal University College of Computer Science and Information Technology Computer Information Systems Department Khobar Saudi Arabia AlBaha University Faculty of Computing and Information AlBaha Saudi Arabia L. D. College of Engineering Department of Computer Engineering Gujarat Ahmedabad India

ISBN: (纸本)9798350350067

This study analyses the weekly scheduling challenge of health and medical information network service function chains to meet medical emergency categorization and grading needs. Emergency services are divided into four sorts by urgency and service area, with priorities and weights. The health and medical information network architecture, service model, and operation method are built accordingly. To reduce weighted completion time, a service function chain scheduling model is created. The function chain scheduling scheme is solved by matching game and Q -learning reinforcement learning algorithms for different issue scales. Finally, simulation studies demonstrate that this approach can accomplish graded medical emergency service, build health and medical information networks, and progress smart healthcare. © 2024 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Di-Net: Decomposed Implicit Garment Transfer Network for Digital Clothed 3d Human

SSRN

引用

SSRN 2024年

作者： Zhong, Xiaojing Su, Yukun Wu, Zhonghua Lin, Guosheng Wu, Qingyao School of Software Engineering South China University of Technology China School of Computer Science and Engineering Nanyang Technological University Singapore Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Peng Cheng Laboratory China Tencent Wechat Department China SenseTime Research

3D virtual try-on tasks aim to generate realistic try-on results for full- body garments, allowing them to be observed from arbitrary perspectives. Recent methods often represent the 3D human form with a fixed topol- ogy, limiting garment representation and leading to higher computational demands. Furthermore, the challenge of flexible transfer over various body parts remains. To address these problems, we introduce DI-Net(Decomposed Implicit Garment Transfer Network), where garment transfer is decomposed into 2D image layout transfer and 3D texture layout transfer. We propose a complementary warping module that leverages dense correspondence learn- ing and sparse flow learning to align the body appearance and garments with the target pose for image layout transfer. Subsequently, the transferred garments are lifted to the 3D human mesh by constructing a pixel-aligned implicit function and predicting the texture based on geometric priors. By applying different semantic masks for garment transfer, we efficiently control the texture of the generated mesh. Experimental results show the effective- ness and superiority of our method in the 3D virtual try-on task. © 2024, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

LECF: recommendation via learnable edge collaborative filtering

引用

Science China(Information Sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

来源：评论

学校读者我要写书评

暂无评论

Tensor Nuclear Norm Based Matrix Regression Based Projections for Feature Extraction of Hyperspectral Images

Tensor Nuclear Norm Based Matrix Regression Based Projection...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hong Qiu Heng Jin Renfang Wang Xiufeng Liu Guang Gao College of Big Data and Software Engineering Zhejiang Wanli University Ningbo China College of Information Shanghai Ocean University Shanghai China Department of Technology Management and Economics Technical University of Denmark Denmark Popsmart Technology(Zhejiang) Co. Ltd. Ningbo China

With high spectral resolution, hyperspectral image(HSI) data will result in the Hughes phenomenon, which brings a huge challenge to hyperspectral image classification(HIC). Feature extraction can be applied to address this problem. But several traditional methods often ignore the spatial structure information of HSI data. In this paper, we propose a tensor nuclear norm based matrix regression based projections(TNMRP) for feature extraction of hyperspectral images. Firstly, TNMRP preprocesses the data by a filling method. Then, it automatically builds the graph of block-tensor samples and uses the optimal sparse coding coefficients to obtain the weight matrix. Finally, based on tensor representation, TNMRP calculates the optimal projection matrix. Experiments of classification on Indian Pines and Pavia University databases demonstrate the effectiveness of our proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：