Buscar
Mostrando ítems 1-10 de 1681
Fast unsupervised online drift detection using incremental Kolmogorov-Smirnov test
(Association for Computing Machinery - ACMSan Francisco, 2016-08)
Data stream research has grown rapidly over the last decade. Two major features distinguish data stream from batch learning: stream data are generated on the
y, possibly in a fast and variable rate; and the underlying ...
Classifying speech sonority functional data using a projected Kolmogorov-Smirnov approach
(Routledge Journals, Taylor & Francis LtdAbingdonInglaterra, 2007)
Um método de detecção de outliers para encontrar fraudes na cota para exercício da atividade parlamentarAn outlier detection method to search for fraud in the quota for parliamentary activity
(Universidade Federal do Rio Grande do NorteBrasilUFRNEstatística, 2020)
Suposição de normalidade e gestão de risco: uma aplicação do var paramétrico via teste de aderência
(2014)
Given the weaknesses of the parametric VaR (Value-at-Risk) calculated by normality assumptions, this paper develops a method of parametric VaR calculation considering ten different probability distributions. Specifically, ...
Pruebas de bondad de ajuste en distribuciones simétricas, ¿qué estadístico utilizar?
El uso de pruebas no paramétricas resulta recomendable cuando los datos a analizar no cumplen los supuestos de normalidad y homocedasticidad. Sin embargo, la suposición de la normalidad de los datos o el empleo de pruebas ...
Limites de precaução e controle em análises de tecidos vegetais de espécies florestais
(Universidade Federal de Santa MariaBRRecursos Florestais e Engenharia FlorestalUFSMPrograma de Pós-Graduação em Engenharia Florestal, 2006-06-23)
The present work has objective to define wich is the distribution of probability that analysis of nutritional contents are adjusted, selecting a function that better explain its behavior and to estimate the limits values ...
Limit theorems for sequences of random trees
(SPRINGER, 2009)
We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of ...