Displaying 321 – 340 of 349

Showing per page

Tratamiento de datos territorializados de vivienda en el inventario de capital residencial.

Ricardo Vergés Escuín (2001)

Qüestiió

Después de plantear la filosofía de la contabilidad de capital fijo, el artículo examina la metodología necesaria para levantar el inventario permanente residencial de cada territorio. Al nivel de flujos, se ordenan y comparan las distintas fuentes de datos sobre edificación que existen en España y se describe el tratamiento requerido por cada una de ellas. Al nivel de stocks, se propone un tratamiento de ajuste y de desglose territorial del parque de viviendas por fecha de construcción. También...

Tree and local computations in a cross–entropy minimization problem with marginal constraints

Francesco M. Malvestuto (2010)

Kybernetika

In probability theory, Bayesian statistics, artificial intelligence and database theory the minimum cross-entropy principle is often used to estimate a distribution with a given set P of marginal distributions under the proportionality assumption with respect to a given “prior” distribution q . Such an estimation problem admits a solution if and only if there exists an extension of P that is dominated by q . In this paper we consider the case that q is not given explicitly, but is specified as the...

Trimmed Estimators in Regression Framework

TomĂĄĹĄ Jurczyk (2011)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

From the practical point of view the regression analysis and its Least Squares method is clearly one of the most used techniques of statistics. Unfortunately, if there is some problem present in the data (for example contamination), classical methods are not longer suitable. A lot of methods have been proposed to overcome these problematic situations. In this contribution we focus on special kind of methods based on trimming. There exist several approaches which use trimming off part of the observations,...

Two algorithms based on Markov chains and their application to recognition of protein coding genes in prokaryotic genomes

Małgorzata Grabińska, Paweł Błażej, Paweł Mackiewicz (2013)

Applicationes Mathematicae

Methods based on the theory of Markov chains are most commonly used in the recognition of protein coding sequences. However, they require big learning sets to fill up all elements in transition probability matrices describing dependence between nucleotides in the analyzed sequences. Moreover, gene prediction is strongly influenced by the nucleotide bias measured by e.g. G+C content. In this paper we compare two methods: (i) the classical GeneMark algorithm, which uses a three-periodic non-homogeneous...

Two operations of merging and splitting components in a chain graph

Milan Studený, Alberto Roverato, Šárka Štěpánová (2009)

Kybernetika

In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...

Currently displaying 321 – 340 of 349