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

arXiv 2024年

作者： Qian, Xinyuan Gao, Jiaran Zhang, Yaodan Zhang, Qiquan Liu, Hexin Garcia, Leibny Paola Li, Haizhou The School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China The School of Electrical Engineering and Telecommunications The University of New South Wales Sydney2052 Australia The College of Computing and Data Science Nanyang Technological University Singapore The Center for Language and Speech Processing Johns Hopkins University United States The Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big data Shenzhen51872 China

Speech enhancement plays an essential role in various applications, and the integration of visual information has been demonstrated to bring substantial advantages. However, the majority of current research concentrates on the examination of facial and lip movements, which can be compromised or entirely inaccessible in scenarios where occlusions occur or when the camera view is distant. Whereas contextual visual cues from the surrounding environment have been overlooked: for example, when we see a dog bark, our brain has the innate ability to discern and filter out the barking noise. To this end, in this paper, we introduce a novel task, i.e. Scene-aware AudioVisual Speech Enhancement (SAV-SE). To our best knowledge, this is the first proposal to use rich contextual information from synchronized video as auxiliary cues to indicate the type of noise, which eventually improves the speech enhancement performance. Specifically, we propose the VC-S2E method, which incorporates the Conformer and Mamba modules for their complementary strengths. Extensive experiments are conducted on public MUSIC, AVSpeech and AudioSet datasets, where the results demonstrate the superiority of VC-S2E over other competitive methods. We will make the source code publicly available. Project demo page: https://***/ © 2024, CC BY.

关键词： Speech enhancement

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

CLDG: Contrastive Learning on Dynamic Graphs

引用

International Conference on data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Propagating Heterophilous Graph Convolutional Network

SSRN

引用

SSRN 2024年

作者： Huang, Yang Pi, Yueyang Shi, Yiqing Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China College of Photonic and Electronic Engineering Fujian Normal University Fuzhou350007 China

Graph convolutional network have significant advantages in tasks dealing with graph-structured data, but most existing approaches based on graph convolutional network usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real graph-structured data. Due to the propagation mechanism of graph convolutional network, it is usually difficult to avoid the aggregation of interference information of nodes from different classes, leading to the inclusion of noise and irrelevant information in the results, thus affecting the performance of the model. We propose a new framework to address this issue, which can extend graph convolutional network to heterophilous graph-structured data. The proposed method has two main parts: Firstly, from the perspective of feature space, the heterophily of the graph-structured data is modeled so that the model can adaptively change the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information on the model. Secondly, the implicit node interaction information is captured through the feature space, which is then fused with the original interaction information to aggregate sufficient intra-class information. Extensive experiments on real-world datasets demonstrate the competitiveness of our approach among current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Learning a Typhoon Bayesian Network Structure from Natural Language Reports 5th

Learning a Typhoon Bayesian Network Structure from Natural...

引用

5th IFIP TC 12 International Conference on Intelligence Science, ICIS 2022

作者： Yao, Zhangrui Chen, Junhan Pan, Yinghui Zeng, Yifeng Ma, Biyang Ming, Zhong Department of Automation and Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision-Making Xiamen University Xiamen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle upon Tyne United Kingdom School of Computer Science and Engineering Minnan Normal University Zhangzhou China

ISBN: (纸本)9783031149023

Given the huge toll caused by natural disasters, it is critically important to develop an effective disaster management and emergency response technique. In this article, we investigate relationships between typhoon-related variables and emergency response from natural language (NL) reports. A major challenge is to exploit typhoon state information for typhoon contingency plan generation, especially from unstructured text data based on NL input. To tackle this issue, we propose a novel framework for learning typhoon Bayesian network structures (FLTB), which can extract typhoon state information from unstructured NL, mine inter-information causal relationships and then generate Bayesian networks. We first extract information about typhoon states through NL processing (NLP) techniques, and then analyze typhoon reports by designing heuristic rules to identify causal relationships between states. We leverage these features to improve the learned structures and provide user-interaction mechanisms to finalize Bayesian networks. We evaluate the performance of our framework on real-world typhoon datasets and develop the Bayesian networks based typhoon emergency response systems. © 2022, IFIP International Federation for Information Processing.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

