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

A Feature Fusion Attention-based Deep Learning Algorithm for Mammographic Architectural Distortion Classification

学校读者我要写书评

暂无评论

IEEE Journal of Biomedical and Health Informatics 2025年 PP卷 PP页

作者： Rehman, Khalil Ur Jianqiang, Li Yasin, Anaa Bilal, Anas Basheer, Shakila Ullah, Inam Jabbar, Muhammad Kashif Tian, Yibin Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Beijing University of Technology College of Software Engineering Beijing100124 China Hainan Normal University College of Information Science and Technology Hainan Haikou571158 China Princess Nourah Bint Abdulrahman University Department of Information Systems College of Computer and Information Science Riyadh11671 Saudi Arabia Gachon University Department of Computer Engineering Seongnam13120 Korea Republic of Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan

Architectural Distortion (AD) is a common abnormality in digital mammograms, alongside masses and microcalcifications. Detecting AD in dense breast tissue is particularly challenging due to its heterogeneous asymmetries and subtle presentation. Factors such as location, size, shape, texture, and variability in patterns contribute to reduced sensitivity. To address these challenges, we propose a novel feature fusion-based Vision Transformer (ViT) attention network, combined with VGG-16, to improve accuracy and efficiency in AD detection. Our approach mitigates issues related to texture fixation, background boundaries, and deep neural network limitations, enhancing the robustness of AD classification in mammograms. Experimental results demonstrate that the proposed model achieves state-of-the-art performance, outperforming eight existing deep learning models. On the PINUM dataset, it attains 0.97 sensitivity, 0.92 F1-score, 0.93 precision, 0.94 specificity, and 0.96 accuracy. On the DDSM dataset, it records 0.93 sensitivity, 0.91 F1-score, 0.94 precision, 0.92 specificity, and 0.95 accuracy. These results highlight the potential of our method for computer-aided breast cancer diagnosis, particularly in low-resource settings where access to high-end imaging technology is limited. By enabling more accurate and timely AD detection, our approach could significantly improve breast cancer screening and early intervention worldwide. © 2013 IEEE.

关键词： Deep neural networks

Clustering Interval and Triangular Granular Data: Modeling, Execution, and Assessment

学校读者我要写书评

暂无评论

IEEE Transactions on Neural Networks and Learning Systems 2024年第6期36卷 10000-10014页

作者： Yiming Tang Wenbin Wu Witold Pedrycz Jianwei Gao Xianghui Hu Zhaohong Deng Rui Chen Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei University of Technology Hefei China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada School of Computer and Information Hefei University of Technology Hefei China Faculty of Automatic Control Electronics and Computer Science Silesian University of Tecghnology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul TÃrkiye School of Computer Science and Engineering Southeast University Nanjing China School of Artificial Intelligence and Computer Jiangnan University Wuxi Jiangsu China

In current granular clustering algorithms, numeric representatives were selected by users or an ordinary strategy, which seemed simple; meanwhile, weight settings for granular data could not adequately express their structural characteristics. Aiming at these problems, in this study, a new scheme called a granular weighted kernel fuzzy clustering (GWKFC) algorithm is put forward. We propose the representative selection and granularity generation (RSGG) algorithm enlightened by the density peak clustering (DPC) algorithm. We build interval and triangular granular data on the strength of numeric representatives obtained by RSGG under the principle of justifiable granularity (PJG), in which we establish some combinations of functions and boundary constraints and prove their properties. Furthermore, we present a novel distance formula via the kernel function for granular data and design new weights to affect the coverage and specificity of granular data. In addition, based upon these factors, we come up with the GWKFC algorithm of granular clustering, and its performance with different granularity is assessed. To sum up, a macro framework involving granular modeling, granular clustering, and assessment has been set up. Lastly, the GWKFC algorithm and ten other granular clustering algorithms are compared by experiments on some artificial and UCI datasets together with datasets with large data or those of high dimensionality. It is found that the GWKFC algorithm can provide better granular clustering results by contrast with other algorithms. The originality is embodied as follows. First, we improve the previous density radius and present the RSGG algorithm to acquire numeric representatives. Second, we propose a new strategy to determine granular data boundaries and further obtain novel weights enlightened by the idea of volume. Lastly, we employ the kernel function to calculate the distance between granular data, which has a stronger spatial division ability than the pr

关键词： Clustering algorithms Data models Computational modeling Numerical models Kernel Phase change materials Granular computing Uncertainty Fuzzy sets Noise

Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Adams, Steven Patanè, Andrea Lahijanian, Morteza Laurenti, Luca Delft Center for Systems and Control Technical Universiy of Delft Delft2628 CD Netherlands School of Computer Science and Statistics Trinity College Dublin Dublin 2 Ireland Department of Aerospace Engineering Sciences and Computer Science University of Colorado Boulder BoulderCO80303 United States

