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

arXiv 2024年

作者： Chen, Geng Wang, Qingyue Rekik, Islem National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University China BASIRA Lab Imperial-X Department of Computing Imperial College London United Kingdom

A connectional brain template (CBT) is a holistic representation of a population of multi-view brain connectivity graphs, encoding shared patterns and normalizing typical variations across individuals. The federation of CBT learning allows for an inclusive estimation of representative center of multi-domain brain connectivity datasets in a fully data-preserving manner. However, existing methods overlook the non-independent and identically distributed (non-IDD) issue stemming from multidomain brain connectivity heterogeneity, in which data domains are drawn from different hospitals and imaging modalities. This non-IDD issue degrades the centrality of locally learned CBT from multiple decentralized datasets (i.e., domains/hospitals), eventually leading to a limited representation ability. To overcome this limitation, we unprecedentedly propose a metadata-driven federated learning framework, called MetaFedCBT, for cross-domain CBT learning. Given the data drawn from a specific domain (i.e., hospital), our model aims to learn a metadata in a fully supervised manner by introducing a local client-based regressor network. The generated meta-data is forced to meet the statistical attributes (e.g., mean) of other domains, while preserving their privacy. Our supervised meta-data generation approach boosts the unsupervised learning of a more centered and representative and holistic CBT of a particular brain state across diverse domains. As the federated learning progresses over multiple rounds, the learned metadata and associated generated connectivities are are continuously updated to better approximate the target domain information. MetaFedCBT overcomes the non-IID issue of existing methods by generating informative brain connectivities for privacy-preserving holistic CBT learning with the guidance using metadata. Extensive experiments on multi-view morphological brain networks of normal and patient subjects demonstrate that our MetaFedCBT is a superior federated CBT learnin

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Feature Selection With Multi-Scale Fuzzy Information Fusion: From Both Global and Local Perspectives

引用

IEEE Transactions on Fuzzy systems 2025年

作者： Zhou, Nan Liao, Shujiao Chen, Hongmei Ding, Weiping Lu, Yaqian Minnan Normal University School of Mathematics and Statistics Fujian Key Laboratory of Granular Computing and Applications Zhangzhou363000 China Southwest Jiaotong University School of Computing and Artificial Intelligence National Engineering Laboratory of Integrated Transportation Big Data Application Technology Chengdu611756 China Nantong University School of Artificial Intelligence and Computer Science Nantong226019 China City University of Macau Faculty of Data Science 999078 China

In reality, the laborious nature of label annotation leads to the widespread existence of limited labeled data. Moreover, multi-scale data have received widespread attention due to its rich knowledge representation. However, current research on multi-scale data primarily focuses on supervised learning environments, while semi-supervised feature selection for multi-scale data with limited labels remains inadequately explored. Meanwhile, existing studies on multi-scale data often emphasize selecting optimal scales and further conducting feature selection, but this strategy may result in losing potentially valuable information from other scales. To overcome these limitations, by adopting a multi-scale fuzzy information fusion mechanism, this article proposes two new semi-supervised feature selection approaches for multi-scale data with limited labels from both global and local perspectives. Initially, by fusing fuzzy information at various scales, a label learning method is proposed to convert the decision of missing labels into a fuzzy decision of label distribution. Subsequently, label-distributed multi-scale fuzzy global and local rough sets are constructed from global and local perspectives, respectively. Based on the two models, two semi-supervised feature selection algorithms are developed based on global and local multi-scale fuzzy information fusion. Experimental results demonstrate that, compared to other advanced feature selection algorithms, the two proposed algorithms can effectively handle multi-scale data with limited labels and exhibit superior classification performance, computational efficiency and robustness. © 1993-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

STSE-xLSTM: A Deep Learning Framework for Automated Seizure Detection in Long Video Sequences Using Spatio-Temporal and Attention Mechanisms

STSE-xLSTM: A Deep Learning Framework for Automated Seizure ...

引用

International Conference on Computer and Communications (ICCC)

