Search results for " Distance"
showing 10 items of 696 documents
A gallery of Chua's Attractors - Part IV
2007
Recursive partitioning: an approach based on the weighted kemeny distance
2015
In the framework of preference rankings, the interest can lie in finding which predictors and which interactions are able to explain the observed preference structures. The possibility to derive consensus measures using a classification tree represents a novelty and an important tool, given its easy interpretability. This work proposes the use of a univariate decision tree for ranking data based on the weighted Kemeny distance. The performance of the methodology will be shown by using a real dataset about university rankings.
The Mediating Role of Job Satisfaction in the Relationship between Emotional Intelligence and Life Satisfaction among Teachers during the COVID-19 Pa…
2022
This study examines the indirect effect of job satisfaction on the relationship between emotional intelligence and life satisfaction among teachers during the second wave of the COVID-19 pandemic in Poland. A sample of 322 teachers aged 23–71 (M = 45.37, SD = 8.99) participated in a cross-sectional online survey. The online survey (Google form) contained some demographic information and standardized psychological questionnaires: the Multivariate Emotional Intelligence Scale (MEIS) for measuring emotional intelligence, the Minnesota Satisfaction Questionnaire (MSQ)—a short form for job satisfaction assessment, and the Life Satisfaction Scale (SWLS). Emotional intelligence is a significant po…
Distance Functions, Clustering Algorithms and Microarray Data Analysis
2010
Distance functions are a fundamental ingredient of classification and clustering procedures, and this holds true also in the particular case of microarray data. In the general data mining and classification literature, functions such as Euclidean distance or Pearson correlation have gained their status of de facto standards thanks to a considerable amount of experimental validation. For microarray data, the issue of which distance function works best has been investigated, but no final conclusion has been reached. The aim of this extended abstract is to shed further light on that issue. Indeed, we present an experimental study, involving several distances, assessing (a) their intrinsic sepa…
Genetic Improvement of Sweet Chestnut in Sicily (Castanea sativa Mill.) by the Selection of Superior Autochthonous Genotypes
2010
In Sicily, the chestnut (Castanea sativa Mill.) grows in limited areas of the South eastern Mt. Etna volcano and of the Northern Mountains, namely Madonie and Nebrodi. In the Island, chestnut can be considered as a neglected species, because of the modest importance recognized to it for horticultural and forestry exploitation. Recently, the Sicilian regional government founded the 'Horticultural Forestry' project to promote the cultivation of chestnut as possible fruit tree for local city farmer markets, where typical products are usually sold. The project was developed in five steps, carried out during three years by the Dipartimento di Colture Arboree of Palermo University: identification…
"Indexing structures for approximate string matching
2003
In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.
The simplex dispersion ordering and its application to the evaluation of human corneal endothelia
2009
A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…
Hausdorff dimension from the minimal spanning tree
1993
A technique to estimate the Hausdorff dimension of strange attractors, based on the minimal spanning tree of the point distribution is extensively tested in this work. This method takes into account in some sense the infimum requirement appearing in the definition of the Hausdorff dimension. It provides accurate estimates even for a low number of data points and it is especially suited to high-dimensional systems.
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
2011
It is known that the d-dimensional Steiner Minimum Tree Problem in Hamming metric is NP-complete if d is considered to be a part of the input. On the other hand, it was an open question whether the problem is also NP-complete in fixed dimensions. In this paper we answer this question by showing that the problem is NP-complete for any dimension strictly greater than 2. We also show that the Steiner ratio is 2 - 2/d for d ≥ 2. Using this result, we tailor the analysis of the so-called k-LCA approximation algorithm and show improved approximation guarantees for the special cases d = 3 and d = 4.