全文获取类型
收费全文 | 671篇 |
免费 | 5篇 |
国内免费 | 1篇 |
专业分类
管理学 | 44篇 |
民族学 | 2篇 |
人口学 | 4篇 |
丛书文集 | 22篇 |
理论方法论 | 19篇 |
综合类 | 187篇 |
社会学 | 4篇 |
统计学 | 395篇 |
出版年
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 6篇 |
2019年 | 19篇 |
2018年 | 30篇 |
2017年 | 41篇 |
2016年 | 9篇 |
2015年 | 6篇 |
2014年 | 23篇 |
2013年 | 157篇 |
2012年 | 29篇 |
2011年 | 21篇 |
2010年 | 25篇 |
2009年 | 21篇 |
2008年 | 25篇 |
2007年 | 19篇 |
2006年 | 19篇 |
2005年 | 16篇 |
2004年 | 22篇 |
2003年 | 11篇 |
2002年 | 17篇 |
2001年 | 20篇 |
2000年 | 18篇 |
1999年 | 19篇 |
1998年 | 11篇 |
1997年 | 13篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有677条查询结果,搜索用时 15 毫秒
31.
David G. T. Denison 《Statistics and Computing》2001,11(2):171-178
Boosting is a new, powerful method for classification. It is an iterative procedure which successively classifies a weighted version of the sample, and then reweights this sample dependent on how successful the classification was. In this paper we review some of the commonly used methods for performing boosting and show how they can be fit into a Bayesian setup at each iteration of the algorithm. We demonstrate how this formulation gives rise to a new splitting criterion when using a domain-partitioning classification method such as a decision tree. Further we can improve the predictive performance of simple decision trees, known as stumps, by using a posterior weighted average of them to classify at each step of the algorithm, rather than just a single stump. The main advantage of this approach is to reduce the number of boosting iterations required to produce a good classifier with only a minimal increase in the computational complexity of the algorithm. 相似文献
32.
局部凸拓扑空间上的广义拟变分不等式 总被引:1,自引:0,他引:1
王建国 《电子科技大学学报(社会科学版)》1989,(2)
本文讨论了局部凸拓扑空间上的一类广义拟变分不等式问题。在适当的单调和连续性条件下,利用KKM定理和多值映射的不动点定理作为工具,得到了一个广义拟变分不等式解的存在性定理。所得结论是文献[1]的结果的改进。 相似文献
33.
Christopher Field 《Revue canadienne de statistique》1985,13(3):201-210
The approach to normality of an estimate is displayed graphically by the nonlinearity in the derivative of the log density, and this nonlinearity is related to the accuracy of the normal approximation for the tail area. Using techniques from small-sample asymptotics, an alternate proof of the central limit theorem is given and same indices of tail behavior are examined. 相似文献
34.
苏万春 《电子科技大学学报(社会科学版)》2001,(2)
从引力场是矢量场出发,讨论了引力场的性质,引入了描述引力场的高斯定理和环路定理,得出了相应的微分和积分形式。根据引力场的两个定理,导出了引力势的微分和积分形式。 相似文献
35.
D. Firth & J. P. Hinde 《Journal of the Royal Statistical Society. Series B, Statistical methodology》1997,59(4):793-797
The concavity of some Bayesian D -optimality criteria is investigated and is found in some cases to depend on the prior distribution. In the case of a non-concave criterion, the standard equivalence theorem may fail, but a local version continues to apply. 相似文献
36.
Oliver D. Anderson 《Revue canadienne de statistique》1990,18(3):271-284
Cumulants, moments about zero, and central moments are obtained for the mean-corrected serial covariances and serial correlations for series realizations of length n from a white-noise Gaussian process. All first and second moments (and some third, fourth, and higher moments) are given explicitly for the serial covariances; and the corresponding moments for the serial correlations are derived either explicitly or implicitly. 相似文献
37.
Bernstein polynomials have many interesting properties. In statistics, they were mainly used to estimate density functions and regression relationships. The main objective of this paper is to promote further use of Bernstein polynomials in statistics. This includes (1) providing a high-level approximation of the moments of a continuous function of a random variable , and (2) proving Jensen’s inequality concerning a convex function without requiring second differentiability of the function. The approximation in (1) is demonstrated to be quite superior to the delta method, which is used to approximate the variance of with the added assumption of differentiability of the function. Two numerical examples are given to illustrate the application of the proposed methodology in (1). 相似文献
38.
HISASHI INABA 《Mathematical Population Studies》2014,21(2):95-111
A pandemic threshold theorem of the Kermack–McKendrick epidemic system with individual heterogeneity is proved from the definition of R 0 by Diekmann, Heesterbeek, and Metz. The early Kermack–McKendrick epidemic model is extended to recognize individual heterogeneity, where the state variable indicates an epidemiological state or genetic, physiological, or behavioral characteristics such as risk of infection. With the basic reproduction number R 0 for the heterogeneous population, the final size equation of the limit epidemic starting from a completely susceptible steady state at t = ?∞ has a unique positive solution if and only if R 0 > 1. The main result is that the positive solution of the final size equation gives the lower bound of the intensity of any epidemic starting from a host population composed of susceptible and a few infected individuals who spread on a noncompact domain of the trait variable. 相似文献
39.
本文在研究Directly-Riemann积分~[1,2]的基础上,得到了Directly—Riemann积分的中值定理。 相似文献
40.
Shwetank Lall Seema Jaggi Cini Varghese Arpan Bhowmik 《Journal of Statistical Computation and Simulation》2018,88(6):1191-1199
In this paper, locally D-optimal saturated designs for a logistic model with one and two continuous input variables have been constructed by modifying the famous Fedorov exchange algorithm. A saturated design not only ensures the minimum number of runs in the design but also simplifies the row exchange computation. The basic idea is to exchange a design point with a point from the design space. The algorithm performs the best row exchange between design points and points form a candidate set representing the design space. Naturally, the resultant designs depend on the candidate set. For gain in precision, intuitively a candidate set with a larger number of points and the low discrepancy is desirable, but it increases the computational cost. Apart from the modification in row exchange computation, we propose implementing the algorithm in two stages. Initially, construct a design with a candidate set of affordable size and then later generate a new candidate set around the points of design searched in the former stage. In order to validate the optimality of constructed designs, we have used the general equivalence theorem. Algorithms for the construction of optimal designs have been implemented by developing suitable codes in R. 相似文献