Linearna regresija je ena izmed bolj uporabljenih statisticnih metod, kar sledi iz dejstva, da se... more Linearna regresija je ena izmed bolj uporabljenih statisticnih metod, kar sledi iz dejstva, da se linearne modele lahko uporablja za veliko razlicnih problemov. V diplomski nalogi bo predstavljena vecrazsežna linearna regresija in veljavnost vecrazsežnega linearnega modela. Veljavnost modela lahko preverjamo z razlicnimi statisticnimi testi samega modela in njegovih koeficientov. Poleg teoreticnega opisa bo v diplomski nalogi predstavljen primer uporabe vecrazsežne linearne regresije. Na primeru "hydrostatic-season-time" modela, ki se uporablja za zagotavljanje varnosti na jezovih, bomo predstavili postopke izbire vplivnih spremenljivk, njihovo statisticno ocenjevanje in oceno veljavnosti modela. Postopek izbire napovednih spremljivk je lahko precej zahteven in ne podaja enolicno resitev. Zato je potrebno v postopku izbire statisticno vplivnih napovednih spremljivk in izbire optimalnega modela vedno opraviti vec testov in opazovati razlicne parametre.
MATCH Communications in Mathematical and in Computer Chemistry
Let G be a graph and let mi,j(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G), du(G... more Let G be a graph and let mi,j(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G), du(G)} = {i, j}. The M-polynomial of G is M (G; x, y) = i≤j mi,j(G)x i y j. A general method for calculating the M-polynomials for arbitrary graph families is presented. The method is further developed for the case where the vertices of a graph have degrees 2 and p, where p ≥ 3, and further for such planar graphs. The method is illustrated on families of chemical graphs.
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the... more The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of k-uniform partial cube-hypergraphs. The method is applied to cube-hypergraphs and hypertrees. Extensions of the method to hypergraphs arising in chemistry which are not necessary k-uniform and/or not necessary linear are also developed.
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the... more The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of k-uniform partial cube-hypergraphs. The method is applied to cube-hypergraphs and hypertrees. Extensions of the method to hypergraphs arising in chemistry which are not necessary k-uniform and/or not necessary linear are also developed.
Linearna regresija je ena izmed bolj uporabljenih statisticnih metod, kar sledi iz dejstva, da se... more Linearna regresija je ena izmed bolj uporabljenih statisticnih metod, kar sledi iz dejstva, da se linearne modele lahko uporablja za veliko razlicnih problemov. V diplomski nalogi bo predstavljena vecrazsežna linearna regresija in veljavnost vecrazsežnega linearnega modela. Veljavnost modela lahko preverjamo z razlicnimi statisticnimi testi samega modela in njegovih koeficientov. Poleg teoreticnega opisa bo v diplomski nalogi predstavljen primer uporabe vecrazsežne linearne regresije. Na primeru "hydrostatic-season-time" modela, ki se uporablja za zagotavljanje varnosti na jezovih, bomo predstavili postopke izbire vplivnih spremenljivk, njihovo statisticno ocenjevanje in oceno veljavnosti modela. Postopek izbire napovednih spremljivk je lahko precej zahteven in ne podaja enolicno resitev. Zato je potrebno v postopku izbire statisticno vplivnih napovednih spremljivk in izbire optimalnega modela vedno opraviti vec testov in opazovati razlicne parametre.
MATCH Communications in Mathematical and in Computer Chemistry
Let G be a graph and let mi,j(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G), du(G... more Let G be a graph and let mi,j(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G), du(G)} = {i, j}. The M-polynomial of G is M (G; x, y) = i≤j mi,j(G)x i y j. A general method for calculating the M-polynomials for arbitrary graph families is presented. The method is further developed for the case where the vertices of a graph have degrees 2 and p, where p ≥ 3, and further for such planar graphs. The method is illustrated on families of chemical graphs.
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the... more The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of k-uniform partial cube-hypergraphs. The method is applied to cube-hypergraphs and hypertrees. Extensions of the method to hypergraphs arising in chemistry which are not necessary k-uniform and/or not necessary linear are also developed.
The cut method has been proved to be extremely useful in chemical graph theory. In this paper the... more The cut method has been proved to be extremely useful in chemical graph theory. In this paper the cut method is extended to hypergraphs. More precisely, the method is developed for the Wiener index of k-uniform partial cube-hypergraphs. The method is applied to cube-hypergraphs and hypertrees. Extensions of the method to hypergraphs arising in chemistry which are not necessary k-uniform and/or not necessary linear are also developed.
Uploads
Papers by Gasper Romih