作者： Lihui Ding Hongliang Wang Lijun Fu Shenyang Institute of Computing Technology University of Chinese Academy of Sciences Shenyang China Liaoning Province Human-Computer Interaction System Engineering Research Center Based on Digital Twin Shenyang China Laboratory of Big Data and Artificial Intelligence Technology Shandong University Beijing China

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

A detailed analysis of seizure semiology, the symptoms and signs that occur during a seizure, is crucial for the management of epilepsy patients. The inter-rater reliability of qualitative visual analysis is often low, highlighting the need for automatic and quantitative analysis of video-recorded seizures for objective assessment. To enhance evaluation accuracy and consistency, computer-aided video analysis of seizures has emerged as a natural direction of development. In the field of medical applications, deep learning and computer vision methods have driven significant advancements. However, analyzing video data presents challenges due to high dimensionality, variations in lighting, posture, and video quality. Additionally, the duration of seizures can range from seconds to minutes. To effectively extract features from seizures, we propose a novel deep learning model, STSE-xLSTM, designed to learn deep representations of arbitrarily long seizure videos. This model integrates a Spatio-Temporal Convolutional Network (STCNN) for feature extraction, a Squeeze-and-Excitation (SE) attention mechanism to enhance relevant features, and an extended Long Short-Term Memory network (xLSTM) to process long video sequences. The SE mechanism adaptively recalibrates channel weights, improving recognition of minority classes and reducing information redundancy. The xLSTM introduces scalar and matrix memory units, optimizing memory capacity and multi-scale feature extraction, thereby enhancing detection accuracy. When evaluated on the GESTURES dataset, our model outperformed state-of-the-art epilepsy detection methods in classification performance. Key contributions include the integration of STCNN, SE attention mechanism, and xLSTM to address data imbalance issues and improve the handling of complex sequential data in epilepsy detection.

关键词： Deep learning Adaptation models Visualization Attention mechanisms Accuracy Video sequences Epilepsy Feature extraction Reliability Long short term memory

来源：评论

学校读者我要写书评

暂无评论

A nearly optimal distributed algorithm for computing the weighted girth

引用

