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

Fast Latent Factor Analysis via a Fuzzy PID-Incorporated Stochastic Gradient Descent Algorithm

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Jinli Yuan, Ye School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China College of Computer and Information Science Southwest University Chongqing400715 China

A high-dimensional and incomplete (HDI) matrix can describe the complex interactions among numerous nodes in various big data-related applications. A stochastic gradient descent (SGD)-based latent factor analysis (LFA) model is remarkably effective in extracting valuable information from an HDI matrix. However, such a model commonly encounters the problem of slow convergence because a standard SGD algorithm learns a latent factor relying on the stochastic gradient of current instance error only without considering past update information. To address this critical issue, this paper innovatively proposes a Fuzzy PID-incorporated SGD (FPS) algorithm with two-fold ideas: 1) rebuilding the instance learning error by considering the past update information in an efficient way following the principle of PID, and 2) implementing hyper-parameters and gain parameters adaptation following the fuzzy rules. With it, an FPS-incorporated LFA model is further achieved for fast processing an HDI matrix. Empirical studies on six HDI datasets demonstrate that the proposed FPS-incorporated LFA model significantly outperforms the state-of-the-art LFA models in terms of computational efficiency for predicting the missing data of an HDI matrix with competitive accuracy. Copyright © 2023, The Authors. All rights reserved.

关键词： Matrix algebra

An ADRC-Incorporated Stochastic Gradient Descent Algorithm for Latent Factor Analysis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Jinli Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

High-dimensional and incomplete (HDI) matrix contains many complex interactions between numerous nodes. A stochastic gradient descent (SGD)-based latent factor analysis (LFA) model is remarkably effective in extracting valuable information from an HDI matrix. However, such a model commonly encounters the problem of slow convergence because a standard SGD algorithm only considers the current learning error to compute the stochastic gradient without considering the historical and future state of the learning error. To address this critical issue, this paper innovatively proposes an ADRC-incorporated SGD (ADS) algorithm by refining the instance learning error by considering the historical and future state by following the principle of an ADRC controller. With it, an ADS-based LFA model is further achieved for fast and accurate latent factor analysis on an HDI matrix. Empirical studies on two HDI datasets demonstrate that the proposed model outperforms the state-of-the-art LFA models in terms of computational efficiency and accuracy for predicting the missing data of an HDI matrix. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Ying Yuan, Ye Luo, Xin The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module;b) Building the residual connection and weighted representation propagation to obtain high representation capacity;and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

Modeling Temporal Dependencies within the Target for Long-Term Time Series Forecasting

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xiong, Qi Tang, Kai Ma, Minbo Zhang, Ji Xu, Jie Li, Tianrui School of Computing and Artificial Intelligence Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education National Engineering Laboratory of Integrated Transportation Big Data Application Technology Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China School of Computing The University of Leeds LeedsLS2 9JT United Kingdom

Long-term time series forecasting (LTSF) is a critical task across diverse domains. Despite significant advancements in LTSF research, we identify a performance bottleneck in existing LTSF methods caused by the inadequate modeling of Temporal Dependencies within the Target (TDT). To address this issue, we propose a novel and generic temporal modeling framework, Temporal Dependency Alignment (TDAlign), that equips existing LTSF methods with TDT learning capabilities. TDAlign introduces two key innovations: 1) a loss function that aligns the change values between adjacent time steps in the predictions with those in the target, ensuring consistency with variation patterns, and 2) an adaptive loss balancing strategy that seamlessly integrates the new loss function with existing LTSF methods without introducing additional learnable parameters. As a plug-and-play framework, TDAlign enhances existing methods with minimal computational overhead, featuring only linear time complexity and constant space complexity relative to the prediction length. Extensive experiments on six strong LTSF baselines across seven real-world datasets demonstrate the effectiveness and flexibility of TDAlign. On average, TDAlign reduces baseline prediction errors by 1.47% to 9.19% and change value errors by 4.57% to 15.78%, highlighting its substantial performance improvements. Copyright © 2024, The Authors. All rights reserved.

关键词： Time series analysis

A Predictive-Trend-Aware and Critical-Path-Estimation-Based Method for Workflow Scheduling Upon Cloud Services

学校读者我要写书评

暂无评论

A Predictive-Trend-Aware and Critical-Path-Estimation-Based ...

