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

2022 3rd International Conference on Computer Information and Big data Applications, CIBDA 2022

作者： Ma, Xiaqing Xu, Tao Wang, Fengsi Xu, Aopeng Zhang, Zixiang College of Computer and Information Engineering Henan University Henan Province Kaifeng City China Henan Key Laboratory of Big Data Analysis and Processing Henan University Henan Province Kaifeng City China Henan Industrial Technology Academy of Spatio-Temporal Big Data Henan University Henan Province Zhengzhou China

ISBN: (纸本)9783800758760

The knowledge hierarchy provided by the curriculum syllabus is the basic principle for the implementation of course teaching and assessment, which usually summarizes knowledge units into a tree-like hierarchical structure in the form of chapters. But it cannot supply the complete picture of knowledge relationships because of the lack of horizontal connections between knowledge units in it. In order to present the characteristics of knowledge units and the many-tomany relationships between them comprehensively and accurately. This paper proposes a method for the construction of course knowledge structures from the massive test question bank with the Gaussian Mixture Clustering model. This method employs the Gaussian Mixture Clustering model to find the knowledge units and their associations from a large number of test questions, then employs the knowledge graph technology to make the course Knowledge Graph, and construct the curriculum knowledge hierarchy. Extensive empirical research focuses on the physics course in eighth grade (first) course in junior high school. Experimental results demonstrate that the constructed curriculum knowledge hierarchy of the physics course is complete and effective. Furthermore, the average coverage of some random final test papers is 89.2%. © VDE VERLAG GMBH - Berlin - Offenbach.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

LCIQA: A Lightweight Contrastive-Learning Framework for image Quality Assessment via Cross-Scale Consistency Minimization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Feng, Chenxi Min, Xiongkuo Ye, Long Yang, Yinghao Communication University of China State Key Laboratory of Media Convergence and Communication Beijing100024 China Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai200240 China Ministry of Education and School of Data Science and Media Intelligence Beijing100024 China

Blind image quality assessment (BIQA), which functions without the need for a reference image, is a challenging yet essential task in various image processing systems and downstream vision applications, ranging from semantic recognition to image enhancement. Traditionally, numerous BIQA models have been developed using supervised learning methodologies, which rely heavily on the availability and quality of ground truth data. To improve the generalization capability and robustness of these models, recent studies have explored the application of contrastive learning, aiming to enhance the quality representation capacity of model backbones through a self-supervised approach. However, the training process for contrastive learning is computationally intensive, posing significant challenges in resource-constrained environments. To mitigate this issue, we propose a Lightweight Contrastive-learning-based IQA (LCIQA) framework, designed to be efficiently trained on a single GPU without relying on ground truth data. This framework maintains a fixed vision backbone and focuses on optimizing the parameters of subsequent IQA heads through contrastive learning. To accommodate a lightweight framework, we incorporate a quality task adapter to eliminate semantic biases introduced by the features extracted from the fixed-parameter backbone. A coarse-to-fine contrastive learning strategy is then employed to train the quality regression module. Extensive experiments demonstrate the superior performance of our model in terms of both accuracy and complexity. In addition, ablation studies validate the effectiveness of each component within the proposed framework. © 1991-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Medical image Segmentation Based on 3d Pdc with Swin Transformer

SSRN

引用

SSRN 2025年

作者： Fan, Lin Ding, Xiaojia Wang, Zhongmin Wang, Hai Zhang, Rong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China The School of Information Science and Technology Northwest University Shaanxi Xi’an710121 China

3D medical image segmentation is vital for disease diagnosis and effective treatment strategies. Despite the advancements in Convolutional Neural Networks (CNN), their fixed receptive fields constrain global context modeling, leading to suboptimal performance, particularly with complex shapes and multi-scale variations. Transformer enhances the global modeling capability through self-attention mechanism. However, challenges persist in capturing fine-grained local features and extracting edge features. To overcome these issues, In this study, a dual-path encoder is proposed, which consists of a 3D PDC and a Swin Transformer and is combined with a CNN for the decoder. The 3D PDC module extracts local features by calculating the differences between neighboring pixels. To improve the ability of capturing edge structures, three 3D PDC variants (3D CPDC, 3D APDC, and 3D RPDC) are proposed to optimize the processing ability of complex edges, multi-directional edges, and multi-scale structures, respectively. After performance evaluation, the selected CARV combinations (3D CPDC, 3D APDC, 3D RPDC, and 3D ordinary convolution) achieve a compromise between high segmentation accuracy and low computational cost. The Swin Transformer encoder captures global context using a hierarchical shift-window mechanism, while the CNN decoder fuses features progressively to produce precise pixel-level segmentation. The proposed method exceeds the performance of existing state-of-the-art techniques, as shown by experiments conducted on the BTCV, FLARE21, and AMOS22 datasets. © 2025, The Authors. All rights reserved.

关键词： image segmentation

来源：评论

学校读者我要写书评

暂无评论

TreeVI: reparameterizable tree-structured variational inference for instance-level correlation capturing 24

TreeVI: reparameterizable tree-structured variational infere...

引用

Proceedings of the 38th International Conference on Neural Information processing Systems

