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

41st International Conference on Machine Learning, ICML 2024

作者： Ju, Wei Mao, Zhengyang Yi, Siyu Qin, Yifang Gu, Yiyang Xiao, Zhiping Wang, Yifan Luo, Xiao Zhang, Ming School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University-Anker Embodied AI Lab Peking University China School of Statistics and Data Science Nankai University China Department of Computer Science University of California Los Angeles United States School of Information Technology & Management University of International Business and Economics China

In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph neural networks (GNNs), they typically require a large number of costly labeled graphs, while a wealth of unlabeled graphs fail to be effectively utilized. Moreover, GNNs are inherently limited to encoding local neighborhood information using message-passing mechanisms, thus lacking the ability to model higher-order dependencies among nodes. To tackle these challenges, we propose a Hypergraph-Enhanced DuAL framework named HEAL for semi-supervised graph classification, which captures graph semantics from the perspective of the hypergraph and the line graph, respectively. Specifically, to better explore the higher-order relationships among nodes, we design a hypergraph structure learning to adaptively learn complex node dependencies beyond pairwise relations. Meanwhile, based on the learned hypergraph, we introduce a line graph to capture the interaction between hyperedges, thereby better mining the underlying semantic structures. Finally, we develop a relational consistency learning to facilitate knowledge transfer between the two branches and provide better mutual guidance. Extensive experiments on real-world graph datasets verify the effectiveness of the proposed method against existing state-of-the-art methods. Copyright 2024 by the author(s)

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

X-ray Image-Based COVID-19 Patient Detection Using Machine Learning-Based Techniques

引用

computer Systems science & Engineering 2022年第11期43卷 671-682页

作者： Shabana Habib Saleh Alyahya Aizaz Ahmed Muhammad Islam Sheroz Khan Ishrat Khan Muhammad Kamil Department of Information Technology College of ComputerQassim UniversityBuraidah52571Saudi Arabia Department of Electrical Engineering College of Engineering&Information TechnologyOnaizah CollegesOnaizah51911Saudi Arabia Digital Image Processing Lab Islamia CollegePeshawar25120KPKPakistan Department of Computer Science College of Computer and Information SciencesPrince Sultan UniversityRiyadh11586Saudi Arabia Department of Electrical Engineering National University of Computer and Emerging SciencesPeshawarPakistan

In early December 2019,the city of Wuhan,China,reported an outbreak of coronavirus disease(COVID-19),caused by a novel severe acute respiratory syndrome coronavirus-2(SARS-CoV-2).On January 30,2020,the World Health Organization(WHO)declared the outbreak a global pandemic *** the face of the COVID-19 pandemic,the most important step has been the effective diagnosis and monitoring of infected *** COVID-19 using Machine Learning(ML)technologies can help the health care unit through assistive diagnostic suggestions,which can reduce the health unit's burden to a certain *** paper investigates the possibilities of ML techniques in identifying/detecting COVID-19 patients including both conventional and exploring from chest X-ray images the effect of viral *** approach includes preprocessing,feature extraction,and ***,the features are extracted using the Histogram of Oriented(HOG)and Local Binary Pattern(LBP)feature ***,for the extracted features classification,six ML models of Support Vector Machine(SVM)and K-Nearest Neighbor(KNN)is *** results show that the diagnostic accuracy of random forest classifier(RFC)on extracted HOG plusLBP features is as high as 94%followed by SVM at 93%.The sensitivity of the K-nearest neighbour model has reached an accuracy of 88%.Overall,the predicted approach has shown higher classification accuracy and effective diagnostic *** is a highly useful tool for clinical practitioners and radiologists to help them in diagnosing and tracking the cases of COVID-19.

关键词： Image pre-processing detection classification x-ray images filter

来源：评论

学校读者我要写书评

暂无评论

IMPULSE NOISE REMOVAL BY L1 WEIGHTED NUCLEAR NORM MINIMIZATION

引用

Journal of Computational Mathematics 2023年第6期41卷 1171-1191页