IEEE International Conference on Services computing (SCC)

作者： Yi Pan Xiaoning Sun Yunni Xia Wanbo Zheng Xin Luo College of Computer Science Chongqing University Chongqing China Data Science Research Center Faculty of Science Kunming University of Science and Technology Kunming China Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China Hengrui (Chongqing) Artificial Intelligence Research Center Cloudwalk China

ISBN: (数字)9781728187891

ISBN: (纸本)9781728187907

The cloud computing paradigm is featured by its ability to offer elastic computational resource provisioning patterns and deliver on-demand and versatile services. It's thus getting increasingly popular to build business process and workflow-based applications upon cloud computing platforms. However, it remains a difficulty to guarantee cost-effectiveness and quality of service of cloud-based workflows because real-world cloud services are usually subject to real-time performance variations or fluctuations. Existing researches mainly consider that cloud are with constant performance and formulate the scheduling decision-making as a static optimization problem. In this work, instead, we consider that scientific computing processes to be supported by decentralized cloud infrastructures are with fluctuating QoS and aim at managing the monetary cost of workflows with the completion-time constraint to be satisfied. We address the performance-trend-aware workflow scheduling problem by leveraging a time-series-based prediction model and a Critical-Path-Duration-Estimation-based (CPDE for short) scheduling strategy. The proposed method is capable of exploiting real-time trends of performance changes of cloud infrastructures and generating dynamic workflow scheduling plans. To prove the effectiveness of our proposed method, we build a large-prime-number-generation workflow supported by real-world third-party commercial clouds and show that our method clearly beats existing approaches in terms of cost, workflow completion time, and Service-Level-Agreement (SLA) violation rate.

关键词： Cloud computing Processor scheduling Computational modeling Quality of service Predictive models Dynamic scheduling Real-time systems

Context-specific miRNA regulation network predicts cancer prognosis

学校读者我要写书评

暂无评论

Context-specific miRNA regulation network predicts cancer pr...

IEEE International Conference on Systems Biology

作者： Xionghui Zhou Juan Liu Changning Liu Simon Rayner Fengji Liang Jingfang Ju Yinghui Li Shanguang Chen Jianghui Xiong School of Computer Science Wuhan University Wuhan China Bioinformatics Research Group Key Laboratory of Intelligent Information Processing Advanced Computing Research Laboratory Institute of Computing Technology Chinese Academy of Sciences (CAS) Beijing China Bioinformatics Group State Key Laboratory of Virology Wuhan Institute of Virology Chinese Academy of Sciences (CAS) Wuhan China Bioinformatics Group and Data Coordination Center State Key Laboratory of Space Medicine Fundamentals and Application China Astronaut Research and Training Center Beijing China Department of Pathology Stony Brook University Medical Center New York USA

MicroRNAs can regulate hundreds of target genes and play a pivotal role in a broad range of biological process. However, relatively little is known about how these highly connected miRNAs-target networks are remodelled in the context of various diseases. Here we examine the dynamic alteration of context-specific miRNA regulation to determine whether modified microRNAs regulation on specific biological processes is a useful information source for predicting cancer prognosis. A new concept, Context-specific miRNA activity (CoMi activity) is introduced to describe the statistical difference between the expression level of a miRNA's target genes and non-targets genes within a given gene set (context).

关键词： Breast cancer Context Correlation Biological processes Metastasis Tumors

USEV: Universal Speaker Extraction with Visual Cue

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Pan, Zexu Ge, Meng Li, Haizhou The Integrative Sciences and Engineering Programme The Institute of Data Science The Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore The Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore The Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin300072 China The School of Data Science The Chinese University of Hong Kong Shenzhen518172 China The University of Bremen 28359 Germany Kriston AI Xiamen China

