Zobrazeno 1 - 9
of 9
pro vyhledávání: '"M R, Brito"'
Publikováno v:
The Minerals, Metals & Materials Series ISBN: 9783031225758
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd23cda4b39fd1192136999e4ad4094a
https://doi.org/10.1007/978-3-031-22576-5_40
https://doi.org/10.1007/978-3-031-22576-5_40
Publikováno v:
Journal of Multivariate Analysis. 116:263-277
Three graph theoretical statistics are considered for the problem of estimating the intrinsic dimension of a data set. The first is the ''reach'' statistic, r@?"j","k, proposed in Brito et al. (2002) [4] for the problem of identification of Euclidean
Publikováno v:
Metrika. 76:161-177
The behaviour of the goodness-of-fit procedure for normality based on weighted integrals of the empirical characteristic function, discussed in the case of i.i.d. data, for instance, in Epps and Pulley (Biometrika 70:723–726, 1983), is considered h
Publikováno v:
Communications in Statistics - Theory and Methods. 36:1757-1767
By modifying the statistic of Malkovich and Afifi (1973), we introduce and study the properties of a notion of multivariate skewness that provides both a magnitude and an overall direction for the skewness present in multivariate data. This notion le
Autor:
Adolfo J. Quiroz, M. R. Brito
Publikováno v:
Communications in Statistics - Theory and Methods. 33:99-105
We discuss the application of linear combinations of the degree frequencies in the minimal spanning tree to the problem of identifying the appropriate dimension for a data set from its interpoint distance matrix. This graph-theoretical methodology, o
Publikováno v:
Journal of Multivariate Analysis. 81(1):67-84
We consider the problem of identifying the dimension in which a sample of data points lives, when only their interpoint distances are known. We study as a random variable the average “reach” of vertices in the k-nearest-neighbors graph associated
Publikováno v:
Statistics & Probability Letters. 35:33-42
For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is propo
Autor:
P R, Gauch, C, Halperin, S dos S, Galvão Filho, A A, de Paola, J C, Mateos, M, Martinelli Filho, R, Costa, J, Pimenta, P de T, Medeiros, M R, Brito, O T, Greco
Publikováno v:
Arquivos brasileiros de cardiologia. 68(2)
Publikováno v:
Scopus-Elsevier
We discuss the advantages of using estimators based on large order statistics of the runs of 0's and 1's in the estimation of the success probability associated with a sequence of independent Bernoulli trials, when this probability might be changing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60edd0591417d4216acd32338c7d4de6
http://www.scopus.com/inward/record.url?eid=2-s2.0-34548181847&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-34548181847&partnerID=MN8TOARS