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

Conference on Local computer Networks (LCN)

作者： Eric Lanfer Sophia Sylvester Nils Aschenbruck Martin Atzmueller Osnabrück University Institute of Computer Science Osnabrück Germany Department of Mental Health Norwegian University of Science and Technology (NTNU) Trondheim Norway German Research Center for AI (DFKI) Plan-Based Robot Control Osnabrück Germany

Nowadays, anomaly-based network intrusion detection system (NIDS) still have limited real-world applications; this is particularly due to false alarms, a lack of datasets, and a lack of confidence. In this paper, we propose to use explainable artificial intelligence (XAI) methods for tackling these issues. In our experimentation, we train a random forest (RF) model on the NSL-KDD dataset, and use SHAP to generate global explanations. We find that these explanations deviate substantially from domain expertise. To shed light on the potential causes, we analyze the structural composition of the attack classes. There, we observe severe imbalances in the number of records per attack type subsumed in the attack classes of the NSL-KDD dataset, which could lead to generalization and overfitting regarding classification. Hence, we train a new RF classifier and SHAP explainer directly on the attack types. Classification performance is considerably improved, and the new explanations are matching the expectations based on domain knowledge better. Thus, we conclude that the imbalances in the dataset bias classification and consequently also the results of XAI methods like SHAP. However, the XAI methods can also be employed to find and debug issues and biases in the data and the applied model. Furthermore, the debugging results in higher trustworthiness of anomaly-based NIDS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph Completion with Low-Dimensional Gated Hierarchical Hyperbolic Embedding

SSRN

引用

SSRN 2024年

作者： Fang, Yan Liu, Xiaodong Lu, Wei Pedrycz, Witold Lang, Qi Yang, Jianhua School of Control Science and Engineering Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian116024 China Department of Electrical and Computer Engineering University of Alberta EdmontonT6R 2V4 AB Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia School of Computer Science and Information Technology Northeast Normal University Changchun130117 China

Knowledge Graph Embedding aims to advance the learning performance of knowledge graphs by deliberating the complexity of hierarchical data structures in a finite-dimensional space. Most traditional Euclidean models struggle to accurately describe and navigate the intricate hierarchical relationships between nodes. The hyperbolic embedding methods, particularly in conjunction with graph neural networks, offer promise in effectively modeling complex hierarchies in a limited-dimensional space. These methods can accommodate more information about nodes under the same conditions but are also more susceptible to interference from complex neighborhood features. This paper introduces HyperGatE, which novelty combines a hyperbolic graph hierarchical neighbor structure based on a gated filter and a hyperbolic isometric rotation model for knowledge graph completion. By analyzing the hierarchical structure of the knowledge base and using a gated mechanism to form multi-layer embedding networks of entity-relational paths, the gated filter selects diverse uneven multi-hop relations within the entity neighborhood and measures them through graph attention networks. Furthermore, the simplified hyperbolic isometric model allows for uncovering hierarchical structures in the data. HyperGatE experimentally surpasses the state-of-the-art Euclidean and hyperbolic space models in high and low dimensions across four well-known data, namely WN18RR, FB15k-237, NELL-995, and Kinship. © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-Query Oriented Continuous Subgraph Matching

Efficient Multi-Query Oriented Continuous Subgraph Matching

引用

International Conference on Data Engineering

作者： Ziyi Ma Jianye Yang Xu Zhou Guoqing Xiao Jianhua Wang Liang Yang Kenli Li Xuemin Lin School of Artificial Intelligence Hebei University of Technology China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University China Cyberspace Institute of Advanced Technology Guangzhou University China Department of New Networks PengCheng Laboratory China College of Computer Science and Electronic Engineering Hunan University China Shenzhen Research Institute Hunan University China Antai College of Economics and Management Shanghai Jiao Tong University China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Continuous subgraph matching (CSM) is a critical task for analyzing dynamic graphs and has a wide range of applications, such as merchant fraud detection, cyber-attack hunting, and rumor detection. Although many efficient CSM algorithms have been recently proposed, they are mainly designed to process a single query. However, in some application scenarios, multi-query oriented continuous subgraph matching (MQCSM) may be of more interest. To our knowledge, the two existing solutions to MQCSM are outdated due to unsatisfactory performance. In this paper, we propose MQ-Match, an efficient approach to MQCSM. First, we design a compact yet effective index structure CCG, which maintains the local matching result of vertices in the data graph using a directed graph. The directed edges in CCG can be utilized as an effective pruning rule for the subsequent incremental matching algorithm when expanding a partial match. Then, we develop a computation sharing incremental matching algorithm. In specific, a set of matching trees is constructed based on the depth-first search trees of the query graphs. By utilizing CCG, we conduct subgraph matching for the matching tree to collect the incremental matches for the query graphs, where the common structures of query graphs are matched only once. Extensive experiments show that MQ-Match can achieve 3.1x-7071.4x speedup over the competitors, and consumes much less memory under the majority of the experiment settings.

