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

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient Particle YOLO Detector for Urine Sediment Detection 4th

An Efficient Particle YOLO Detector for Urine Sediment Dete...

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Chen, Zejian Hu, Rong Chen, Fukun Fan, Haoyi Ching, Fum Yew Li, Zuoyong Su, Shimei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fujian Fuzhou350118 China School of Computer and Artificial Intelligence Zhengzhou University Henan Zhengzhou450001 China School of Computer Sciences Universiti Sains Malaysia Penang11800 Malaysia Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fujian Fuzhou350121 China School of Electrical Engineering Zhengzhou University Henan Zhengzhou450001 China

ISBN: (纸本)9783031201011

Urine sediment detection is an essential aid in assessing kidney health. Traditional machine learning approaches treat urine sediment particle detection as an image classification task, segmenting particles for detection based on information such as edges or thresholds. However, the segmentation of sediment particles is complex due to the low contrast and weak edge characteristics of urine sediment images. In this paper, we consider urine sediment particle detection as a object detection task and propose the YOLOv5s-CBL, a detector dedicated to particle detection. Specifically, to mitigate the impact of background noise on detection accuracy, we inherit CBAM on the YOLOv5s model to help the network filter useless noise information and find regions of interest to extract target features. Then, we expand the original three-scale feature layer to improve the sensitivity of the model to larger-scale target sediment particles. Finally, we use the BiFPN structure instead of the original PANet combined with the FPN structure, which can more effectively fuse multiple different scales of information to improve the detection performance of the model. We compared state-of-the-art methods on two real-world datasets, and the experimental results demonstrated the effectiveness of YOLOv5s-CBL. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Deep Adaptively Feature Extracting Network for Cervical Squamous Lesion Cell Detection 4th

Deep Adaptively Feature Extracting Network for Cervical Squ...

引用

4th International Conference on Machine Learning for Cyber Security, ML4CS 2022

作者： Peng, Zhonghua Hu, Rong Wang, Fuen Fan, Haoyi Eng, Yee Wei Li, Zuoyong Zhou, Liwei Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fujian University of Technology Fujian Fuzhou350118 China School of Computer and Artificial Intelligence Zhengzhou University Henan Zhengzhou450001 China School of Computer Sciences Universiti Sains Malaysia Penang11800 Malaysia Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fujian Fuzhou350121 China Department of Nutrition The First Affiliated Hospital of Zhengzhou University Henan Zhengzhou450052 China

ISBN: (纸本)9783031200984

Cervical cancer is one of the most widespread malignancies affecting women’s health worldwide today. However, the task of detection is particularly difficult due to the complex background of the cervical smear, where cells are previously stacked in clusters. To address this problem, we utilize the YOLOv5 as the baseline and build on YOLOv5 by using the simple Transformer Block which only combines with multi-head self attention layers and MLP to better extract cell features as well as to obtain global information. In addition, we allow the model to refine features adaptively to assist with detection by using Convolutional Block Attention Module (CBAM), an attention module being simple and effective for feed-forward convolutional neural networks, in the complex background information. Finally, we compare the model with YOLOv5 as baseline. In CDetector dataset, our model obtains 52.5% mAP@.5, which is 6% better than baseline. In transfer learning, it is 62.2%, which outperforms baseline by 3.2%. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

Location Rating Based on Graph Neural Network 2020

Location Rating Based on Graph Neural Network

引用

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Fengbin Zheng Li Ding Lanxue Dang Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

With the rapid development of social networks, people are increasingly interested in sharing their location. Location recommendation has become an important personalization service for location-based social networks (LBSN). Location rating is one of the important tools. However, location-based social networks contain multidimensional network structures and node information. Existing approaches mostly focus on network structures that utilize one of these dimensions, which makes it difficult to efficiently aggregate information from multiple dimensions simultaneously. To overcome these difficulties, one of the recent approaches is the social recommendation based on graph neural networks (GNNs). Based on this, this paper proposes a graph neural network framework for location rating. Graph neural networks are highly inductive and can efficiently aggregate network structure and node information. In particular, the method not only aggregates homogeneous social networks composed of user and heterogeneous bipartite graphs composed of user-location, but also constructs location networks using location sequences to propose an aggregation model for location networks. Experiments are conducted on two datasets, and the results show that the method improves on the root mean square error (RMSE) and mean absolute error (MAE) metrics.

关键词： Graph neural network Location rating Location based social networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Answering Subjective Induction Questions on Products by Summarizing Multi-sources Multi-viewpoints Knowledge

Answering Subjective Induction Questions on Products by Summ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yufeng Zhang Meng-Xiang Wang Jianxing Yu School of Artificial Intelligence Sun Yat-sen University Zhuhai Guangdong Key Laboratory of Big Data Analysis and Processing China China National Institute of Standardization China Pazhou Lab Guangzhou China

