Foundations of Population-Based SHM, Part IV: The Geometry of Spaces of Structures and their Feature Spaces

• URL: http://arxiv.org/abs/2103.03655v1
• Date: Fri, 5 Mar 2021 13:28:51 GMT
• Title: Foundations of Population-Based SHM, Part IV: The Geometry of Spaces of Structures and their Feature Spaces
• Authors: George Tsialiamanis, Charilaos Mylonas, Eleni Chatzi, Nikolaos Dervilis, David J. Wagg, Keith Worden
• Abstract summary: This paper will discuss the various geometrical structures required for an abstract theory of feature spaces in Structural Health Monitoring. In the second part of the paper, the problem of determining the normal condition cross section of a feature bundle is addressed. The solution is provided by the application of Graph Neural Networks (GNN), a versatile non-Euclidean machine learning algorithm.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: One of the requirements of the population-based approach to Structural Health Monitoring (SHM) proposed in the earlier papers in this sequence, is that structures be represented by points in an abstract space. Furthermore, these spaces should be metric spaces in a loose sense; i.e. there should be some measure of distance applicable to pairs of points; similar structures should then be close in the metric. However, this geometrical construction is not enough for the framing of problems in data-based SHM, as it leaves undefined the notion of feature spaces. Interpreting the feature values on a structure-by-structure basis as a type of field over the space of structures, it seems sensible to borrow an idea from modern theoretical physics, and define feature assignments as sections in a vector bundle over the structure space. With this idea in place, one can interpret the effect of environmental and operational variations as gauge degrees of freedom, as in modern gauge field theories. This paper will discuss the various geometrical structures required for an abstract theory of feature spaces in SHM, and will draw analogies with how these structures have shown their power in modern physics. In the second part of the paper, the problem of determining the normal condition cross section of a feature bundle is addressed. The solution is provided by the application of Graph Neural Networks (GNN), a versatile non-Euclidean machine learning algorithm which is not restricted to inputs and outputs from vector spaces. In particular, the algorithm is well suited to operating directly on the sort of graph structures which are an important part of the proposed framework for PBSHM. The solution of the normal section problem is demonstrated for a heterogeneous population of truss structures for which the feature of interest is the first natural frequency.

Related papers

• Neural networks in non-metric spaces [0.0]
  We prove several universal approximation theorems for a vast class of input and output spaces. We show that our neural network architectures can be projected down to "finite dimensional" subspaces with any desirable accuracy. The resulting neural network architecture is therefore applicable for prediction tasks based on functional data.
  arXiv  Detail & Related papers  (2024-06-13T16:44:58Z)
• IME: Integrating Multi-curvature Shared and Specific Embedding for Temporal Knowledge Graph Completion [97.58125811599383]
  Temporal Knowledge Graphs (TKGs) incorporate a temporal dimension, allowing for a precise capture of the evolution of knowledge. We propose a novel Multi-curvature shared and specific Embedding (IME) model for TKGC tasks. IME incorporates two key properties, namely space-shared property and space-specific property.
  arXiv  Detail & Related papers  (2024-03-28T23:31:25Z)
• Algebraic Topological Networks via the Persistent Local Homology Sheaf [15.17547132363788]
  We introduce a novel approach to enhance graph convolution and attention modules by incorporating local topological properties of the data. We consider the framework of sheaf neural networks, which has been previously leveraged to incorporate additional structure into graph neural networks' features.
  arXiv  Detail & Related papers  (2023-11-16T19:24:20Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• On an application of graph neural networks in population based SHM [0.0]
  The aim of this paper is to predict the first natural frequency of trusses of different sizes, across different environmental temperatures and having different bar member types. The accuracy of the regression is satisfactory even in structures with higher number of nodes and members than those used to train it.
  arXiv  Detail & Related papers  (2022-03-03T11:11:57Z)
• A Unifying and Canonical Description of Measure-Preserving Diffusions [60.59592461429012]
  A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework. We develop a geometric theory that improves and generalises this construction to any manifold.
  arXiv  Detail & Related papers  (2021-05-06T17:36:55Z)
• The role of feature space in atomistic learning [62.997667081978825]
  Physically-inspired descriptors play a key role in the application of machine-learning techniques to atomistic simulations. We introduce a framework to compare different sets of descriptors, and different ways of transforming them by means of metrics and kernels. We compare representations built in terms of n-body correlations of the atom density, quantitatively assessing the information loss associated with the use of low-order features.
  arXiv  Detail & Related papers  (2020-09-06T14:12:09Z)
• Orthologics for Cones [5.994412766684843]
  In this paper we study logics for such geometric structures. We describe an extension of minimal orthologic with a partial modularity rule that holds for closed convex cones. This logic combines a feasible data structure (exploiting convexity/conicity) with sufficient expressivity, including full orthonegation.
  arXiv  Detail & Related papers  (2020-08-07T13:28:27Z)
• Geodesics in fibered latent spaces: A geometric approach to learning correspondences between conditions [62.997667081978825]
  This work introduces a geometric framework and a novel network architecture for creating correspondences between samples of different conditions. Under this formalism, the latent space is a fiber bundle stratified into a base space encoding conditions, and a fiber space encoding the variations within conditions.
  arXiv  Detail & Related papers  (2020-05-16T03:14:52Z)
• A General Framework for Consistent Structured Prediction with Implicit Loss Embeddings [113.15416137912399]
  We propose and analyze a novel theoretical and algorithmic framework for structured prediction. We study a large class of loss functions that implicitly defines a suitable geometry on the problem. When dealing with output spaces with infinite cardinality, a suitable implicit formulation of the estimator is shown to be crucial.
  arXiv  Detail & Related papers  (2020-02-13T10:30:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.