2,476 research outputs found

    STR-903: UNSUPERVISED NOVELTY DETECTION BASED STRUCTURAL DAMAGE DETECTION METHOD

    Get PDF
    Many structural damage detection methods using machine learning algorithms and clustering methods have been proposed and developed in recent years. Novelty detection is a common method that is based on an unsupervised learning technique to detect structural damage. The detection process involves applying the novelty detection algorithm to recognize abnormal data from the testing data sets. In order to make these algorithms capable of identifying abnormal data, sufficient normal data must first be obtained and used as training data. It is the fact that sufficient normal data is relatively convenient to measure compared to abnormal data for large-scale civil structures. Abnormal data from the testing data sets can be identified by using the well-trained normal model established by the algorithms. In this paper, a machine learning based novelty detection method called the Density Peaks based Fast Clustering Algorithm (DPFCA) is introduced and some improvements to this algorithm are made to increase the precision of detecting and localizing the damage in an experimental structure. Feature extraction is also an important factor in the process of damage detection. Thus, two damage-sensitive features such as crest factor, and transmissibility are extracted from the measured responses in the experiments. Experimental results showed good performance of the innovative method in detecting and locating the structural damage positions in various scenarios

    A survey of outlier detection methodologies

    Get PDF
    Outlier detection has been used for centuries to detect and, where appropriate, remove anomalous observations from data. Outliers arise due to mechanical faults, changes in system behaviour, fraudulent behaviour, human error, instrument error or simply through natural deviations in populations. Their detection can identify system faults and fraud before they escalate with potentially catastrophic consequences. It can identify errors and remove their contaminating effect on the data set and as such to purify the data for processing. The original outlier detection methods were arbitrary but now, principled and systematic techniques are used, drawn from the full gamut of Computer Science and Statistics. In this paper, we introduce a survey of contemporary techniques for outlier detection. We identify their respective motivations and distinguish their advantages and disadvantages in a comparative review

    Improving Sparsity in Kernel Adaptive Filters Using a Unit-Norm Dictionary

    Full text link
    Kernel adaptive filters, a class of adaptive nonlinear time-series models, are known by their ability to learn expressive autoregressive patterns from sequential data. However, for trivial monotonic signals, they struggle to perform accurate predictions and at the same time keep computational complexity within desired boundaries. This is because new observations are incorporated to the dictionary when they are far from what the algorithm has seen in the past. We propose a novel approach to kernel adaptive filtering that compares new observations against dictionary samples in terms of their unit-norm (normalised) versions, meaning that new observations that look like previous samples but have a different magnitude are not added to the dictionary. We achieve this by proposing the unit-norm Gaussian kernel and define a sparsification criterion for this novel kernel. This new methodology is validated on two real-world datasets against standard KAF in terms of the normalised mean square error and the dictionary size.Comment: Accepted at the IEEE Digital Signal Processing conference 201

    Advanced mobile network monitoring and automated optimization methods

    Get PDF
    The operation of mobile networks is a complex task with the networks serving a large amount of subscribers with both voice and data services, containing extensive sets of elements, generating extensive amounts of measurement data and being controlled by a large amount of parameters. The objective of this thesis was to ease the operation of mobile networks by introducing advanced monitoring and automated optimization methods. In the monitoring domain the thesis introduced visualization and anomaly detection methods that were applied to detect intrusions, mal-functioning network elements and cluster network elements to do parameter optimization on network-element-cluster level. A key component in the monitoring methods was the Self-Organizing Map. In the automated optimization domain several rule-based Wideband CDMA radio access parameter optimization methods were introduced. The methods tackled automated optimization in areas such as admission control, handover control and mobile base station cell size setting. The results from test usage of the monitoring methods indicated good performance and simulations indicated that the automated optimization methods enable significant improvements in mobile network performance. The presented methods constitute promising feature candidates for the mobile network management system.reviewe

    Optimal index rules for single resource allocation to stochastic dynamic competitors

    Get PDF
    In this paper we present a generic Markov decision process model of optimal single resource allocation to a collection of stochastic dynamic competitors. The main goal is to identify sufficient conditions under which this problem is optimally solved by an index rule. The main focus is on the frozen-if-not-allocated assumption, which is notoriously found in problems including the multi-armed bandit problem, tax problem, Klimov network, job sequencing, object search and detection. The problem is approached by a Lagrangian relaxation and decomposed into a collection of normalized parametric single-competitor subproblems, which are then optimally solved by the well-known Gittins index. We show that the problem is equivalent to solving a time sequence of its Lagrangian relaxations. We further show that our approach gives insights on sufficient conditions for optimality of index rules in restless problems (in which the frozen-if-not-allocated assumption is dropped) with single resource; this paper is the first to prove such conditions

    The condition monitoring of damaged steel structures.

    Get PDF
    SIGLEAvailable from British Library Document Supply Centre-DSC:DXN012487 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
    corecore