关键词： Heuristic algorithms Memory management Directed graphs Data engineering Fraud Computational efficiency Indexes

来源：评论

学校读者我要写书评

暂无评论

Autoregressive Queries for Adaptive Tracking with Spatio-Temporal Transformers

Autoregressive Queries for Adaptive Tracking with Spatio-Tem...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Jinxia Xie Bineng Zhong Zhiyi Mo Shengping Zhang Liangtao Shi Shuxiang Song Rongrong Ji Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guilin China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University School of Computer Science and Technology Harbin Institute of Technology Media Analytics and Computing Lab School of Informatics Xiamen University

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

The rich spatio-temporal information is crucial to capture the complicated target appearance variations in visual tracking. However, most top-performing tracking algorithms rely on many hand-crafted components for spatio-temporal information aggregation. Consequently, the spatio-temporal information is far away from being fully explored. To alleviate this issue, we propose an adaptive tracker with spatio-temporal transformers (named AQA-Track), which adopts simple autoregressive queries to effectively learn spatio-temporal information without many hand-designed components. Firstly, we introduce a set of learnable and autoregressive queries to capture the instantaneous target appearance changes in a sliding window fashion. Then, we design a novel attention mechanism for the interaction of existing queries to generate a new query in current frame. Finally, based on the initial target template and learnt autoregressive queries, a spatio-temporal information fusion module (STM) is designed for spatiotemporal formation aggregation to locate a target object. Benefiting from the STM, we can effectively combine the static appearance and instantaneous changes to guide robust tracking. Extensive experiments show that our method significantly improves the tracker's performance on six popular tracking benchmarks: LaSOT, LaSOT ext , TrackingNet, GOT-10k, TNL2K, and UAV123. Code and models will be https://***/orgs/GXNU-ZhongLab.

关键词： Adaptation models Visualization computer vision Target tracking Computational modeling Transformers Market research

来源：评论

学校读者我要写书评

暂无评论

RSAFormer: A method of polyp segmentation with region self-attention transformer

引用

computers in Biology and Medicine 2024年 172卷 108268-108268页

作者： Yin, Xuehui Zeng, Jun Hou, Tianxiao Tang, Chao Gan, Chenquan Jain, Deepak Kumar García, Salvador School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Dalian116024 China Symbiosis Institute of Technology Symbiosis International University Pune412115 India Department of Computer Science and Artificial Intelligence Andalusian Research Institute in Data Science and Computational Intelligence University of Granada Granada18071 Spain

Colonoscopy has attached great importance to early screening and clinical diagnosis of colon cancer. It remains a challenging task to achieve fine segmentation of polyps. However, existing State-of-the-art models still have limited segmentation ability due to the lack of clear and highly similar boundaries between normal tissue and polyps. To deal with this problem, we propose a region self-attention enhancement network (RSAFormer) with a transformer encoder to capture more robust features. Different from other excellent methods, RSAFormer uniquely employs a dual decoder structure to generate various feature maps. Contrasting with traditional methods that typically employ a single decoder, it offers more flexibility and detail in feature extraction. RSAFormer also introduces a region self-attention enhancement module (RSA) to acquire more accurate feature information and foster a stronger interplay between low-level and high-level features. This module enhances uncertain areas to extract more precise boundary information, these areas being signified by regional context. Extensive experiments were conducted on five prevalent polyp datasets to demonstrate RSAFormer's proficiency. It achieves 92.2% and 83.5% mean Dice on Kvasir and ETIS, respectively, which outperformed most of the state-of-the-art models. © 2024 Elsevier Ltd

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Online SVR Neural Network Based Ultra High Voltage Transmission Early Warning of Construction Progress

Online SVR Neural Network Based Ultra High Voltage Transmiss...

