Search results for "UML"
showing 10 items of 407 documents
Bio-inspired security analysis for IoT scenarios
2020
Computer security has recently become more and more important as the world economy dependency from data has kept growing. The complexity of the systems that need to be kept secure calls for new models capable of abstracting the interdependencies among heterogeneous components that cooperate at providing the desired service. A promising approach is attack graph analysis, however, the manual analysis of attack graphs is tedious and error prone. In this paper we propose to apply the metabolic network model to attack graph analysis, using three interacting bio-inspired algorithms: topological analysis, flux balance analysis, and extreme pathway analysis. A developed framework for graph building…
Development of Applications for Interactive and Reproducible Research: a Case Study
2016
For a proper understanding of the organization and regulation of gene expression, the computational analysis is an essential component of the scientific workflow, and this is particularly true in the fields of biostatistics and bioinformatics. Interactivity and reproducibility are two highly relevant features to consider when adopting or designing a tool, and often they can not be provided simultaneously.In this work, we address the issue of developing a framework that can provide interactive analysis, in order to allow experimentalists to fully exploit advanced software tools, as well as reproducibility as an internal validation of the analysis steps, by providing the underlying code and d…
Advances in blind source separation for spatial data
2021
Viele Datensaetze bestehen aus multivariaten Messungen, die an verschiedenen geographischen Orten durchgefuehrt wurden. Typischerweise besitzen solche Datensaetze die Eigenschaft, dass Messungen in unmittelbarer Naehe aehnlicher sind als Messungen, die eine hohe Entfernung aufweisen. In der statistischen Analyse solcher raeumlichen Daten sollte diese spezielle Eigenschaft beruecksichtigt werden. In letzter Zeit wurde in der statistischen Literatur die sogenannte Blind Source Separation Methode auf raeumliche Daten erweitert. In diesem Model wird angenommen, dass die Daten aus Linearkombinationen von unbeobachteten Variablen bestehen, und das Ziel ist diese latenten Variablen zu bestimmen. D…
Class discovery from semi-structured EEG data for affective computing and personalisation
2017
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link. Many approaches to recognising emotions from metrical data such as EEG signals rely on identifying a very small number of classes and to train a classifier. The interpretation of these classes varies from a single emotion such as stress [24] to features of emotional model such as valence-arousal [4]. There are two major issues here. First classification approach limits the analysis of the data within the selected classes and is also highly dependent on training data/cycles, all of which limits generalisation. Second issue is that it does not exp…
Effectiveness of local feature selection in ensemble learning for prediction of antimicrobial resistance
2008
In the real world concepts are often not stable but change over time. A typical example of this in the biomedical context is antibiotic resistance, where pathogen sensitivity may change over time as pathogen strains develop resistance to antibiotics that were previously effective. This problem, known as concept drift (CD), complicates the task of learning a robust model. Different ensemble learning (EL) approaches (that instead of learning a single classifier try to learn and maintain a set of classifiers over time) have been shown to perform reasonably well in the presence of concept drift. In this paper we study how much local feature selection (FS) can improve ensemble performance for da…
Modeling Multi-label Recurrence in Data Streams
2019
Most of the existing data stream algorithms assume a single label as the target variable. However, in many applications, each observation is assigned to several labels with latent dependencies among them, which their target function may change over time. Classification of such non-stationary multi-label streaming data with the consideration of dependencies among labels and potential drifts is a challenging task. The few existing studies mostly cope with drifts implicitly, and all learn models on the original label space, which requires a lot of time and memory. None of them consider recurrent drifts in multi-label streams and particularly drifts and recurrences visible in a latent label spa…
Topological structure analysis of chromatin interaction networks.
2019
Abstract Background Current Hi-C technologies for chromosome conformation capture allow to understand a broad spectrum of functional interactions between genome elements. Although significant progress has been made into analysis of Hi-C data to identify biologically significant features, many questions still remain open, in particular regarding potential biological significance of various topological features that are characteristic for chromatin interaction networks. Results It has been previously observed that promoter capture Hi-C (PCHi-C) interaction networks tend to separate easily into well-defined connected components that can be related to certain biological functionality, however, …
A local complexity based combination method for decision forests trained with high-dimensional data
2012
Accurate machine learning with high-dimensional data is affected by phenomena known as the “curse” of dimensionality. One of the main strategies explored in the last decade to deal with this problem is the use of multi-classifier systems. Several of such approaches are inspired by the Random Subspace Method for the construction of decision forests. Furthermore, other studies rely on estimations of the individual classifiers' competence, to enhance the combination in the multi-classifier and improve the accuracy. We propose a competence estimate which is based on local complexity measurements, to perform a weighted average combination of the decision forest. Experimental results show how thi…
A Feature Set Decomposition Method for the Construction of Multi-classifier Systems Trained with High-Dimensional Data
2013
Data mining for the discovery of novel, useful patterns, encounters obstacles when dealing with high-dimensional datasets, which have been documented as the "curse" of dimensionality. A strategy to deal with this issue is the decomposition of the input feature set to build a multi-classifier system. Standalone decomposition methods are rare and generally based on random selection. We propose a decomposition method which uses information theory tools to arrange input features into uncorrelated and relevant subsets. Experimental results show how this approach significantly outperforms three baseline decomposition methods, in terms of classification accuracy.