Infinitely wide or deep neural networks (NNs) with independent and identically distributed (i.i.d.) parameters have been shown to be equivalent to Gaussian processes. Because of the favorable properties of Gaussian processes, this equivalence is commonly employed to analyze neural networks and has led to various breakthroughs over the years. However, neural networks and Gaussian processes are equivalent only in the limit;in the finite case there are currently no methods available to approximate a trained neural network with a Gaussian model with bounds on the approximation error. In this work, we present an algorithmic framework to approximate a neural network of finite width and depth, and with not necessarily i.i.d. parameters, with a mixture of Gaussian processes with error bounds on the approximation error. In particular, we consider the Wasserstein distance to quantify the closeness between probabilistic models and, by relying on tools from optimal transport and Gaussian processes, we iteratively approximate the output distribution of each layer of the neural network as a mixture of Gaussian processes. Crucially, for any NN and ǫ > 0 our approach is able to return a mixture of Gaussian processes that is ǫ-close to the NN at a finite set of input points. Furthermore, we rely on the differentiability of the resulting error bound to show how our approach can be employed to tune the parameters of a NN to mimic the functional behavior of a given Gaussian process, e.g., for prior selection in the context of Bayesian inference. We empirically investigate the effectiveness of our results on both regression and classification problems with various neural network architectures. Our experiments highlight how our results can represent an important step towards understanding neural network predictions and formally quantifying their uncertainty. © 2024, CC BY.

关键词： Deep neural networks

Bidirectional Multi-Stack RNNs with Attention for Machine Translation

学校读者我要写书评

暂无评论

Bidirectional Multi-Stack RNNs with Attention for Machine Tr...

On-Line Conference (ONCON), Industrial Electronics Society Annual

作者： Zhiren Chen Ziyu Qiu Nuo Chen the Department of Mechanical & Industrial Engineering University of Toronto Toronto Canada Faculty of Computer Science Dalhousie University Halifax Canada Department of Mechanical Engineering Advanced Control and Mechatronics Lab Dalhousie University Halifax Canada

This project developed a novel attention algorithm for multi-stack bidirectional encoder-decoder RNN (including GRU and LSTM) sequence-to-sequence models, particularly for language translation tasks. The attention mechanism utilizes matrix rearranging and multiplication to compute the significance of the vectors in the encoder output to the vectors in the current decoder hidden states when predicting each word. Our approach achieved 98% of the performance of fine-tuned pretrained T5-small, with 30% to 50% fewer parameters depending on vocabulary size, making our model an ideal choice in cases of single-processor training, low processor resource, limited memory, small dataset, or tasks not supported by pretrained transformers.

关键词：

Modular Model Reduction of Interconnected Systems: A Top-Down Approach

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Janssen, Lars A.L. Besselink, Bart Fey, Rob H.B. van de Wouw, Nathan Dynamics and Control group Department of Mechanical Engineering Eindhoven University of Technology Netherlands Bernoulli Institute for Mathematics Computer Science and Artificial Intelligence University of Groningen Netherlands

Models of complex systems often consist of multiple interconnected subsystem/component models that are developed by multi-disciplinary teams of engineers or scientists. To ensure that such interconnected models can be applied for the purpose of simulation and/or control, a reduced-order model for the interconnected dynamics is needed. In the scope of this paper, we pursue this goal by subsystem reduction to warrant modularity of the reduction approach. Clearly, by reducing the complexity of the subsystem models, not only the accuracy of the subsystem models is affected, but, consequently, also the accuracy of the interconnected model. It is typically difficult to predict a priori how the interconnected model accuracy is affected precisely by the subsystem reduction. In this work, we address this challenge by introducing a top-down approach which enables the translation of given accuracy requirements of the interconnected system model to accuracy requirements at subsystem model level, by using mathematical tools from robust performance analysis. This allows for the independent reduction of subsystem models while guaranteeing the desired accuracy of the interconnected model. In addition, we show how this top-down approach can be used to significantly reduce the interconnected model in an illustrative structural dynamics case study. © 2023, CC BY-NC-ND.

关键词： Large scale systems

Learning from Heterogeneity: A Dynamic Learning Framework for Hypergraphs

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Tiehua Liu, Yuze Shen, Zhishu Ma, Xingjun Qi, Peng Ding, Zhijun Jin, Jiong The School of Computer Science and Technology Tongji University Shanghai China Ant Group Shanghai China The School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan China The School of Computer Science Fudan University Shanghai China The Department of Control Science and Engineering Tongji University Shanghai China The School of Science Computing and Engineering Technologies Swinburne University of Technology Melbourne Australia

Graph neural network (GNN) has gained increasing popularity in recent years owing to its capability and flexibility in modeling complex graph structure data. Among all graph learning methods, hypergraph learning is a technique for exploring the implicit higher-order correlations when training the embedding space of the graph. In this paper, we propose a hypergraph learning framework named Learning from Heterogeneity (LFH) that is capable of dynamic hyperedge construction and attentive embedding update utilizing the heterogeneity attributes of the graph. Specifically, in our framework, the high-quality features are first generated by the pairwise fusion strategy that utilizes explicit graph structure information when generating initial node embedding. Afterwards, a hypergraph is constructed through the dynamic grouping of implicit hyperedges, followed by the type-specific hypergraph learning process. To evaluate the effectiveness of our proposed framework, we conduct comprehensive experiments on several popular datasets with twelve state-of-the-art models on both node classification and link prediction tasks, which fall into categories of homogeneous pairwise graph learning, heterogeneous pairwise graph learning, and hypergraph learning. The experiment results demonstrate a significant performance gain (an average of 12.9% in node classification and 12.8% in link prediction) compared with recent state-of-the-art methods. © 2023, CC BY.