MEGCF: Multimodal Entity Graph Collaborative Filtering for Personalized Recommendation

arXiv

引用

arXiv 2022年

作者： Liu, Kang Xue, Feng Guo, Dan Wu, Le Li, Shujie Hong, Richang Hefei University of Technology School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province 485 Danxia Road Anhui Province Hefei230601 China Hefei University of Technology School of Software Key Laboratory of Knowledge Engineering with Big Data Intelligent Interconnected Systems Laboratory of Anhui Province 485 Danxia Road Anhui Province Hefei230601 China

In most E-commerce platforms, whether the displayed items trigger the user's interest largely depends on their most eye-catching multimodal content. Consequently, increasing efforts focus on modeling multimodal user preference, and the pressing paradigm is to incorporate complete multimodal deep features of the items into the recommendation module. However, the existing studies ignore the mismatch problem between multimodal feature extraction (MFE) and user interest modeling (UIM). That is, MFE and UIM have different emphases. Specifically, MFE is migrated from and adapted to upstream tasks such as image classification. In addition, it is mainly a content-oriented and non-personalized process, while UIM, with its greater focus on understanding user interaction, is essentially a user-oriented and personalized process. Therefore, the direct incorporation of MFE into UIM for purely user-oriented tasks, tends to introduce a large number of preference-independent multimodal noise and contaminate the embedding representations in UIM. This paper aims at solving the mismatch problem between MFE and UIM, so as to generate high-quality embedding representations and better model multimodal user preferences. Towards this end, we develop a novel model, multimodal entity graph collaborative filtering, short for MEGCF. The UIM of the proposed model captures the semantic correlation between interactions and the features obtained from MFE, thus making a better match between MFE and UIM. More precisely, semantic-rich entities are first extracted from the multimodal data, since they are more relevant to user preferences than other multimodal information. These entities are then integrated into the user-item interaction graph. Afterwards, a symmetric linear Graph Convolution Network (GCN) module is constructed to perform message propagation over the graph, in order to capture both high-order semantic correlation and collaborative filtering signals. Finally, the sentiment information fr

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Empirical Comparisons of Deep Learning Networks on Liver Segmentation

引用

Computers, Materials & Continua 2020年第3期62卷 1233-1247页

作者： Yi Shen Victor S.Sheng Lei Wang Jie Duan Xuefeng Xi Dengyong Zhang Ziming Cui School of Electronic and Information Engineering Suzhou University of Science and TechnologySuzhouChina Department of Computer Science University of Central ArkansasConwayArkansasUSA Huan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangshaChina

Accurate segmentation of CT images of liver tumors is an important adjunct for the liver diagnosis and treatment of liver *** recent years,due to the great improvement of hard device,many deep learning based methods have been proposed for automatic liver *** them,there are the plain neural network headed by FCN and the residual neural network headed by Resnet,both of which have many *** have achieved certain achievements in medical image *** this paper,we firstly select five representative structures,i.e.,FCN,U-Net,Segnet,Resnet and Densenet,to investigate their performance on liver *** original Resnet and Densenet could not perform image segmentation directly,we make some adjustments for them to perform live *** experimental results show that Densenet performs the best on liver segmentation,followed by *** perform much better than Segnet,U-Net,and *** Segnet,U-Net,and FCN,U-Net performs the best,followed by *** performs the worst.

关键词： Liver segmentation deep learning FCN U-Net Segnet Resnet Densenet

来源：评论

学校读者我要写书评

暂无评论

A Power-System Economic Dispatching Based on Enhanced Group Search Optimizer 1

引用

18th International Conference on intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2022

作者： Pan, Jeng-Shyang Nguyen, Trong-The Nguyen, Trinh-Dong Nguyen, Vinh-Tiep Dao, Thi-Kien College of Computer Science and Engineering Shandong University of Science and Technology Qing-Dao266590 China Department of Information Management Chaoyang University of Technology Taichung41349 Taiwan University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China

