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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Min Hu Lingxiang Xu Lei Liu Xiaohua Wang Hongbo Li Jiaoyun Yang Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China National Smart Eldercare International Science and Technology Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Artificial intelligence methods offer objectivity and convenience in automatic depression detection, however, current research often neglects the critical role of facial landmarks. This oversight results in insufficient spatial structure information and a lack of detailed local representation, which fails to capture the nuanced semantic information crucial for identifying depression-related clues. To address these issues, we introduce a novel dual-branch network model comprising the Landmark-Image-Landmark Net (LIL Net) and the Global Context Vision Transformer Net (GCVit Net). Through a dual-stream, multiscale, and cross-fusion strategy, LIL Net is designed to extract original facial image features alongside landmark features, prioritizing the detailed semantic information of potential depression clues. LIL Net employs an innovative LIL Attention approach to jointly learn multiscale features from facial landmarks and images, thereby enhancing the model’s ability to capture fine-grained depression-related cues. Furthermore, the Multi-scale Feature Fusion (MSFF) module fuses the obtained multiscale features, augmenting the semantic expression of potential depression clues within facial landmarks via attention mechanisms. Meanwhile, the GCVit Net branch network supplements global information by extracting global facial features. Finally, the features from both branches are concatenated to enhance the accuracy of depression degree predictions. Experimental results demonstrate that our model has superior performance in detecting depression compared to existing methods. We release our code at https://***/xlx777/LIL-Net.

关键词： Accuracy Shape Fuses Semantics Depression Feature extraction Transformers Robustness Data mining Facial features

来源：评论

学校读者我要写书评

暂无评论

A Multiscale Dynamic Temporal Convolution Network For Continuous Dimensional Emotion Recognition

A Multiscale Dynamic Temporal Convolution Network For Contin...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Min Hu Jialu Sun Xiaohua Wang Ning An Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer Science and Information Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Video-based dimensional emotion recognition, especially long sequence modeling, is a challenging task. This paper proposes a Multiscale Dynamic Temporal Convolution Network(MDTCN) for long sequence modeling of dimensional emotion recognition. Although Temporal Convolution Network(TCN) has performed well in sequence modeling, there are still some limitations that the feature scale of each layer is single and the receptive field of the upper layer is too large to capture the short-term dependence. Therefore, Dynamic Dilated Block(DDB) is constructed to better capture the temporal dependence by using dilated convolutions of different kernel size. In order to obtain both long-term and short-term temporal features, Multiscale TCN Structure is proposed. Extensive experiments are conducted on the AFFWILD2 and SEWA Dataset and the competitive result is shown compared to state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compactness and Separateness Driven Fuzzy Clustering Validity Index Called TLW 18th

Compactness and Separateness Driven Fuzzy Clustering Validit...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Tang, Yiming Wang, Xiang Li, Bing Hu, Xianghui Xie, Wenjun Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Anhui Hefei230601 China Engineering Research Center of Safety Critical Industry Measure and Control Technology Ministry of Education Hefei University of Technology Anhui Hefei230601 China

ISBN: (纸本)9789819996391

The design of validity index of fuzzy clustering has always been a historical problem in fuzzy clustering field. When the distribution of cluster centers is very close, it is difficult for the existing fuzzy clustering validity indexes to obtain a reasonable cluster number, and the separation mechanism of these indexes is too simple. In order to solve the above problems, we propose a novel fuzzy clustering validity index called TLW (Tang-Li-Wang) index. Firstly, compactness is expressed as the ratio of the membership weighted distance value to the sample variance of the dataset. Secondly, the sum of the maximum distance between cluster centers and the mean distance is used in separateness, and the sample variance of cluster centers is introduced, and the two are multiplied to describe the separateness. Thirdly, on the basis of considering compactness and separateness, the introduction of cluster number can alleviate the phenomenon that the index value may change monotonically with the increase of cluster number. Finally, the classical FCM (Fuzzy C-Mean) algorithm is used to conduct experiments on indexes. Comparative experiments and analyses were carried out on 17 typical datasets and 12 clustering validity indexes. From the experimental results of normal simple datasets and high-dimensional difficult datasets, the proposed index shows some advantages. All in all, these results verify that the proposed TLW index has better accuracy and stronger stability. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Answer-Centric Local and Global Information Fusion for Conversational Question Generation 12

Answer-Centric Local and Global Information Fusion for Conve...

引用

12th IEEE International Conference on Big Knowledge, ICBK 2021

作者： Lei, Panpan Sun, Xiao Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer Science and Information Engineering Anhui Hefei China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei China

ISBN: (纸本)9781665438582

Conversational Question Generation (CQG) is a new concern in Question Generation (QG) study. Recently Seq2Seq neural network model has been widely used in the QG area. CQG model is also based on the Seq2Seq neural network model. We note a problem: the CQG model's input is not a single sentence, but a long text and conversation history. Seq2Seq model can't effectively process long input, the model will generate questions not related to the answer. To solve this problem, we propose an answer-centric local and global information fusion model. We extract the evidence sentence containing the answer in the passage and encode the evidence sentence and the passage information separately. On the one hand, we add answer-centered position tags in the passage to reinforce the attention of information related to the answer. On the other hand, we put the key sentence into the question type prediction model. By combining the answer position embedding to predict the question type, and then put the predicted question types in the key sentence to guide the generation of the question. Finally, we use a gate mechanism to merge key sentence information and passage information. The experimental results show that we have achieved better results. © 2021 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Automatic Life Event Tree Generation for Older Adults 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An Automatic Method for Brain Tumors Segmentation Based on Deep Convolutional Neural Network

