Search results for " Algorithms"
showing 10 items of 612 documents
Predicting perceived visual complexity of abstract patterns using computational measures: The influence of mirror symmetry on complexity perception
2017
Visual complexity is relevant for many areas ranging from improving usability of technical displays or websites up to understanding aesthetic experiences. Therefore, many attempts have been made to relate objective properties of images to perceived complexity in artworks and other images. It has been argued that visual complexity is a multidimensional construct mainly consisting of two dimensions: A quantitative dimension that increases complexity through number of elements, and a structural dimension representing order negatively related to complexity. The objective of this work is to study human perception of visual complexity utilizing two large independent sets of abstract patterns. A w…
Feature selection with Ant Colony Optimization and its applications for pattern recognition in space imagery
2016
This paper presents a feature selection (FS) algorithm using Ant Colony Optimization (ACO). It is inspired by the particular behavior of real ants, namely by the fact that they are capable of finding the shortest path between a food source and the nest. There are considered two ACO-FS model applications for pattern recognition in remote sensing imagery: ACO Band Selection (ACO-BS) and ACO Training Label Purification (ACO-TLP). The ACO-BS reduces dimensionality of an input multispectral image data by selecting the “best” subset of bands to accomplish the classification task. The ACO-TLP selects the most informative training samples from a given set of labeled vectors in order to optimize the…
An evolutionary restricted neighborhood search clustering approach for PPI networks
2014
Protein-protein interaction networks have been broadly studied in the last few years, in order to understand the behavior of proteins inside the cell. Proteins interacting with each other often share common biological functions or they participate in the same biological process. Thus, discovering protein complexes made of a group of proteins strictly related can be useful to predict protein functions. Clustering techniques have been widely employed to detect significant biological complexes. In this paper, we integrate one of the most popular network clustering techniques, namely the Restricted Neighborhood Search Clustering (RNSC), with evolutionary computation. The two cost functions intr…
Indexing a sequence for mapping reads with a single mismatch
2014
Mapping reads against a genome sequence is an interesting and useful problem in computational molecular biology and bioinformatics. In this paper, we focus on the problem of indexing a sequence for mapping reads with a single mismatch. We first focus on a simpler problem where the length of the pattern is given beforehand during the data structure construction. This version of the problem is interesting in its own right in the context of the next generation sequencing. In the sequel, we show how to solve the more general problem. In both cases, our algorithm can construct an efficient data structure in time and space and can answer subsequent queries in time. Here, n is the length of the s…
Fast Implementation of Double-coupled Nonnegative Canonical Polyadic Decomposition
2019
Real-world data exhibiting high order/dimensionality and various couplings are linked to each other since they share some common characteristics. Coupled tensor decomposition has become a popular technique for group analysis in recent years, especially for simultaneous analysis of multi-block tensor data with common information. To address the multiblock tensor data, we propose a fast double-coupled nonnegative Canonical Polyadic Decomposition (FDC-NCPD) algorithm in this study, based on the linked CP tensor decomposition (LCPTD) model and fast Hierarchical Alternating Least Squares (Fast-HALS) algorithm. The proposed FDCNCPD algorithm enables simultaneous extraction of common components, i…
On general conditional prevision assessments
2009
In this paper we consider general conditional random quantities of the kind $X|Y$, where $X$ and $Y$ are finite discrete random quantities. Then, we introduce the notion of coherence for conditional prevision assessments on finite families of general conditional random quantities. Moreover, we give a compound prevision theorem and we examine the relation between the previsions of $X|Y$ and $Y|X$. Then, we give some results on random gains and, by a suitable alternative theorem, we obtain a characterization of coherence. We also propose an algorithm for the checking of coherence. Finally, we briefly examine the case of imprecise conditional prevision assessments by introducing the notions of…
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
Partial Discharges analysis and parameters identification by continuous Ant Colony Optimization
2008
The technique of ant colony optimization has been employed in this paper to efficiently deal with the problem of parameters identification in partial discharge, PD, analysis. The latter is a continuous optimization problem. From the technical point of view the identification of these parameters allows the modeling of the phenomenon of Partial Discharges in dielectrics. In this way it is possible the early diagnosis of defects in Medium Voltage cable lines and components and thus it is possible to prevent possible outages and service interruptions. Analytically, the problem consists of finding the Weibull parameters of the Pulse Amplitude Distribution (PAD) distributions allowing the identif…
An evolutionary method for complex-process optimization
2010
10 páginas, 7 figuras, 7 tablas
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …