@misc{Udrea,
  type      = {Master Thesis},
  author    = {Udrea, Mihai-Andrei},
  title     = {Assessment of Data from Dynamic Bridge Monitoring},
  doi       = {10.25643/bauhaus-universitaet.2174},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20140429-21742},
  school      = {Bauhaus-Universit{\"a}t Weimar},
  abstract  = {The focus of the thesis is to process measurements acquired from a continuous monitoring system at a railway bridge. Temperature, strain and ambient vibration records are analysed and two main directions of investigation are pursued. The first and the most demanding task is to develop processing routines able to extract modal parameters from ambient vibration measurements. For this purpose, reliable experimental models are achieved on the basis of a stochastic system identification(SSI) procedure. A fully automated algorithm based on a three-stage clustering is implemented to perform a modal parameter estimation for every single measurement. After selecting a baseline of modal parameters, the evolution of eigenfrequencies is studied and correlated to environmental and operational factors. The second aspect deals with the structural response to passing trains. Corresponding triggered records of strain and temperature are processed and their assessment is accomplished using the average strains induced by each train as the reference parameter. Three influences due to speed, temperature and loads are distinguished and treated individually. An attempt to estimate the maximum response variation due to each factor is also carried out.},
  subject      = {Messtechnik},
  language  = {en}
}
@article{SaadatfarKhosraviHassannatajJoloudarietal.,
  author    = {Saadatfar, Hamid and Khosravi, Samiyeh and Hassannataj Joloudari, Javad and Mosavi, Amir and Shamshirband, Shahaboddin},
  title     = {A New K-Nearest Neighbors Classifier for Big Data Based on Efficient Data Pruning},
  series = {Mathematics},
  volume    = {2020},
  journal   = {Mathematics},
  number    = {volume 8, issue 2, article 286},
  publisher = {MDPI},
  doi       = {10.3390/math8020286},
  url       = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20200225-40996},
  pages     = {12},
  abstract  = {The K-nearest neighbors (KNN) machine learning algorithm is a well-known non-parametric classification method. However, like other traditional data mining methods, applying it on big data comes with computational challenges. Indeed, KNN determines the class of a new sample based on the class of its nearest neighbors; however, identifying the neighbors in a large amount of data imposes a large computational cost so that it is no longer applicable by a single computing machine. One of the proposed techniques to make classification methods applicable on large datasets is pruning. LC-KNN is an improved KNN method which first clusters the data into some smaller partitions using the K-means clustering method; and then applies the KNN for each new sample on the partition which its center is the nearest one. However, because the clusters have different shapes and densities, selection of the appropriate cluster is a challenge. In this paper, an approach has been proposed to improve the pruning phase of the LC-KNN method by taking into account these factors. The proposed approach helps to choose a more appropriate cluster of data for looking for the neighbors, thus, increasing the classification accuracy. The performance of the proposed approach is evaluated on different real datasets. The experimental results show the effectiveness of the proposed approach and its higher classification accuracy and lower time cost in comparison to other recent relevant methods.},
  subject      = {Maschinelles Lernen},
  language  = {en}
}