作者： Junxi Xiao Qinliang Su School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China and Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

ISBN: (纸本)9798331314385

Mean-field variational inference (VI) is computationally scalable, but its highly-demanding independence requirement hinders it from being applied to wider scenarios. Although many VI methods that take correlation into account have been proposed, these methods generally are not scalable enough to capture the correlation among data instances, which often arises in applications involving graphs or explicit constraints among instances. In this paper, we developed the Tree-structured Variational Inference (TreeVI), which uses a tree to capture the correlation among latent variables in the posterior. We show that samples from the tree-structured posterior can be reparameterized efficiently and parallelly, making its training cost just 2 or 3 times that of VI under the mean-field assumption. To capture correlation with more complicated structure, the TreeVI is further extended to the multiple-tree case. Furthermore, we show that the underlying tree structure can be automatically learned from training data. With experiments on synthetic datasets, constrained clustering, user matching and link prediction, we demonstrate the efficacy of TreeVI in capturing instance-level correlation in posteriors and enhancing the performance of downstream applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Weighted Flat Lattice Transformer-based Knowledge Extraction Architecture for Chinese Named Entity Recognition

A Weighted Flat Lattice Transformer-based Knowledge Extracti...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hengwei Zhang Yuejia Wu Jian-Tao Zhou Inner Mongolia University College of Computer Science Hohhot China Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Named Entity Recognition (NER) is one of the contents of Knowledge Extraction (KE) that transforms data into knowledge representation. However, Chinese NER faces the problem of lacking clear word boundaries that limit the effectiveness of the KE. Although the flat lattice Transformer (FLAT) framework, which converts lattice structure into a flat structure including a set of spans, can effectively improve this problem and obtain advanced results, there still exist the problems of insensitivity to entity importance weights and insufficient feature learning. This paper proposes a weighted flat lattice Transformer architecture for Chinese NER, namely WFLAT. The WFLAT first adds a weight matrix into self-attention calculation, which can obtain finer-grained partitioning of entities to improve experimental performance, and then adopts a multi-layer Transformer encoder with each layer using a multi-head self-attention mechanism. Extensive experimental results on benchmarks demonstrate that our proposed KE model can obtain state-of-the-art performance for the Chinese NER task.

关键词： Representation learning Computational modeling Memory management Lattices Named entity recognition Transforms Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Out-of-Distribution Fault Diagnosis of Industrial Cyber-Physical Systems Based on Orthogonal Anchor Clustering With Adaptive Balance

IEEE Transactions on Industrial Cyber-Physical Systems

引用

IEEE Transactions on Industrial Cyber-Physical Systems 2025年 3卷 48-60页

作者： Liu, Ruonan Hu, Puyuan Zhao, Siheng Sun, Zhijian Han, Te Pang, Zhibo Zhang, Weidong Shanghai Jiao Tong University Department of Automation Shanghai200240 China National Key Laboratory of Marine Engine Science and Technology Shanghai201108 China Crossocean of Suzhou Technology Suzhou215121 China Beijing Institute of Technology Center for Energy and Environmental Policy Research School of Management Beijing100081 China ABB Corporate Research Sweden Department of Automation Technology Vasteras722 26 Sweden KTH Royal Institute of Technology Department of Intelligent Systems Stockholm114 28 Sweden Henan University Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Kaifeng475001 China Shanghai Jiaotong University Department of Automation Shanghai200240 China

Given the critical role of rotating machinery in industrial cyber-physical systems (ICPS), ensuring their reliable operation is essential for the stability and safety of ICPS. Deep neural networks have demonstrated competitive results for intelligent fault diagnosis, which are usually trained via the historical data of all fault modes. However, in real engineering, it is usually difficult to collect samples and exhaust all failures during the training stage. As a result, out-of-distribution fault diagnosis (OOD-FD) becomes a more realistic problem that requires the methods to not only accurately diagnose the known faults, but also effectively recognize unknown ones. Therefore, a novel orthogonal anchor clustering with focal attention (FA-OAC) is proposed in this paper for OOD-FD. Firstly, an orthogonal anchor clustering (OAC) algorithm is proposed to fix the class center of each fault mode orthogonally and distinguish the known and unknown faults at the class level. Then, because the identifiability of different fault modes changes a lot in OOD-FD, the focal attention mechanism is applied to dynamically adjust the attention to different fault modes according to the distance loss of OAC, thus addressing the identifiability imbalance problem. To verify the effectiveness of the proposed method, different OOD-FD tasks are designed based on two rotating machinery datasets. The experimental results and comparison with state-of-the-art fault diagnosis methods have demonstrated that the proposed method has improved the OOD-FD performance greatly and therefore provides an effective tool in real engineering. © 2023 IEEE.

关键词： Rotating machinery

来源：评论

学校读者我要写书评

暂无评论

Dynamic Residual Classifier for Class Incremental Learning

Dynamic Residual Classifier for Class Incremental Learning

引用

International Conference on Computer Vision (ICCV)

作者： Xiuwei Chen Xiaobin Chang School of Artificial Intelligence Sun Yat-sen University China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou P.R.China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China

The rehearsal strategy is widely used to alleviate the catastrophic forgetting problem in class incremental learning (CIL) by preserving limited exemplars from previous tasks. With imbalanced sample numbers between old and new classes, the classifier learning can be biased. Existing CIL methods exploit the long-tailed (LT) recognition techniques, e.g., the adjusted losses and the data re-sampling methods, to handle the data imbalance issue within each increment task. In this work, the dynamic nature of data imbalance in CIL is shown and a novel Dynamic Residual Classifier (DRC) is proposed to handle this challenging scenario. Specifically, DRC is built upon a recent advance residual classifier with the branch layer merging to handle the model-growing problem. Moreover, DRC is compatible with different CIL pipelines and substantially improves them. Combining DRC with the model adaptation and fusion (MAF) pipeline, this method achieves state-of-the-art results on both the conventional CIL and the LT-CIL benchmarks. Extensive experiments are also conducted for a detailed analysis. The code is publicly available 1 .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-task regression learning for survival analysis via prior information guided transductive matrix completion

引用

Frontiers of Computer Science 2020年第5期14卷 99-112页

作者： Lei Chen Kai Shao Xianzhong Long Lingsheng Wang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing210023China MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and AstronauticsNanjing211106China

Survival analysis aims to predict the occurrence time of a particular event of interest,which is crucial for the prognosis analysis of ***,due to the limited study period and potential losing tracks,the observed data inevitably involve some censored instances,and thus brings a unique challenge that distinguishes from the general regression *** addition,survival analysis also suffers from other inherent challenges such as the high-dimension and small-sample-size *** address these challenges,we propose a novel multi-task regression learning model,i.e.,prior information guided transductive matrix completion(PigTMC)model,to predict the survival status of the new ***,we use the multi-label transductive matrix completion framework to leverage the censored instances together with the uncensored instances as the training samples,and simultaneously employ the multi-task transductive feature selection scheme to alleviate the overfitting issue caused by high-dimension and small-sample-size *** addition,we employ the prior temporal stability of the survival statuses at adjacent time intervals to guide survival ***,we design an optimization algorithm with guaranteed convergence to solve the proposed PigTMC ***,the extensive experiments performed on the real microarray gene expression datasets demonstrate that our proposed model outperforms the previously widely used competing methods.

关键词： survival analysis matrix completion multi-task regression transductive learning multi-task feature selection

来源：评论

学校读者我要写书评

暂无评论

Inferring Prerequisite Relationships Among Learning Resources for HPC Education 11th

Inferring Prerequisite Relationships Among Learning Resource...

引用

11th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2020

作者： Wu, Run Luo, Chenyu Hu, Miao Wu, Di School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9789811600098

For online HPC (High-Performance Computing) education, identifying the prerequisite relationships among different HPC learning resources is important for generating learning paths and personalized course recommendations for students. Previously, such prerequisite relationships were often created by domain experts manually. In this paper, we propose a novel framework to infer both concept and learning resource prerequisite relationships and integrate such a framework into an online HPC education platform. We first construct a bi-directional long short-term (BiLSTM) neural network with attention mechanism to automatically mine the latent semantic features from the formal description of concepts. Then, we input two kinds of features into a fully connected neural network for classification and obtain the relationships among concepts. Considering the asymmetry and directivity of the prerequisite relation, we adopt a network embedding model to learn the vector representations of each concept as the prerequisite and subsequent roles. The concept vectors are weighted and summed to generate the feature vectors of learning resources. For a given pair of learning resources, their feature vectors are input into a classifier that outputs the result of relation classification. Finally, we conduct a series of experiments on two large benchmark datasets. The experimental results show that our method outperforms existing methods with significant improvements. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

KGE-CL: Contrastive Learning of Tensor Decomposition Based Knowledge Graph Embeddings 29

KGE-CL: Contrastive Learning of Tensor Decomposition Based K...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Luo, Zhiping Xu, Wentao Liu, Weiqing Bian, Jiang Yin, Jian Liu, Tie-Yan School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Microsoft Research Asia Beijing China School of Artificial Intelligence Sun Yat-sen University Zhuhai China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

Learning the embeddings of knowledge graphs (KG) is vital in artificial intelligence, and can benefit various downstream applications, such as recommendation and question answering. In recent years, many research efforts have been proposed for knowledge graph embedding (KGE). However, most previous KGE methods ignore the semantic similarity between the related entities and entity-relation couples in different triples since they separately optimize each triple with the scoring function. To address this problem, we propose a simple yet efficient contrastive learning framework for tensor decomposition based (TDB) KGE, which can shorten the semantic distance of the related entities and entity-relation couples in different triples and thus improve the performance of KGE. We evaluate our proposed method on three standard KGE datasets: WN18RR, FB15k-237 and YAGO3-10. Our method can yield some new state-of-the-art results, achieving 51.2% MRR, 46.8% Hits@1 on the WN18RR dataset, 37.8% MRR, 28.6% Hits@1 on FB15k-237 dataset, and 59.1% MRR, 51.8% Hits@1 on the YAGO3-10 dataset. Source codes and data of this paper can be found at https://***/Wentao-Xu/KGE-CL. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：