引用

IEEE Conference on Energy Internet and Energy System Integration (EI2)

作者： Liang Zhou Yinjie Zhu Yi Qian Yiquan Zhang Mingyang Chen Yuhan Xu Xingtang Wu Fang Fang Design Management Center State Grid Shanghai Economic Research Institute Shanghai China Engineering Technology Management Department Shanghai Power Transmission & Transformation Engineering Co.LTD. Shanghai China School of Control and Computer Engineering North China Electric Power University Beijing China

ISBN: (数字)9798331523527

ISBN: (纸本)9798331523534

Ultra high-voltage (UHV) transmission construction involves live work, requires crossing long distances, and must overcome terrain and climate challenges. Therefore, to enhance the accuracy of UHV transmission construction progress prediction and address the issue of online early warning, an early warning method for UHV transmission construction progress based on the online support vector regression (Online SVR) algorithm is proposed. Utilizing the digital twin model of UHV transmission construction, principal component analysis is employed to extract and analyze key factors influencing construction progress, the Online SVR algorithm dynamically learns and predicts construction progress. The prediction results are compared with the planned construction warning line to provide early warnings of potential construction progress risks. Finally, the method is applied to an actual UHV transmission construction site to verify its effectiveness.

关键词： Analytical models Accuracy Heuristic algorithms Neural networks High-voltage techniques System integration Predictive models Prediction algorithms Digital twins Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-Based Cascade Filtering System for fNIRS Data Analysis

Machine Learning-Based Cascade Filtering System for fNIRS Da...

引用

Progress in Applied Electrical Engineering (PAEE)

作者： Mariusz Pelc Dariusz Mikołajewski Tuukka Ruotsalo Luis A. Leiva Adam Sudoł Edward Jacek Gorzelańczyk Adam Łysiak Aleksandra Kawala-Sterniuk Faculty of Electrical Engineering Automatic Control and Informatics Opole University of Technology Opole Poland Institute of Computer Science Kazimierz Wielki University Bydgoszcz Poland University of Helsinki Finland University of Copenhagen Denmark Department of Computer Science University of Luxembourg Luxembourg Luxembourg Faculty of Natural and Technical Sciences University of Opole Opole Poland Institute of Philosophy Kazimierz Wielki University Bydgoszcz Poland

This paper presents a preliminary study on the use of machine learning-based methods to select the appropriate parameters of cascade filters in the analysis of brain signals recorded using functional infrared spectroscopy (fNIRS), which shows the level of oxygenation in the brain and, unlike EEG signals (showing electrical brain activity), are less prone to potential interference, disturbances or artifacts occurrence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AWGUNET: ATTENTION-AIDED WAVELET GUIDED U-NET FOR NUCLEI SEGMENTATION IN HISTOPATHOLOGY IMAGES

arXiv

引用

arXiv 2024年

作者： Roy, Ayush Pramanik, Payel Kaplun, Dmitrii Antonov, Sergei Sarkar, Ram Department of Electrical Engineering Jadavpur University Kolkata India Department of Computer Science and Engineering Jadavpur University Kolkata India Artificial Intelligence Research Institute China University of Mining and Technology Xuzhou China Department of Automation and Control Processes Saint Petersburg Electrotechnical University"LETI" Saint Petersburg Russia

Accurate nuclei segmentation in histopathological images is crucial for cancer diagnosis. Automating this process offers valuable support to clinical experts, as manual annotation is time-consuming and prone to human errors. However, automating nuclei segmentation presents challenges due to uncertain cell boundaries, intricate staining, and diverse structures. In this paper, we present a segmentation approach that combines the U-Net architecture with a DenseNet-121 backbone, harnessing the strengths of both to capture comprehensive contextual and spatial information. Our model introduces the Wavelet-guided channel attention module to enhance cell boundary delineation, along with a learnable weighted global attention module for channel-specific attention. The decoder module, composed of an upsample block and convolution block, further refines segmentation in handling staining patterns. The experimental results conducted on two publicly accessible histopathology datasets, namely Monuseg and TNBC, underscore the superiority of our proposed model, demonstrating its potential to advance histopathological image analysis and cancer diagnosis. The code is made available at: https://***/AyushRoy2001/AWGUNET © 2024, CC BY.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

TOWARDS NONLINEARITY. THE p-REGULARITY THEORY. APPLICATIONS AND DEVELOPMENTS.