关键词： Contrastive Learning

Electrical resistivity-temperature characteristics enhancement of insulating cross-linked polyethylene composites by incorporating positive temperature coefficient particles with different Curie temperatures

学校读者我要写书评

暂无评论

High Voltage 2023年第1期8卷 1-11页

作者： Guimin Jiang Yuanxiang Zhou Chenyuan Teng Yunxiao Zhang Xin Huang Lei Xue Luming Zhou The Wind Solar Storage Division of State Key Laboratory of Control and Simulation of Power System and Generation Equipment Xinjiang UniversityUrumqiChina State Key Laboratory of Power System and Generation Equipment Department of Electrical EngineeringTsinghua UniversityBeijingChina College of Information Engineering Zhejiang University of TechnologyHangzhouChina School of Electronics and Computer Science University of SouthamptonSouthamptonUK

Incorporating positive temperature coefficient(PTC)ceramic particles into polymers provides a prospective alternative solution for suppressing severe electric field distortions caused by negative temperature coefficient(NTC)of electrical resistivity within polymer insulation in high voltage direct current *** effect of the Curie temperature of PTC particles on the inhibition of the NTC effect of cross-linked polyethylene(XLPE)is investigated in this *** temperature coefficient particles with varied Curie temperatures are surface-modified and melt blending with *** modified particles are dispersed on averagely in the *** electrical resistivity,space charge behaviour,and direct current(DC)electrical breakdown strength of the samples are investigated at different temperatures,exploring the effect of the Curie temperature of PTC particles on suppressing the NTC effect of *** is demonstrated that the reduction in Curie temperature can further suppress the NTC effect of XLPE,enhance the DC strength at elevated temperatures,and inhibit the internal space charge *** reduction in the Curie temperatures means that the initiation of the PTC effect advances,exhibiting a higher potential barrier and inhibiting the NTC effect more *** work may give a reference for improving the temperature stability of DC properties for XLPE cable insulation.

关键词： coefficient resistivity insulation

Algorithmically Fair Maximization of Multiple Submodular Objective Functions

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Amanatidis, Georgios Birmpas, Georgios Lazos, Philip Leonardi, Stefano Reiffenhäuser, Rebecca School of Mathematics Statistics and Actuarial Science University of Essex United Kingdom Archimedes / Athena RC Greece Department of Computer Science University of Liverpool United Kingdom London United Kingdom Department of Computer Control and Management Engineering Sapienza University of Rome Italy Institute for Logic Language and Computation University of Amsterdam Netherlands

Constrained maximization of submodular functions poses a central problem in combinatorial optimization. In many realistic scenarios, a number of agents need to maximize multiple submodular objectives over the same ground set. We study such a setting, where the different solutions must be disjoint, and thus, questions of algorithmic fairness arise. Inspired from the fair division literature, we suggest a simple round-robin protocol, where agents are allowed to build their solutions one item at a time by taking turns. Unlike what is typical in fair division, however, the prime goal here is to provide a fair algorithmic environment;each agent is allowed to use any algorithm for constructing their respective solutions. We show that just by following simple greedy policies, agents have solid guarantees for both monotone and non-monotone objectives, and for combinatorial constraints as general as p-systems (which capture cardinality and matroid intersection constraints). In the monotone case, our results include approximate EF1-type guarantees and their implications in fair division may be of independent interest. Further, although following a greedy policy may not be optimal in general, we show that consistently performing better than that is computationally hard. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

Passivity of nonlinear time-delay systems

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2023年第2期56卷 8568-8573页

作者： Yu Kawano Saeed Ahmed Michele Cucuzzella Jacquelien M.A. Scherpen Graduate School of Advanced Science and Engineering Hiroshima University Higashi-hiroshima 739-8527 Japan Jan C. Willems Center for Systems and Control ENTEG Faculty of Science and Engineering University of Groningen 9747 AG Groningen The Netherlands Department of Electrical Computer and Biomedical Engineering University of Pavia 27100 Pavia Italy

This paper presents passivity-based control of nonlinear systems with retarded delays in the state. To this end, we first show that the standard passivity concept can naturally be generalized to time-delay systems, which readily implies that a feedback interconnection (with or without communication delays) of passive time-delay systems is also passive. Then, we propose a storage functional for passivity analysis and further use it for stability analysis of controlled-passive time-delay systems. In particular, invoking an invariance principle for retarded functional differential equations, we show that a passive time-delay system can always be stabilized by a static output feedback controller under a delayed version of the zero-state detectability assumption.

关键词： Passivity nonlinear systems time-delay systems retarded functional differential equations stabilizing control