Search results for "generalization"
showing 10 items of 250 documents
A new indicator for higher education student performance
2014
The debate on academic achievement is a heated issue that involves all the higher education contexts. This paper attempts to provide an indicator that can make the measurement of university student performance easier and that can be easily applied to different systems, making comparisons more fair. The Italian University System is used as a starting point to make several considerations on the current measures and to build up a new performance indicator. Then, a generalization for other marking systems is shown and finally a quantile regression is performed to investigate some determinants of the new performance indicator, also with respect to the current one.
Transducers for the bidirectional decoding of prefix codes
2010
AbstractWe construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.
Structural Knowledge Extraction from Mobility Data
2016
Knowledge extraction has traditionally represented one of the most interesting challenges in AI; in recent years, however, the availability of large collections of data has increased the awareness that “measuring” does not seamlessly translate into “understanding”, and that more data does not entail more knowledge. We propose here a formulation of knowledge extraction in terms of Grammatical Inference (GI), an inductive process able to select the best grammar consistent with the samples. The aim is to let models emerge from data themselves, while inference is turned into a search problem in the space of consistent grammars, induced by samples, given proper generalization operators. We will …
An inductive learning perspective on automated generation of feature models from given product specifications
2018
For explicit representation of commonality and variability of a product line, a feature model is mostly used. An open question is how a feature model can be inductively learned in an automated way from a limited number of given product specifications in terms of features.We propose to address this problem through machine learning, more precisely inductive generalization from examples. However, no counter-examples are assumed to exist. Basically, a feature model needs to be complete with respect to all the given example specifications. First results indicate the feasibility of this approach, even for generating hierarchies, but many open challenges remain.
Extracting similar sub-graphs across PPI Networks
2009
Singling out conserved modules (corresponding to connected sub-graphs) throughout protein-protein interaction networks of different organisms is a main issue in bioinformatics because of its potential applications in biology. This paper presents a method to discover highly matching sub-graphs in such networks. Sub-graph extraction is carried out by taking into account, on the one side, both protein sequence and network structure similarities and, on the other side, both quantitative and reliability information possibly available about interactions. The method is conceived as a generalization of a known technique, able to discover functional orthologs in interaction networks. Some preliminar…
Reliability Generalization Meta-Analysis
2020
Un meta-análisis de generalización de confiabilidad (MA GF) es un método para integrar estadísticamente las estimaciones de fiabilidad obtenidas en diferentes aplicaciones de un test. El MA GF permite a los investigadores caracterizar la fiabilidad promedio de las puntuaciones obtenida en un test en múltiples estudios y situaciones y estimar el grado de variabilidad en los coeficientes de fiabilidad en diferentes tipos de medidas, muestras y contextos. Por lo tanto, sus resultados permiten ofrecer pautas a los investigadores y profesionales aplicados sobre qué escalas son más fiables para evaluar un constructo y en qué circunstancias. Así pues, los investigadores y profesionales necesitan s…
Probabilistic foundations of contextuality
2017
Contextuality is usually defined as absence of a joint distribution for a set of measurements (random variables) with known joint distributions of some of its subsets. However, if these subsets of measurements are not disjoint, contextuality is mathematically impossible even if one generally allows (as one must) for random variables not to be jointly distributed. To avoid contradictions one has to adopt the Contextuality-by-Default approach: measurements made in different contexts are always distinct and stochastically unrelated to each other. Contextuality is reformulated then in terms of the (im)possibility of imposing on all the measurements in a system a joint distribution of a particul…
A C1-generic dichotomy for diffeomorphisms: Weak forms of hyperbolicity or infinitely many sinks or sources
2003
We show that, for every compact n-dimensional manifold, n > 1, there is a residual subset of Diff (M) of diffeomorphisms for which the homoclinic class of any periodic saddle of f verifies one of the following two possibilities: Either it is contained in the closure of an infinite set of sinks or sources (Newhouse phenomenon), or it presents some weak form of hyperbolicity called dominated splitting (this is a generalization of a bidimensional result of Mafine [Ma3]). In particular, we show that any Cl-robustly transitive diffeomorphism admits a dominated splitting.