arXiv

引用

arXiv 2025年

作者： Bednarczuk, E. Brezhneva, O. Leśniewski, K. Prusińska, A. Tret’Yakov, A. Warsaw University of Technology Poland Department of Mathematics Miami University OxfordOH United States System Research Institute Polish Academy of Sciences Poland Faculty of Science University of Siedlce Poland Dorodnicyn Computing Center Federal Research Center "Computer Science and Control " Russian Academy of Sciences Moscow119333 Russia

We present recent advances in the analysis of nonlinear equations with singular operators and nonlinear optimization problems with constraints given by singular mappings. The results are obtained within the framework of p-regularity theory, which has developed successfully over the last forty years. We illustrate the theory with its applications to degenerate problems in various areas of mathematics. In particular, we address the problem of describing the tangent cone to the solution set of nonlinear equations in a singular case. The structure of p-factor operators is used to propose optimality conditions and construct numerical methods for solving degenerate nonlinear equations and optimization problems. The methods presented in the paper can be considered as the first numerical approaches targeting solutions of degenerate problems, such as the Van der Pol differential equation, boundary-value problems with a small parameter, partial differential equations where Poincaré’s method of small parameter fails, nonlinear degenerate dynamical systems, and others. There are various practical applications for the theory of p-regularity, including structural engineering, composite materials, and material design. For instance, the theory can be applied to analyze the behavior of materials with irregular or complex properties. By considering higher-order derivatives, it becomes possible to model and predict the response of materials to external forces, such as stress or temperature variations. In geophysics, the p-regularity theory can be utilized to analyze and interpret complex data obtained from seismic surveys, gravity measurements, or electromagnetic surveys. The theory also finds applications in the analysis of nonlinear differential equations arising in control systems, geometric and topological analysis, biomechanics, and many other fields. The theory offers a valuable approach to analyzing and understanding nonlinear phenomena in situations where classical regularity

关键词： Boundary value problems

来源：评论

学校读者我要写书评

暂无评论

INSTANCE SEGMENTATION AND TEETH CLASSIFICATION IN PANORAMIC X-RAYS

arXiv

引用

arXiv 2024年

作者： Budagam, Devichand Ghosh, Sayan Imanbayev, Azamat Zhanatuly Kaplun, Dmitrii Rychenkov, Artem Sinitca, Aleksandr Kumar, Ayush Shrivastav, Anuj Akhmetov, Iskander Rafailovich Antonov, Sergey Cyganov, Gleb Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Kharagpur India Department of Chemical Engineering Indian Institute of Technology Kharagpur Kharagpur India School of IT and Engineering Kazakh-British Technical University Almaty Kazakhstan Artificial Intelligence Research Institute China University of Mining and Technology Xuzhou China Department of Automation and Control Processes St. Petersburg Electrotechnical University"LETI" St. Petersburg Russia Centre for Digital Telecommunication Technologies St. Petersburg Electrotechnical University"LETI" St. Petersburg Russia Department of Humanities and Social Sciences Indian Institute of Technology Kharagpur Kharagpur India Department of Architecture and Regional Planning Indian Institute of Technology Kharagpur Kharagpur India Faculty of Digital Transformation ITMO University St. Petersburg Russia

Teeth segmentation and recognition are critical in various dental applications and dental diagnosis. Automatic and accurate segmentation approaches have been made possible by integrating deep learning models. Although teeth segmentation has been studied in the past, only some techniques were able to effectively classify and segment teeth simultaneously. This article offers a pipeline of two deep learning models, U-Net and YOLOv8, which results in BB-UNet, a new architecture for the classification and segmentation of teeth on panoramic X-rays that is efficient and reliable. We have improved the quality and reliability of teeth segmentation by utilising the YOLOv8 and U-Net capabilities. The proposed networks have been evaluated using the mean average precision (mAP) and dice coefficient for YOLOv8 and BB-UNet, respectively. We have achieved a 3% increase in mAP score for teeth classification compared to existing methods, and a 10-15% increase in dice coefficient for teeth segmentation compared to U-Net across different categories of teeth. A new Dental dataset was created based on UFBA-UESC dataset with Bounding-Box and Polygon annotations of 425 dental panoramic X-rays. The findings of this research pave the way for a wider adoption of object detection models in the field of dental diagnosis. © 2024, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：