ISBN: (数字)9789819901050

ISBN: (纸本)9789819901043

Economic dispatch (ED) is one of the critical tasks in a power system’s optimization issues, but its characteristics with non-convex, high-dimensional, non-linear, and non-differentiable, so that caused solutions are more challenging in reality. This paper suggests an enhanced group search optimizer (EGSO) for solving the ED model with the valve-point effect and the different fuels. The EGSO adopts the original group search optimizer (GSO) by changing polar to Cartesian coordinate’s conversion and adding cyclic translation operators to the search behavior of the finder and walker to avoid falling into local optimal and slow convergence of the GSO. In the experiment section, the testing power systems of the ED model are used to validate the EGSO performance. The experimental results reveal that EGSO outperformed the other algorithms regarding convergence speed, the time required to complete calculations, and impacts with lower fuel cost. Additionally, with excellent outcomes in optimization issues involving multiple local optimal values show the EGSO is practical, quick, and efficient in addressing the challenging ED model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Effectiveness Assessment Framework for Neoadjuvant Chemoradiotherapy of Locally Advanced Rectal Cancer Based on Multi-modal Intelligence

A Novel Effectiveness Assessment Framework for Neoadjuvant C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiao Tian Dong Sui Weifeng Liu Maozu Guo Gongning Luo Kuanquan Wang Beijing Key Laboratory for Intelligent Processing Methods of Architectural Big Data Beijing China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China Perceptual Computing Research Center Harbin Institute of Technology Harbin China

ISBN: (数字)9798350337488

ISBN: (纸本)9798350337495

Neoadjuvant chemoradiotherapy (nCRT) is the stan-dard treatment for locally advanced rectal cancer (LARC). With the development of artificial intelligence, an increasing number of studies have begun to explore its application in cancer treatment prediction. However, the prior methods exhibit considerable variability even with slight modifications to the input data, which could potentially undermine the reliability of the results. In this paper, we proposed RP-Net, a novel multi-modal fusion-based framework that combines feature information from magnetic resonance imaging (MRI) and whole slide images (WSI), establishing a relationship to map the therapeutic effectiveness of nCRT for LARC. We investigated the relationship of the tumour region and its periphery tissues, and demonstrated the validity of the proposed framework that involving 11 different combinations of modalities. The experimental results revealed that it has achieved higher prediction accuracy compared to the four intra-categories single-modal combinations and outperformed the two intra-categories multi-modal combinations. When compared to the other four inter-categories multi-modal combinations, the fusion features get accuracy of 2 % ~ 6% improvement respectively.

关键词： Protocols Magnetic resonance imaging Decision making Cancer treatment Reliability Bioinformatics Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Short-term household load forecasting model based on variational mode decomposition and gated recurrent unit with attention mechanism

Journal of Network Intelligence

引用

Journal of Network Intelligence 2021年第1期6卷 143-153页

作者： Lin, Fu Liu, Shi-Jian Chao, Han-Chieh Pan, Jeng-Shyang College of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China Department of Electrical Engineering National Dong Hwa University Hualien Taiwan Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China

The household load is an important part of the load. Accurate short-term household load forecasting is of great help to issues such as power price formulation, demand response, or power transmission. This paper proposed a forecasting model based on Variational Mode Decomposition (VMD) and Gated Recurrent Unit (GRU) combined with self-attention mechanism (SAM) and attention mechanism (AM) for short-term household load forecasting. First, we use VMD to decompose household electricity load data, extract sub-sequences with strong periodic information, and reorganize the original data sets with sub-sequences and data pre-processed. The new data sets contain more abundant information. Secondly, GRU combined with SAM and AM forecasting model for learning and training to obtain results. Finally, RMSE and MAPE evaluation functions are used for method evaluation to verify the superiority of the proposed scheme. The RMSE and MAPE of the proposed method are 0.193 kW and 15.567%, respectively, which are more favorable than traditional GRU. © 2021, Taiwan Ubiquitous Information. All rights reserved.

关键词： Variational mode decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：