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

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Tang, Pengju Dai, Dawei Zou, Kai Yang, Xionghui Wang, Guoyin Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Chongqing400065 China Chongqing Normal University College of Computer and Information Science Chongqing401331 China

ISBN: (纸本)9798350386226

Knee Osteoarthritis (KOA) is a common joint disease that severely affects the normal lives of patients. In clinical practice, the severity of KOA is commonly evaluated by observing radiographs of the knee joint However, this approach heavily relies on a doctor's clinical experience and exhibits a certain degree of subjectivity. In previous studies, various advanced deep convolutional neural network (CNN) models have been used to diagnose KOA. As known, CNN models often focus on learning the local detailed features for decision-making and lack attention to global structural information. In this study, we propose a dual network called GraphConvNet that integrates a visual graph neural network with a deep CNN to enhance representation learning by leveraging both local detailed features and global structural information. Our proposed method was evaluated using an Osteoarthritis Initiative (OAI) dataset and achieved an overall accuracy, recall, precision, and mean absolute error (MAE) of 75.24%, 77.75%, 74.33% and 0.283, respectively. Experiments demonstrate that our proposed method significantly improves the performance and achieves state-of-the-art performance. All codes are available at https://***/ddw2AIGROUP2CQUPT/GraphConvNet. © 2024 IEEE.

关键词： Joints (anatomy)

来源：评论

学校读者我要写书评

暂无评论

Scheduling Multiple Mobile Agents with Abilities of Sensing and Executing Simultaneously

Scheduling Multiple Mobile Agents with Abilities of Sensing ...

引用

2023 International Conference on Artificial Intelligence of Things and Systems, AIoTSys 2023

作者： Guo, Zhipeng Yu, Zhiyong Huang, Fangwan Tu, Chunyu Fuzhou University College of Computer and Data Science Fuzhou China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9798350312270

How to schedule public resources to maximize the coverage of crowds has always been a hot topic. There are mainly two types of research. One is the scheduling of static resources, whose coverage efficiency is lower because the resources cannot be moved;the other is the dynamic scheduling of movable public resources, but the existing methods require additional devices to collect crowd volume data. To address this issue, this article introduces a new category of mobile agents that can sense and execute simultaneously. This means that an agent can simultaneously perform crowd volume data collection tasks and crowds coverage tasks in its area. Taking these multi-ability agents as public resources, this article proposes a scheduling method called GE-STMC (Greedy Execute - Spatial and Temporal Monte-Carlo dropout). The method considers the spatiotemporal correlation between areas and evaluates the sensing value and the executing value of areas comprehensively to allocate the agents accordingly. Through the experimental on the real data of Beijing Happy Valley, this method can get 16% larger crowds volume coverage than other baseline methods with the same number of agents. © 2023 IEEE.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

A Privacy-friendly sequential progressive framework for segmented decision making

A Privacy-friendly sequential progressive framework for segm...

引用

2023 International Conference on Artificial Intelligence of Things and Systems, AIoTSys 2023

作者： Liu, Peng Yu, Zhiyong Huang, Fangwan Fuzhou University College of Computer and Data Science Fuzhou China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9798350312270

To achieve progressive and accurate decision-making for long-term time series data while meeting the needs of privacy-friendly and early, this paper proposes a universal framework for sequential progressive decision-making (SPD). This framework first segments the data and sets up multiple columns of neural networks according to the number of segments. Each column can make segmented decisions based on the inputs for the period. Additionally, without sharing the original data, the framework leverages lateral hidden layer connections between preceding and succeeding columns to obtain useful features for subsequent decision-making, gradually improving accuracy while avoiding the risk of data leakage. SPD has the advantages of privacy friendliness, column model diversification, prior knowledge reuse, and easy scalability, making it an effective framework for continuous decision-making. The effectiveness of that was validated using various network models in handwritten digit recognition and electrocardiogram classification tasks. The obtained experimental results reveal that SPD not only enables early decision-making while ensuring accuracy but also achieves accuracy levels comparable to or even surpassing those obtained using complete data, with the added benefit of privacy protection. © 2023 IEEE.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised PolSAR image classification method based on contrastive learning 6