作者： Jian Lu Yuting Ye Yiqiu Dong Xiaoxia Liu Yuru Zou Shenzhen Key Laboratory of Advanced Machine Learning and Applications College of Mathematics and StatisticsShenzhen UniversityShenzhen 518060China Guangdong Key Laboratory of Intelligent Information Processing Pazhou LabGuangzhou 510335China Department of Applied Mathematics and Computer Science Technical University of Denmark2800 Kgs.LyngbyDenmark

In recent years,the nuclear norm minimization(NNM)as a convex relaxation of the rank minimization has attracted great research *** assigning different weights to singular values,the weighted nuclear norm minimization(WNNM)has been utilized in many ***,most of the work on WNNM is combined with the l 2-data-fidelity term,which is under additive Gaussian noise *** this paper,we introduce the L1-WNNM model,which incorporates the l 1-data-fidelity term and the regularization from *** apply the alternating direction method of multipliers(ADMM)to solve the non-convex minimization problem in this *** exploit the low rank prior on the patch matrices extracted based on the image non-local self-similarity and apply the L1-WNNM model on patch matrices to restore the image corrupted by impulse *** results show that our method can effectively remove impulse noise.

关键词： Image denoising Weighted nuclear norm minimization l 1-data-fidelity term Low rank analysis Impulse noise

来源：评论

学校读者我要写书评

暂无评论

LayerMerge: neural network depth compression through layer pruning and merging 24

LayerMerge: neural network depth compression through layer p...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Jinuk Kim Marwa El Halabi Mingi Ji Hyun Oh Song Department of Computer Science and Engineering Seoul National University and Neural Processing Research Center Samsung - SAIT AI Lab Montreal Google

Recent works show that reducing the number of layers in a convolutional neural network can enhance efficiency while maintaining the performance of the network. Existing depth compression methods remove redundant non-linear activation functions and merge the consecutive convolution layers into a single layer. However, these methods suffer from a critical drawback; the kernel size of the merged layers becomes larger, significantly undermining the latency reduction gained from reducing the depth of the network. We show that this problem can be addressed by jointly pruning convolution layers and activation functions. To this end, we propose LayerMerge, a novel depth compression method that selects which activation layers and convolution layers to remove, to achieve a desired inference speed-up while minimizing performance loss. Since the corresponding selection problem involves an exponential search space, we formulate a novel surrogate optimization problem and efficiently solve it via dynamic programming. Empirical results demonstrate that our method consistently outperforms existing depth compression and layer pruning methods on various network architectures, both on image classification and generation tasks. We release the code at https://***/snu-mllab/LayerMerge.

关键词：

来源：评论

学校读者我要写书评

暂无评论

One Model for Two Tasks: Cooperatively Recognizing and Recovering Low-Resolution Scene Text Images by Iterative Mutual Guidance

arXiv

引用

arXiv 2024年

作者： Zhao, Minyi Wang, Yang Guan, Jihong Zhou, Shuigeng Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Department of Computer Science and Technology Tongji University China

Scene text recognition (STR) from high-resolution (HR) images has been significantly successful, however text reading on low-resolution (LR) images is still challenging due to insufficient visual information. Therefore, recently many scene text image super-resolution (STISR) models have been proposed to generate super-resolution (SR) images for the LR ones, then STR is done on the SR images, which thus boosts recognition performance. Nevertheless, these methods have two major weaknesses. On the one hand, STISR approaches may generate imperfect or even erroneous SR images, which mislead the subsequent recognition of STR models. On the other hand, as the STISR and STR models are jointly optimized, to pursue high recognition accuracy, the fidelity of SR images may be spoiled. As a result, neither the recognition performance nor the fidelity of STISR models are desirable. Then, can we achieve both high recognition performance and good fidelity? To this end, in this paper we propose a novel method called IMAGE (the abbreviation of Iterative MutuAl GuidancE) to effectively recognize and recover LR scene text images simultaneously. Concretely, IMAGE consists of a specialized STR model for recognition and a tailored STISR model to recover LR images, which are optimized separately. And we develop an iterative mutual guidance mechanism, with which the STR model provides high-level semantic information as clue to the STISR model for better super-resolution, meanwhile the STISR model offers essential low-level pixel clue to the STR model for more accurate recognition. Extensive experiments on two LR datasets demonstrate the superiority of our method over the existing works on both recognition performance and super-resolution fidelity. © 2024, CC BY-NC-SA.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Weakly-Supervised Graph Classification with Even a Single Key Subgraph Per Class