Science China(Information Sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log2n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log3n）.

关键词： distributed algorithms weighted girth ${\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}$ model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

Automatic recognition of depression based on audio and video:A review

引用

World Journal of Psychiatry 2024年第2期14卷 225-233页

作者： Meng-Meng Han Xing-Yun Li Xin-Yu Yi Yun-Shao Zheng Wei-Li Xia Ya-Fei Liu Qing-Xiang Wang Shandong Mental Health Center Shandong UniversityJinan 250014Shandong ProvinceChina Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and TechnologyQilu University of Technology(Shandong Academy of Sciences)Jinan 250353Shandong ProvinceChina Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250353Shandong ProvinceChina Department of Ward Two Shandong Mental Health CenterShandong UniversityJinan 250014Shandong ProvinceChina

Depression is a common mental health *** current depression detection methods,specialized physicians often engage in conversations and physiological examinations based on standardized scales as auxiliary measures for depression ***-biological markers-typically classified as verbal or non-verbal and deemed crucial evaluation criteria for depression-have not been effectively *** physicians usually require extensive training and experience to capture changes in these *** in deep learning technology have provided technical support for capturing non-biological *** researchers have proposed automatic depression estimation(ADE)systems based on sounds and videos to assist physicians in capturing these features and conducting depression *** article summarizes commonly used public datasets and recent research on audio-and video-based ADE based on three perspectives:datasets,deficiencies in existing research,and future development directions.

关键词： Depression recognition Deep learning Automatic depression estimation system Audio processing Image processing Feature fusion Future development

来源：评论

学校读者我要写书评

暂无评论

Pointsurface: Discriminative Point Cloud Surface Feature Extraction for 3d Face Recognition

SSRN

引用

SSRN 2024年

作者： Yang, Junpeng Li, Qiufu Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Guangdong Shenzhen518172 China

3D face recognition performs better than 2D face recognition, in terms of robustness against lighting and digital attacks. Compared to 2D data, the rich geometric information in 3D data could be very useful to improve the performance of 3D face recognition. This paper introduces PointSurFace, a surface feature extraction integrated model tailored for point cloud based 3D face recognition. PointSurFace adopts a specially designed surface feature extraction module, which explores information about the position and normals of the 3D face surface to explicitly extract local discriminative features from 3D point cloud faces. Subsequently, it alternates between set abstraction (SA) layers and Inverted Residual MLP (InvResMLP) modules to effectively extract features from the point cloud data. To better handle the spatial relationships in the point cloud data, PointSurFace integrates coordinate and feature data within each SA layer and InvResMLP module. It also applies channel fusion operations to align these different types of data, thereby more effectively extracts point cloud features. Experimental results in 3D facial recognition and verification across multiple datasets demonstrate that PointSurFace achieves the best 3D face recognition performance to date. For example, on Lock3DFace, it achieves the state-of-the-art recognition and verification accuracy of 90.03% and 80.01%, respectively, surpassing previous methods by 2.02% and 3.19%. Results on cross-quality datasets also affirm PointSurFace’s strong generalization capabilities. Ablation experiments validate the effectiveness of each module within PointSurFace, which suggests that the proposed surface feature extraction module significantly enhances the point cloud based 3D facial recognition performance. © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Collaborative Ranking 15th

Context-Aware Collaborative Ranking

引用

15th Asia Information Retrieval Societies Conference, AIRS 2019

作者： Dai, Wei Pan, Weike Ming, Zhong National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9783030428341

Recommender systems (RS) are being used in a broad range of applications, from online shopping websites to music streaming platforms, which aim to provide users high-quality personalized services. Collaborative filtering (CF) is a promising technique to ensure the accuracy of a recommender system, which can be divided into specific tasks such as rating prediction and item ranking. However, there is a larger volume of published works studying the problem of rating prediction, rather than item ranking though it is recognized to be more appropriate for the final recommendation in a real application. On the other hand, many studies on item ranking devoted to leveraging implicit feedback are limited in performance improvements due to the uniformity of implicit feedback. Hence, in this paper, we focus on item ranking with informative explicit feedback, which is also called collaborative ranking. In particular, we propose a novel recommendation model termed context-aware collaborative ranking (CCR), which adopts a logistic loss function to measure the predicted error of ranking and exploits the inherent preference context derived from the explicit feedback. Moreover, we design an elegant strategy to distinguish between positive and negative samples used in the process of model training. Empirical studies on four real-world datasets clearly demonstrate that our CCR outperforms the state-of-the-art methods in terms of various ranking-oriented evaluation metrics. © Springer Nature Switzerland AG 2020.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Lin Gu Junhao Huang Shaoxing Huang Deze Zeng Bo Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science China University of Geosciences Wuhan China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

StyleGene: Crossover and Mutation of Region-level Facial Genes for Kinship Face Synthesis

StyleGene: Crossover and Mutation of Region-level Facial Gen...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Hao Li Xianxu Hou Zepeng Huang Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University

High-fidelity kinship face synthesis has many potential applications, such as kinship verification, missing child identification, and social media analysis. However, it is challenging to synthesize high-quality descendant faces with genetic relations due to the lack of large-scale, high-quality annotated kinship data. This paper proposes RFG (Region-level Facial Gene) extraction framework to address this issue. We propose to use IGE (Image-based Gene Encoder), LGE (Latent-based Gene Encoder) and Gene Decoder to learn the RFGs of a given face image, and the relationships between RFGs and the latent space of Style-GAN2. As cycle-like losses are designed to measure the $\mathcal{L}_data$ distances between the output of Gene Decoder and image encoder, and that between the output of LGE and IGE, only face images are required to train our framework, i.e. no paired kinship face data is required. Based upon the proposed RFGs, a crossover and mutation module is further designed to inherit the facial parts of parents. A Gene Pool has also been used to introduce the variations into the mutation of RFGs. The diversity of the faces of descendants can thus be significantly increased. Qualitative, quantitative, and subjective experiments on FIW, TSKinFace, and FF-databases clearly show that the quality and diversity of kinship faces generated by our approach are much better than the existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：