50 resultados para Fractional algorithms
Resumo:
The use of fractional calculus when modeling phenomena allows new queries concerning the deepest parts of the physical laws involved in. Here we will be dealing with an apparent paradox in which the time of transference from zero in a system with fractional derivatives can be strictly shortened relatively to the minimal time transference done in an equivalent system in the frame of the entire derivatives.
Resumo:
Despite the huge number of works considering fractional derivatives or derivatives on time scales some basic facts remain to be evaluated. Here we will be showing that the fractional derivative of monomials is in fact an entire derivative considered on an appropriate time scale.
Resumo:
In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the size of sample's neighborhood that allows it to reach the minimum graph cut as a quality measure, we compared several optimization techniques that can obtain close graph cut values to the ones obtained by brute force. Experiments in two public datasets in the context of unsupervised network intrusion detection have showed the evolutionary optimization techniques can find suitable values for the neighborhood faster than the exhaustive search. Additionally, we have showed that it is not necessary to employ many agents for such task, since the neighborhood size is defined by discrete values, with constrain the set of possible solution to a few ones.
Resumo:
In order to refine the solution given by the classical logistic equation and extend its range of applications in the study of tumor dynamics, we propose and solve a generalization of this equation, using the so-called Fractional Calculus, i.e., we replace the ordinary derivative of order 1, in one version of the usual equation, by a non-integer derivative of order 0 < α < 1, and recover the classical solution as a particular case. Finally, we analyze the applicability of this model to describe the growth of cancer tumors.
Resumo:
The increase in new electronic devices had generated a considerable increase in obtaining spatial data information; hence these data are becoming more and more widely used. As well as for conventional data, spatial data need to be analyzed so interesting information can be retrieved from them. Therefore, data clustering techniques can be used to extract clusters of a set of spatial data. However, current approaches do not consider the implicit semantics that exist between a region and an object’s attributes. This paper presents an approach that enhances spatial data mining process, so they can use the semantic that exists within a region. A framework was developed, OntoSDM, which enables spatial data mining algorithms to communicate with ontologies in order to enhance the algorithm’s result. The experiments demonstrated a semantically improved result, generating more interesting clusters, therefore reducing manual analysis work of an expert.