Weakly-Supervised Graph Classification with Even a Single Ke...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Lu Zhang Chenbo Zhang Jihong Guan Shuigeng Zhou Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Department of Computer Science & Technology Tongji University China

ISBN: (数字)9798331506681

ISBN: (纸本)9798331506698

Traditional graph classification requires large amounts of labeled data, which is expensive and time-consuming to acquire, especially in some special scenarios that domain knowledge is indispensable for labeling graphs. Observing that some key subgraphs can determine the properties of graphs (e.g. the toxicity of drug molecules depend on some toxic functional groups), in this paper we explore to classify graphs using unlabeled graphs plus a small number of key subgraphs for each class, which is called weakly-supervised graph classification. To this end, we develop the WeGraph method, where the graph classifier is trained with subgraph-based self-supervised learning and divergence- minimization based fine-tuning. Moreover, we design a key subgraph extraction algorithm to iteratively extract and update the key subgraphs, which makes the training process a closed loop. We conduct extensive experiments on different types of graph datasets to evaluate the effectiveness of WeGraph. Experimental results show that WeGraph can achieve high performance even when only one key subgraph is provided for each class.

关键词： Training Drugs Toxicology Social networking (online) Self-supervised learning Minimization Classification algorithms labeling Iterative methods Data mining

来源：评论

学校读者我要写书评

暂无评论

Competition on robust deep learning

引用

National science Review 2023年第6期10卷 13-15页

作者： Yinpeng Dong Chang Liu Wenzhao Xiang Hang Su Jun Zhu Department of Computer Science and Technology Institute for AI Tsinghua-Bosch Joint ML Center THBI Lab BNRist Center Tsinghua University Institute of Image Communication and Networks Engineering in the Department of Electronic Engineering (EE) Shanghai Jiao Tong University Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Peng Cheng Laboratory Pazhou Laboratory (Huangpu)

PROBLEM In recent years,the rapid development of artificial intelligence (AI) technology,especially machine learning and deep learning, is profoundly changing human production and *** various fields,such as robotics,face recognition,autonomous driving and healthcare,AI is playing an important ***,although AI is promoting the technological revolution and industrial progress,its security risks are often *** studies have found that the wellperforming deep learning models are extremely vulnerable to adversarial examples [1-3].The adversarial examples are crafted by applying small,humanimperceptible perturbations to natural examples,but can mislead deep learning models to make wrong *** vulnerability of deep learning models to adversarial examples can raise security and safety threats to various realworld applications.

关键词： robustness adversarial example adversarial training deep learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic Offloading Control for Waste Sorting Based on Deep Q-Network 24th

Dynamic Offloading Control for Waste Sorting Based on Deep...

引用

24th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2024

作者： Wang, Jing Wang, Xiaoyang Guo, Jianxiong Tang, Zhiqing Ding, Xingjian Wang, Tian Advanced Institute of Natural Sciences Beijing Normal University Zhuhai China Guangdong Key Lab of AI and Multi-modal Data Processing Department of Computer Science BNU-HKBU United International College Zhuhai China Faculty of Information Technology Beijing University of Technology Beijing China

ISBN: (纸本)9789819615278

