For classical dynamical systems, the polynomial entropy serves as a refined invariant of topological entropy. In setting categorical that is, triangulated categories endowed with an endofunctor, we develop theory entropy, refining defined by Dimitrov-Haiden-Katzarkov-Kontsevich. We justify this notion showing for automorphism smooth projective variety, pullback functor on derived category coinc...

The new multiple-point geostatistical algorithm (FILTERSIM), which can handle both categorical and continuous variable training images, is implemented in the SGeMS software. The spatial patterns depicted by the training image are first summarized into a few filter scores; then classified into pattern groups in the filter score space. The sequential simulation approach proceeds by associating ea...

In this article, the performance of data mining and statistical techniques was empirically compared while varying the number of independent variables, the types of independent variables, the number of classes of the independent variables, and the sample size. Our study employed 60 simulated examples, with artificial neural networks and decision trees as the data mining techniques, and linear re...

Accurate prediction and explanation are fundamental objectives of statistical analysis, yet they seldom coincide. Boosted trees are a statistical learning method that attains both of these objectives for regression and classification analyses. They can deal with many types of response variables (numeric, categorical, and censored), loss functions (Gaussian, binomial, Poisson, and robust), and p...