Search results for "algorithm."
showing 10 items of 4617 documents
Super-fit and population size reduction in compact Differential Evolution
2011
Although Differential Evolution is an efficient and versatile optimizer, it has a wide margin of improvement. During the latest years much effort of computer scientists studying Differential Evolution has been oriented towards the improvement of the algorithmic paradigm by adding and modifying components. In particular, two modifications lead to important improvements to the original algorithmic performance. The first is the super-fit mechanism, that is the injection at the beginning of the optimization process of a solution previously improved by another algorithm. The second is the progressive reduction of the population size during the evolution of the population. Recently, the algorithm…
Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization
2015
Classical evolutionary multi-objective optimization algorithms aim at finding an approx- imation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimiza- tion problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provid…
A Stochastic Algorithm Based on Fast Marching for Automatic Capacitance Extraction in Non-Manhattan Geometries
2014
WOS:000346854900026 (Nº de Acesso Web of Science) We present an algorithm for two- and three-dimensional capacitance analysis on multidielectric integrated circuits of arbitrary geometry. Our algorithm is stochastic in nature and as such fully parallelizable. It is intended to extract capacitance entries directly from a pixelized representation of the integrated circuit (IC), which can be produced from a scanning electron microscopy image. Preprocessing and monitoring of the capacitance calculation are kept to a minimum, thanks to the use of distance maps automatically generated with a fast marching technique. Numerical validation of the algorithm shows that the systematic error of the algo…
BioImageXD: an open, general-purpose and high-throughput image-processing platform
2012
BioImageXD puts open-source computer science tools for three-dimensional visualization and analysis into the hands of all researchers, through a user-friendly graphical interface tuned to the needs of biologists. BioImageXD has no restrictive licenses or undisclosed algorithms and enables publication of precise, reproducible and modifiable workflows. It allows simple construction of processing pipelines and should enable biologists to perform challenging analyses of complex processes. We demonstrate its performance in a study of integrin clustering in response to selected inhibitors.
A Serendipity-Oriented Greedy Algorithm for Recommendations
2017
Most recommender systems suggest items to a user that are popular among all users and similar to items the user usually consumes. As a result, a user receives recommendations that she/he is already familiar with or would find anyway, leading to low satisfaction. To overcome this problem, a recommender system should suggest novel, relevant and unexpected, i.e. serendipitous items. In this paper, we propose a serendipity-oriented algorithm, which improves serendipity through feature diversification and helps overcome the overspecialization problem. To evaluate our algorithm and compare it with others, we employ a serendipity metric that captures each component of serendipity, unlike the most …
Scalable Hierarchical Clustering: Twister Tries with a Posteriori Trie Elimination
2015
Exact methods for Agglomerative Hierarchical Clustering (AHC) with average linkage do not scale well when the number of items to be clustered is large. The best known algorithms are characterized by quadratic complexity. This is a generally accepted fact and cannot be improved without using specifics of certain metric spaces. Twister tries is an algorithm that produces a dendrogram (i.e., Outcome of a hierarchical clustering) which resembles the one produced by AHC, while only needing linear space and time. However, twister tries are sensitive to rare, but still possible, hash evaluations. These might have a disastrous effect on the final outcome. We propose the use of a metaheuristic algor…
Selection of the Proper Revenue and Pricing Model for SaaS
2014
Recent research on software revenue and pricing models has revealed important ways in which firms can benefit from software renting. However, it is still unclear how SaaS providers select a proper revenue and pricing model to make their services attractive for customers. Based on 32 interviews with software professionals from four case firms, this study reveals how different factors impacted on the selection of a revenue and pricing model. It can be concluded that customers’ needs were the main driving force to the selection of the most appropriate pricing and revenue model in the market. peerReviewed
Feature Extractors for Describing Vehicle Routing Problem Instances
2016
The vehicle routing problem comes in varied forms. In addition to usual variants with diverse constraints and specialized objectives, the problem instances themselves – even from a single shared source - can be distinctly different. Heuristic, metaheuristic, and hybrid algorithms that are typically used to solve these problems are sensitive to this variation and can exhibit erratic performance when applied on new, previously unseen instances. To mitigate this, and to improve their applicability, algorithm developers often choose to expose parameters that allow customization of the algorithm behavior. Unfortunately, finding a good set of values for these parameters can be a tedious task that…
Recommending Serendipitous Items using Transfer Learning
2018
Most recommender algorithms are designed to suggest relevant items, but suggesting these items does not always result in user satisfaction. Therefore, the efforts in recommender systems recently shifted towards serendipity, but generating serendipitous recommendations is difficult due to the lack of training data. To the best of our knowledge, there are many large datasets containing relevance scores (relevance oriented) and only one publicly available dataset containing a relatively small number of serendipity scores (serendipity oriented). This limits the learning capabilities of serendipity oriented algorithms. Therefore, in the absence of any known deep learning algorithms for recommend…
Scalable implementation of dependence clustering in Apache Spark
2017
This article proposes a scalable version of the Dependence Clustering algorithm which belongs to the class of spectral clustering methods. The method is implemented in Apache Spark using GraphX API primitives. Moreover, a fast approximate diffusion procedure that enables algorithms of spectral clustering type in Spark environment is introduced. In addition, the proposed algorithm is benchmarked against Spectral clustering. Results of applying the method to real-life data allow concluding that the implementation scales well, yet demonstrating good performance for densely connected graphs. peerReviewed