This paper proposes a new task in the field of Answering Subjective Induction Question on Products (SUBJPQA). The answer to this kind of question is non-unique, but can be interpreted from many perspectives. For example, the answer to ‘whether the phone is heavy’ has a variety of different viewpoints. A satisfied answer should be able to summarize these subjective opinions from multiple sources and provide objective knowledge, such as the weight of a phone. That is quite different from the traditional QA task, in which the answer to a factoid question is unique and can be found from a single data source. To address this new task, we propose a three-steps method. We first retrieve all answer-related clues from multiple knowledge sources on facts and opinions. The implicit commonsense facts are also collected to supplement the necessary but missing contexts. We then capture their relevance with the questions by interactive attention. Next, we design a reinforcement-based summarizer to aggregate all these knowledgeable clues. Based on a template-controlled decoder, we can output a comprehensive and multi-perspective answer. Due to the lack of a relevant evaluated benchmark set for the new task, we construct a large-scale dataset, named SupQA, consisting of 48,352 samples across 15 product domains. Evaluation results show the effectiveness of our approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Document Retrieval by End-to-End Refining and Quantizing BERT Embedding with Contrastive Product Quantization

Efficient Document Retrieval by End-to-End Refining and Quan...

引用

2022 Conference on Empirical Methods in Natural Language processing, EMNLP 2022

作者： Qiu, Zexuan Su, Qinliang Yu, Jianxing Si, Shijing School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Artificial Intelligence Sun Yat-Sen University Guangzhou China School of Economics and Finance Shanghai International Studies University China

Efficient document retrieval heavily relies on the technique of semantic hashing, which learns a binary code for every document and employs Hamming distance to evaluate document distances. However, existing semantic hashing methods are mostly established on outdated TFIDF features, which obviously do not contain lots of important semantic information about documents. Furthermore, the Hamming distance can only be equal to one of several integer values, significantly limiting its representational ability for document distances. To address these issues, in this paper, we propose to leverage BERT embeddings to perform efficient retrieval based on the product quantization technique, which will assign for every document a real-valued codeword from the codebook, instead of a binary code as in semantic hashing. Specifically, we first transform the original BERT embeddings via a learnable mapping and feed the transformed embedding into a probabilistic product quantization module to output the assigned codeword. The refining and quantizing modules can be optimized in an end-to-end manner by minimizing the probabilistic contrastive loss. A mutual information maximization based method is further proposed to improve the representativeness of codewords, so that documents can be quantized more accurately. Extensive experiments conducted on three benchmarks demonstrate that our proposed method significantly outperforms current state-of-the-art baselines. © 2022 Association for Computational Linguistics.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Model that Learns Discriminative Features for Automatic Sleep Stage Classification Based on Raw Single-Channel EEG

SSRN

引用

SSRN 2023年

作者： Heng, Xia Wang, Miao Wang, Zhong-Min Zhang, Jie He, Lang Fan, Lin 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

Sleep staging is the basis of sleep quality assessment. In the process of scoring each sleep stage, some automatic sleep staging models often fail to effectively capture the more accurate long-range correlation coupling between the input sleep EEG signals and the output sleep stage, which leads to the extracted features cannot effectively distinguish the different sleep stage. In order to alleviate the long-term time series problem of sleep EEG signals and learn the discriminative features of each sleep stage in sleep EEG signals, we propose an end-to-end automatic sleep stage classification method based on raw single-channel sleep EEG signals, which can improve the attention to the discriminative features of each sleep stage. In the construction of the model, in order to learn the source domain information of the key part of the sleep EEG signal, SE-Block is added to Convolutional Neural Network (CNN) to highlight the time-frequency domain features related to the sleep stage. Meanwhile, the attention mechanism is added to the decoding part of Bidirectional Recurrent Unit (Bi-GRU) to enhance the long-term memory ability of Bi-GRU and learn the conversion rules between sleep stages. To validate the accuracy and stability of the model, the Fpz-Cz channel and Pz-Oz channel EEG signals in the Sleep-EDF sleep dataset are used for 10-fold cross-validation. The classification accuracies obtained are 88.48% and 87.56%, respectively. The results show that our model has stronger ability to extract discriminative features, better representation ability, more stable performance and relatively simple structure. © 2023, The Authors. All rights reserved.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Network Embedding with Topology-Aware Textual Representations 18th

Network Embedding with Topology-Aware Textual Representation...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Chen, Jiaxing Xu, Zenan Su, Qinliang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China

ISBN: (纸本)9783030891879

Textual network embedding aims to learn meaningful low-dimensional representations for vertices with the consideration of the associated texts. When learning the representations for texts in network embedding, existing methods mostly only exploit information from neighboring texts (i.e., contexts), while rarely taking advantages of the valuable network topological (structural) information. To bridge the gap, in this paper, a model based on adaptive-filter convolutional neural networks (CNN) is developed, in which the filters are adapted to local network topologies, rather than clamped to fixed values as in traditional CNNs. The dependency enables the learned text representations to be aware of local network topologies. It is shown that the proposed topology-aware representations can be viewed as a complement to existing context-aware ones. When the two are used together, experimental results on three real-world benchmarks demonstrate that significant performance improvements on the tasks of link prediction and vertex classification. © 2021, Springer Nature Switzerland AG.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：