A speaker extraction algorithm seeks to extract the target speaker's speech from a multi-talker speech mixture. The prior studies focus mostly on speaker extraction from a highly overlapped multi-talker speech mixture. However, the target-interference speaker overlapping ratios could vary over a wide range from 0% to 100% in natural speech communication, furthermore, the target speaker could be absent in the speech mixture, the speech mixtures in such universal multi-talker scenarios are described as general speech mixtures. The speaker extraction algorithm requires an auxiliary reference, such as a video recording or a pre-recorded speech, to form top-down auditory attention on the target speaker. We advocate that a visual cue, i.e., lip movement, is more informative than an audio cue, i.e., pre-recorded speech, to serve as the auxiliary reference for speaker extraction in disentangling the target speaker from a general speech mixture. In this paper, we propose a universal speaker extraction network with a visual cue, that works for all multi-talker scenarios. In addition, we propose a scenario-aware differentiated loss function for network training, to balance the network performance over different target-interference speaker pairing scenarios. The experimental results show that our proposed method outperforms various competitive baselines for general speech mixtures in terms of signal fidelity. Copyright © 2021, The Authors. All rights reserved.

关键词： Mixtures

Sparse Attention-driven Quality Prediction for Production Process Optimization in Digital Twins

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yin, Yanlei Wang, Lihua Hoang, Dinh Thai Wang, Wenbo Niyato, Dusit The School of Mechanical and Electrical Engineering Kunming University of Science and Technology Kunming650500 China Australia The School of Mechanical and Electrical Engineering Yunnan Key Laboratory of Intelligent Control and Application Kunming University of Science and Technology Kunming650500 China The College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

In the process industry, long-term and efficient optimization of production lines requires real-time monitoring and analysis of operational states to fine-tune production line parameters. However, complexity in operational logic and intricate coupling of production process parameters make it difficult to develop an accurate mathematical model for the entire process, thus hindering the deployment of efficient optimization mechanisms. In view of these difficulties, we propose to deploy a digital twin of the production line by encoding its operational logic in a data-driven approach. By iteratively mapping the real-world data reflecting equipment operation status and product quality indicators in the digital twin, we adopt a quality prediction model for production process based on self-attention-enabled temporal convolutional neural networks. This model enables the data-driven state evolution of the digital twin. The digital twin takes a role of aggregating the information of actual operating conditions and the results of quality-sensitive analysis, which facilitates the optimization of process production with virtual-reality evolution. Leveraging the digital twin as an information-flow carrier, we extract temporal features from key process indicators and establish a production process quality prediction model based on the proposed deep neural network. Our operation experiments on a specific tobacco shredding line demonstrate that the proposed digital twin-based production process optimization method fosters seamless integration between virtual and real production lines. This integration achieves an average operating status prediction accuracy of over 98% and a product quality acceptance rate of over 96%. Copyright © 2024, The Authors. All rights reserved.

关键词： Convolutional neural networks

Multi-Modal Transformer for Accelerated MR Imaging

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Feng, Chun-Mei Yan, Yunlu Chen, Geng Xu, Yong Hu, Ying Shao, Ling Fu, Huazhu Shenzhen Key Laboratory of Visual Object Detection and Recognition Harbin Institute of Technology Shenzhen518055 China National Engineering Laboratory for Integrated AeroSpace-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Terminus Group China Institute of High Performance Computing A*STAR Singapore138632 Singapore

Accelerated multi-modal magnetic resonance (MR) imaging is a new and effective solution for fast MR imaging, providing superior performance in restoring the target modality from its undersampled counterpart with guidance from an auxiliary modality. However, existing works simply combine the auxiliary modality as prior information, lacking in-depth investigations on the potential mechanisms for fusing different modalities. Further, they usually rely on the convolutional neural networks (CNNs), which is limited by the intrinsic locality in capturing the long-distance dependency. To this end, we propose a multi-modal transformer (MTrans), which is capable of transferring multi-scale features from the target modality to the auxiliary modality, for accelerated MR imaging. To capture deep multi-modal information, our MTrans utilizes an improved multi-head attention mechanism, named cross attention module, which absorbs features from the auxiliary modality that contribute to the target modality. Our framework provides three appealing benefits: (i) Our MTrans use an improved transformers for multi-modal MR imaging, affording more global information compared with existing CNN-based methods. (ii) A new cross attention module is proposed to exploit the useful information in each modality at different scales. The small patch in the target modality aims to keep more fine details, the large patch in the auxiliary modality aims to obtain high-level context features from the larger region and supplement the target modality effectively. (iii) We evaluate MTrans with various accelerated multi-modal MR imaging tasks, e.g., MR image reconstruction and super-resolution, where MTrans outperforms state-of-the-art methods on fastMRI and real-world clinical datasets. © 2021, CC BY.

关键词： Magnetic resonance imaging