全文获取类型
收费全文 | 2525篇 |
免费 | 75篇 |
国内免费 | 39篇 |
专业分类
管理学 | 463篇 |
民族学 | 1篇 |
人口学 | 2篇 |
丛书文集 | 37篇 |
理论方法论 | 8篇 |
综合类 | 846篇 |
社会学 | 19篇 |
统计学 | 1263篇 |
出版年
2024年 | 7篇 |
2023年 | 16篇 |
2022年 | 42篇 |
2021年 | 26篇 |
2020年 | 40篇 |
2019年 | 75篇 |
2018年 | 78篇 |
2017年 | 137篇 |
2016年 | 78篇 |
2015年 | 75篇 |
2014年 | 87篇 |
2013年 | 381篇 |
2012年 | 178篇 |
2011年 | 118篇 |
2010年 | 103篇 |
2009年 | 89篇 |
2008年 | 130篇 |
2007年 | 123篇 |
2006年 | 113篇 |
2005年 | 112篇 |
2004年 | 108篇 |
2003年 | 70篇 |
2002年 | 53篇 |
2001年 | 54篇 |
2000年 | 66篇 |
1999年 | 59篇 |
1998年 | 41篇 |
1997年 | 30篇 |
1996年 | 35篇 |
1995年 | 26篇 |
1994年 | 19篇 |
1993年 | 8篇 |
1992年 | 20篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 12篇 |
1988年 | 7篇 |
1987年 | 3篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
排序方式: 共有2639条查询结果,搜索用时 15 毫秒
71.
《Journal of Statistical Computation and Simulation》2012,82(18):3331-3353
In this paper, some new algorithms for estimating the biasing parameters of the ridge, Liu and two-parameter estimators are introduced with the help of genetic algorithm (GA). The proposed algorithms are based on minimizing some statistical measures such as mean square error (MSE), mean absolute error (MAE) and mean absolute prediction error (MAPE). At the same time, the new algorithms allow one to keep the condition number and variance inflation factors to be less than or equal to ten by means of the GA. A numerical example is presented to show the utility of the new algorithms. In addition, an extensive Monte Carlo experiment is conducted. The numerical findings prove that the proposed algorithms enable to eliminate the problem of multicollinearity and minimize the MSE, MAE and MAPE. 相似文献
72.
Nonparametric models with jump points have been considered by many researchers. However, most existing methods based on least squares or likelihood are sensitive when there are outliers or the error distribution is heavy tailed. In this article, a local piecewise-modal method is proposed to estimate the regression function with jump points in nonparametric models, and a piecewise-modal EM algorithm is introduced to estimate the proposed estimator. Under some regular conditions, the large-sample theory is established for the proposed estimators. Several simulations are presented to evaluate the performances of the proposed method, which shows that the proposed estimator is more efficient than the local piecewise-polynomial regression estimator in the presence of outliers or heavy tail error distribution. What is more, the proposed procedure is asymptotically equivalent to the local piecewise-polynomial regression estimator under the assumption that the error distribution is a Gaussian distribution. The proposed method is further illustrated via the sea-level pressures. 相似文献
73.
Parisa Zarrin Zahra Khodadai Reinaldo B. Arellano-Valle 《Journal of Statistical Computation and Simulation》2019,89(1):38-51
The standard location and scale unrestricted (or unified) skew-normal (SUN) family studied by Arellano-Valle and Genton [On fundamental skew distributions. J Multivar Anal. 2005;96:93–116] and Arellano-Valle and Azzalini [On the unification of families of skew-normal distributions. Scand J Stat. 2006;33:561–574], allows the modelling of data which is symmetrically or asymmetrically distributed. The family has a number of advantages suitable for the analysis of stochastic processes such as Auto-Regressive Moving-Average (ARMA) models, including being closed under linear combinations, being able to satisfy the consistency condition of Kolmogorov’s theorem and providing the guarantee of the existence of such a SUN stochastic process. The family is able to be represented in a hierarchical form which can be used for the ease of simulation. In addition, it facilitates an EM-type algorithm to estimate the model parameters. The performances and suitability of the proposed model are demonstrated on simulations and using two real data sets in applications. 相似文献
74.
在分析铁路货运量预测方法的基础上,针对标准BP神经网络的不足,提出改进的BP神经网络预测模型。首先,利用动态陡度因子来改变激励函数的陡峭程度,以此来得到更好的激励函数响应特征以及更好的非线性表达能力;其次,利用附加动量因子,通过对以前经验的积累,既降低了神经网络对误差曲面的局部细节敏感特性,又较好的遏制了神经网络易于限于局部最小的缺陷;最后,采取改变学习率的方法,给定一个较大的学习率初始值,在学习的过程中学习率不断减小,网络最终趋于稳定。改进BP算法既可以得到更优的解,还能够缩短训练时间。利用全国铁路货运 相似文献
75.
Data sets with excess zeroes are frequently analyzed in many disciplines. A common framework used to analyze such data is the zero-inflated (ZI) regression model. It mixes a degenerate distribution with point mass at zero with a non-degenerate distribution. The estimates from ZI models quantify the effects of covariates on the means of latent random variables, which are often not the quantities of primary interest. Recently, marginal zero-inflated Poisson (MZIP; Long et al. [A marginalized zero-inflated Poisson regression model with overall exposure effects. Stat. Med. 33 (2014), pp. 5151–5165]) and negative binomial (MZINB; Preisser et al., 2016) models have been introduced that model the mean response directly. These models yield covariate effects that have simple interpretations that are, for many applications, more appealing than those available from ZI regression. This paper outlines a general framework for marginal zero-inflated models where the latent distribution is a member of the exponential dispersion family, focusing on common distributions for count data. In particular, our discussion includes the marginal zero-inflated binomial (MZIB) model, which has not been discussed previously. The details of maximum likelihood estimation via the EM algorithm are presented and the properties of the estimators as well as Wald and likelihood ratio-based inference are examined via simulation. Two examples presented illustrate the advantages of MZIP, MZINB, and MZIB models for practical data analysis. 相似文献
76.
Aylin Göçoğlu 《Journal of Statistical Computation and Simulation》2019,89(14):2694-2710
In this paper, proportion estimators and associated variance estimators are proposed for a binary variable with a concomitant variable based on modified ranked set sampling methods, which are extreme ranked set sampling (ERSS), median ranked set sampling (MRSS), percentile ranked set sampling (Per-RSS) and L ranked set sampling (LRSS) methods. The Monte Carlo simulation study is performed to compare the performance of the estimators based on bias, mean squared error, and relative efficiency for different levels of correlation coefficient, set and cycle sizes under normal and log-normal distributions. Moreover, the study is supported with real data application. 相似文献
77.
In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data. 相似文献
78.
In this article, to reduce computational load in performing Bayesian variable selection, we used a variant of reversible jump Markov chain Monte Carlo methods, and the Holmes and Held (HH) algorithm, to sample model index variables in logistic mixed models involving a large number of explanatory variables. Furthermore, we proposed a simple proposal distribution for model index variables, and used a simulation study and real example to compare the performance of the HH algorithm with our proposed and existing proposal distributions. The results show that the HH algorithm with our proposed proposal distribution is a computationally efficient and reliable selection method. 相似文献
79.
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. 相似文献
80.
AbstractRecently, the study of the lifetime of systems in reliability and survival analysis in the presence of several causes of failure (competing risks) has attracted attention in the literature. In this paper, series and parallel systems with exponential lifetime for each item of the system are considered. Several causes of failure independently affect lifetime distributions and observations of failure times of the systems are considered under progressive Type-II censored scheme. For series systems, the maximum likelihood estimates of parameters are computed and confidence intervals for parameters of the model are obtained using Fisher information matrix. For parallel systems, the generalized EM algorithm which uses the Newton-Raphson algorithm inside the EM algorithm is used to compute the maximum likelihood estimates of parameters. Also, the standard errors of the maximum likelihood estimates are computed by using the supplemented EM algorithm. The simulation study confirms the good performance of the introduced approach. 相似文献