Semi-supervised PolSAR image classification method based on ...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Hua, Wenqiang Sun, Nan Liu, Lin The Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Key Laboratory of Big Data and Intelligent Computing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an China School of Computer Technology Xi'an University of Posts and Telecommunications Xi'an China

ISBN: (纸本)9798400707674

Polarimetric synthetic aperture radar (PolSAR) image classification has important application value and a wide range of application scenarios in many fields. Supervised classification methods, which need to use a large amount of labeled data to improve classification accuracy, have achieved satisfactory classification performance. However, it is difficult and expensive to obtain sufficient labeled data for PolSAR images. The problem to be solved is how to obtain high classification accuracy with a limited number of labeled samples. Semi-supervised PolSAR image classification method based on contrastive learning is proposed. Firstly, a supervised PolSAR image classification method based on meta-learning is introduced. Prototypical network based on meta-learning ideas is used as the basic classification model, and a prototypical representation is created for each category. Classification is performed by computing the similarity between the prototypical representation and samples to be classified. Secondly, a method of training feature extractor based on contrastive learning is designed. By maintaining the consistency of features between the same data and distinguishing the differences between different data after data augmentation, the method enables the feature extractor to obtain accurate feature representation. By co-training with meta-learning, so as to improve the classification performance. Finally, experiments on real PolSAR data prove the effectiveness of the proposed method. © 2023 ACM.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

A Unified Framework Integrating Knowledge and data for Collaborative Root Cause Identification 5

A Unified Framework Integrating Knowledge and Data for Colla...

引用

5th International Conference on Sensing, Measurement and data Analytics in the Era of Artificial Intelligence, ICSMD 2024

作者： Yu, Jiefei Cao, Zicheng He, Siyi Gu, Zuyi Xu, Yingcheng Zhong, Kai Institutes of Physical Science and Information Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui China School of Big Data and Statistics Anhui University Anhui China

ISBN: (纸本)9798331529192

Capturing the root cause and propagation path of the fault is critical to ensuring the safety and efficiency of industrial processes, especially those that inadequately utilize process knowledge and data. To address this issue, a unified framework integrating knowledge and data for collaborative root cause identification is proposed. First, the knowledge causal graph (KCG) is constructed using expert knowledge and industrial flow charts, providing a preliminary reference for subsequent causality analysis. Next, by replacing the traditional vector autoregression (VAR) model in Granger Causality (GC) with the gated recurrent unit (GRU), a more reliable causal relationship between variables is obtained. Additionally, a causality fusion propagation path identification method (CF-PPI) is designed to identify the root cause and propagation path of the fault, so that the obtained fault propagation path has less redundancy and higher accuracy. Finally, the method is validated using data from the ASHRAE RP-1043 centrifugal chiller. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Air Pollution Monitoring By Integrating Local and Global Information in Self-Adaptive Multiscale Transform Domain

引用

IEEE Transactions on Multimedia 2025年 27卷 3716-3728页

作者： Gu, Ke Liu, Yuchen Liu, Hongyan Liu, Bo Qiao, Junfei Lin, Weisi Zhang, Wenjun Beijing University of Technology School of Information Science and Technology Engineering Research Center of Intelligent Perception and Autonomous Control of Ministry of Education Beijing Laboratory of Smart Environmental Protection Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Massey University School of Mathematical and Computational Sciences New Zealand Nanyang Technological University College of Computing and Data Science Singapore Shanghai Jiao Tong University Institute of Image Communication and Information Processing Shanghai China