With the increasing concern for environmental protection and resource optimization, efficient waste sorting has become a serious challenge today. In this paper, we propose a new offloading control problem that aims to solve waste sorting in wireless bin communication networks. Due to limited computational power, bins belonging to embedded devices rely on simple classification models with varying accuracy. In this scenario, consider a network of intelligent bins, each acting as an independent agent capable of deciding to offload an image to the edge server with a more accurate but resource-intensive model when the local classification is deemed inaccurate. Thus, Our goal is to find a lightweight online offloading policy that can achieve the best possible sorting accuracy while balancing transmission traffic. The method utilizes a Deep Q-network algorithm that enables each intelligent bin to make image-processing decisions autonomously. In the experiment, we validate the effectiveness of improving the performance of waste classification compared with existing flow control methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Distributed Resource Allocation Intelligent Waste Management Waste Sorting Wireless Communication Network

来源：评论

学校读者我要写书评

暂无评论

CIRCLE: scRNA-seq Data Clustering by Cluster-aware Iterative Contrastive Learning

CIRCLE: scRNA-seq Data Clustering by Cluster-aware Iterative...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jinxian Wang Weikang Jiang Jihong Guan Shuigeng Zhou Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University Shanghai China Department of Computer Science and Technolog Tongji University Shanghai China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Single-cell RNA sequencing (scRNA-seq) enables researchers to analyze gene expression at single-cell level. One important task in scRNA-seq data analysis is unsupervised clustering, which helps identify distinct cell types, laying down the foundation for other downstream analysis tasks. In this paper, we propose a novel method called Cluster-aware IteRative Contrastive LEarning (CIRCLE in short) for scRNA-seq data clustering, which uses an iterative representation learning and clustering framework to progressively learn the clustering structure of scRNA-seq data with a cluster-aware contrastive loss. CIRCLE consists of a Transformer encoder, a clustering head, a projection head and a contrastive loss. First, CIRCLE extracts the feature vectors of the original and augmented data by the Transformer-encoder. Then, it computes the clustering centroids by K-means and employs the student’s t-distribution to assign pseudo-labels to all cells in the clustering head. The projection-head uses a Multi-Layer Perceptron (MLP) to obtain projections of the augmented data. At last, both pseudo-labels and projections are used in the contrastive loss to guide the model training. Such a process goes iteratively so that the clustering result gets better and better. Extensive experiments on 25 real-world scRNA-seq datasets show that CIRCLE outperforms the state-of-the-art (SOTA) methods in most cases. Concretely, CIRCLE surpasses the existing methods by from 14% to 280%, and from 5% to 133% on average in terms of performance metrics ARI and NMI respectively. Source code is available at https://***/Alunethy/CIRCLE.

关键词： Representation learning Training Accuracy Data visualization Training data Contrastive learning Transformers Feature extraction Vectors Iterative methods

来源：评论

学校读者我要写书评

暂无评论

ESM All-Atom: Multi-scale Protein Language Model for Unified Molecular Modeling 41

ESM All-Atom: Multi-scale Protein Language Model for Unified...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zheng, Kangjie Long, Siyu Lu, Tianyu Yang, Junwei Dai, Xinyu Zhang, Ming Nie, Zaiqing Ma, Wei-Ying Zhou, Hao School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University Anker Embodied AI Lab Peking University Beijing100871 China School of Artificial Intelligence National Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science Tsinghua University China Tsinghua University China PharMolix Inc. China

Protein language models have demonstrated significant potential in the field of protein ***, current protein language models primarily operate at the residue scale, which limits their ability to provide information at the atom *** limitation prevents us from fully exploiting the capabilities of protein language models for applications involving both proteins and small *** this paper, we propose ESM-AA (ESM All-Atom), a novel approach that enables atom-scale and residue-scale unified molecular ***-AA achieves this by pretraining on multi-scale code-switch protein sequences and utilizing a multi-scale position encoding to capture relationships among residues and *** results indicate that ESM-AA surpasses previous methods in protein-molecule tasks, demonstrating the full utilization of protein language *** investigations reveal that through unified molecular modeling, ESM-AA not only gains molecular knowledge but also retains its understanding of proteins. Copyright 2024 by the author(s)

关键词： Molecular docking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：