An Automatic Method for Brain Tumors Segmentation Based on D...

引用

2021 IEEE International Conference on Medical Imaging Physics and Engineering, ICMIPE 2021

作者： Lin, Hui Zhang, Benjian Guo, Xin Guo, Dong Jing, Jia Huiyuan, Luo Yumeng, Zhao Hu, Min Ren, Fuji School of Physics Hefei University of Technology Hefei China School of Computer and Information Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei China School of Computer and Information Hefei University of Technology Hefei China Graduate School of Advanced Technology and Science University of Tokushima Tokushima Japan

ISBN: (纸本)9781665426084

[Purpose] Accurate outline of tumor targets is critical to a high quality radiotherapy plan. Manual segmentation is of great workload and has a strong artificial subjectivity. Using deep learning method to assist automatically segmenting of tumor target is the penetration and application of artificial intelligence in medicine. [Methods] A 6-layer model of deep Convolution Neural Network (CNN) has been constructed by taking advantage of different types of layers for brain tumor segmentation. This model is a 6 layer CNN model (6-CNN) composed of three convolution layers, two pool layers and one full connection layer. To obtain enough samples for 6-CNN model training, a patch-based technology has been adopted. That is to successively extract a local area from the whole image as a patch. And the center pixel value is taken as the pixel value of the whole patch. Similarly, the label of the center pixel is also taken as the label of the whole patch. Thus the 6-CNN model transforms the brain tumor image segmentation into patch classification based on the excellent classification characteristics of deep convolution neural network. The model combines the local features of patch, the information extracted from shallow network and the global features to predict the category label of the central pixel of patch. [Results] The model is validated on BRATS 2015 dataset and results show that the segmentation accuracy can be up to Dice Similarity Coefficient (DSC) 90\%\pm 4\%. [Conclusions] An automatic deep CNN segmentation model for brain tumors has been constructed based on MRI image patches, which is expected to assist or even substitute the manual segmentation of brain tumors. © 2021 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Remolding Semantic Focus with Dual Attention Mechanism for Aspect-based Sentiment Analysis

Remolding Semantic Focus with Dual Attention Mechanism for A...

引用

IEEE International Conference on Cloud computing and Intelligence Systems (CCIS)

作者： Xingda Li Yanwei Bao Min Hu Fuji Ren Hefei University of Technology Hefei Anhwi China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology China University of Electronic Science and Technology of China Chengdu Chengdu China

ISBN: (纸本)9781665456579

Aspect-based sentiment analysis (ABSA) is an NLP task that classify fine-grained sentiment towards one specific aspect from the same text. While attention mechanism has achieved great success, attaching aspects to abstract sentiment remains challenging. In this paper, we propose dual attention mechanism, a novel method to re-weight the distribution of attention between stack BERT layers, in prompt learning way with pretrained language model BERT. Specifically, after obtaining the most attractive words, the method raises weight of other possible corresponding words and makes model consider more comprehensively. To introduce more aspect information, we classify the sentiment in improved prompt learning way. Note that the overfitting using BERT on ABSA, we utilize the approach of staged loss that restrict the training not too small. Finally, the experiment results demonstrate the effectiveness and the stability of dual attention and provide a good insight of attention mechanism.

关键词： Training Learning systems Sentiment analysis Cloud computing Computational modeling Bit error rate Semantics

来源：评论

学校读者我要写书评

暂无评论

Text-guided Reconstruction Network for Sentiment Analysis with Uncertain Missing Modalities

引用

IEEE Transactions on affective computing 2025年

作者： Shi, Piao Hu, Min Nakagawa, Satoshi Zheng, Xiangming Shi, Xuefeng Ren, Fuji Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine National Smart Eldercare International Science and Technology Cooperation Base School of Computer Science and Information Engineering Anhui Hefei230601 China Bozhou University School of Electronic and Information Engineering Bozhou236800 China University of Tokyo Graduate School of Information Science and Technology Tokyo113-8656 Japan University of Electronic Science and Technology of China College of Computer Science and Engineering Chengdu611731 China University of Electronic Science and Technology of China Shenzhen Institute for Advanced Study Shenzhen518110 China

Multimodal Sentiment Analysis (MSA) is an attractive research that aims to integrate sentiment expressed in textual, visual, and acoustic signals. There are two main problems in the existing methods: 1) the dominant role of the text is underutilization in unaligned multimodal data, and 2) the modality under uncertain missing feature is not sufficiently explored. This paper proposes a Text-guided Reconstruction Network (TgRN) for MSA with uncertain missing modalities in non-aligned sequences. The TgRN network includes three primary modules: Text-guided Extraction Module (TEM), Reconstruction Module (RM) and Text-guided Fusion Module (TFM). First, the TEM consists of the text-guided cross attention units and self-attention units to capture inter-modal features and intra-modal features, respectively. Second, leveraging enhanced attention units and a three-way squeeze-and-excitation block, the RM is designed to learn semantic information from incomplete data and reconstruct missing modality features. Third, the TFM utilizes a progressive modality-mixing adaptation gate to explore the dynamic correlations between nonverbal and verbal modalities, effectively addressing the modality gap issue. Finally, under the supervision of sentiment prediction loss and reconstruction loss, the TgRN effectively processes both uncertain missing-modality conditions and ideal complete modality conditions. Extensive experiments on CMU-MOSI and CH-SIMS demonstrate that our proposed method outperforms state-of-the-art approaches. © 2010-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

引用

IEEE Transactions on Neural Networks and Learning Systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：