As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutants discharged into the air per year by industrial activities, this paper proposed a novel image-based air pollution monitor (IAPM) by incorporating local and global information in the self-adaptive multiscale transform domain, so as to achieve the timely and effective leakage detection of typical air pollutants from a single image. To be specific, this paper first developed a screen-shaped module according to two significant findings in visual neuroscience, which include the high sensitivity of human eyes to horizontal and vertical stimuli and the center-surround inhibition, by designing and fusing the square module, horizontal strip module and vertical strip module parallelly for simulating the behaviour of human eyes to extract local features. Second, the learnable weights and proportional mapping were applied to incorporate the screen-shaped module and lightweight vision transformer as backbone, towards more richly exploiting and fusing local and global information just as the way a brain perceives external stimuli. Third, a new self-adaptive multiscale transform domain method was devised based on two motivations from the visual characteristics of multiscale perception and the brain characteristics of self-adaptive domain transform to modify the backbone by using the operations of pooling and pointwise convolution. Extensive experiments implemented on the datasets of carbon particulate matters and ethylene leakage confirmed the superior monitoring performance of the proposed IAPM model beyond the state-of-the-art (SOTA) peers by an accuracy gain of about 4%. Furthermore, the proposed IAPM model only required 0.089 GFLOPs and 0.15 million model parameters, remarkably outperforming SOTA competitors in computational efficiency and storage resources. © 1999-2

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

A Bi-selection Method Based on Consistent Matrix for Large-Scale datasets

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1992-2005页

作者： Quan, Jinsheng Qiao, Fengcai Yang, Tian Shen, Shuo Qian, Yuhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Institute of Interdisciplinary Studies Changsha410081 China National University of Defense Technology College of Advanced Interdisciplinary Studies Changsha410081 China Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China

Biselection (feature and sample selection) enhances the efficiency and accuracy of machine learning models when handling large-scale data. Fuzzy rough sets, an uncertainty mathematics model known for its excellent interpretability, are widely used in machine learning, particularly for feature selection. While the consistent matrix has significantly improved the computational efficiency and scalability of feature selection, like most fuzzy rough set-based methods, it focuses only on feature selection and seldom incorporates sample selection. This feature-centric approach can limit classification performance, particularly in noisy and large-scale datasets where both features and samples require judicious selection. To overcome these limitations, this article explores the integration of sample selection with feature selection. First, we introduce a β-consistent granulation method to generate more accurate and concise fuzzy information granules, reducing the impact of noisy samples. In addition, a novel membership function is employed to distinguish noise while simultaneously evaluating both features and samples. As a result, a biselection algorithm with linear computation complexity is proposed to select high-quality features and samples. Numerical experiments demonstrate that, compared to eleven representative algorithms, our proposed method achieves an average accuracy improvement of 9.66% and a 933-fold increase in efficiency. © 2025 IEEE.

关键词： Rough sets Noise Feature extraction Classification algorithms Accuracy Machine learning Information systems data models Computational efficiency Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Intention Recognition Method Based on Resting-state and P300 Task-state Dynamic Brain Functional Network Features 15

Intention Recognition Method Based on Resting-state and P300...

引用

15th International Conference on Measurement Technology and Mechanical Automation, ICMTMA 2023

作者： Yi, X. Wang, Z.M. Heng, X. 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

In order to reconfigure its structure from the static state in the vision odd ball task, so as to realize the intention recognition based on the characteristics of the brain functional network. The thesis proposes the intention recognition method based on resting state and P300 task state dynamic brain functional network features. First, the brain connectivity in each time window is constructed into a brain functional network using phase lock value (PLV). Then, extract the global features (global efficiency, transitivity) of the brain functional network, and use Louvain algorithm to obtain the brain functional network community. The experimental results show that in the (100-200) ms of P300 task status, the core nodes are mainly concentrated in the forehead region and the central region, while in the (300-500) ms of P300, the core nodes are concentrated in the temporal lobe. The recognition accuracy based on this method reaches 93%. © Published under licence by IOP Publishing Ltd.

关键词： Brain Function Network Intention Recognition P300 PLV Sliding Windows

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：