首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5099篇
  免费   81篇
  国内免费   14篇
管理学   188篇
民族学   14篇
人才学   1篇
人口学   41篇
丛书文集   133篇
理论方法论   59篇
综合类   719篇
社会学   94篇
统计学   3945篇
  2023年   21篇
  2022年   19篇
  2021年   43篇
  2020年   86篇
  2019年   148篇
  2018年   182篇
  2017年   317篇
  2016年   143篇
  2015年   146篇
  2014年   184篇
  2013年   1486篇
  2012年   381篇
  2011年   192篇
  2010年   157篇
  2009年   161篇
  2008年   169篇
  2007年   145篇
  2006年   123篇
  2005年   128篇
  2004年   109篇
  2003年   94篇
  2002年   120篇
  2001年   83篇
  2000年   76篇
  1999年   72篇
  1998年   73篇
  1997年   52篇
  1996年   34篇
  1995年   36篇
  1994年   27篇
  1993年   22篇
  1992年   23篇
  1991年   17篇
  1990年   17篇
  1989年   11篇
  1988年   13篇
  1987年   9篇
  1986年   5篇
  1985年   14篇
  1984年   13篇
  1983年   16篇
  1982年   5篇
  1981年   2篇
  1980年   4篇
  1979年   6篇
  1978年   2篇
  1977年   2篇
  1976年   2篇
  1975年   2篇
  1973年   1篇
排序方式: 共有5194条查询结果,搜索用时 15 毫秒
51.
In regression, detecting anomalous observations is a significant step for model-building process. Various influence measures based on different motivational arguments are designed to measure the influence of observations through different aspects of various regression models. The presence of influential observations in the data is complicated by the existence of multicollinearity. The purpose of this paper is to assess the influence of observations in the Liu [9] and modified Liu [15] estimators by using the method of approximate case deletion formulas suggested by Walker and Birch [14]. A numerical example using a real data set used by Longley [10] and a Monte Carlo simulation are given to illustrate the theoretical results.  相似文献   
52.
Spectral clustering uses eigenvectors of the Laplacian of the similarity matrix. It is convenient to solve binary clustering problems. When applied to multi-way clustering, either the binary spectral clustering is recursively applied or an embedding to spectral space is done and some other methods, such as K-means clustering, are used to cluster the points. Here we propose and study a K-way clustering algorithm – spectral modular transformation, based on the fact that the graph Laplacian has an equivalent representation, which has a diagonal modular structure. The method first transforms the original similarity matrix into a new one, which is nearly disconnected and reveals a cluster structure clearly, then we apply linearized cluster assignment algorithm to split the clusters. In this way, we can find some samples for each cluster recursively using the divide and conquer method. To get the overall clustering results, we apply the cluster assignment obtained in the previous step as the initialization of multiplicative update method for spectral clustering. Examples show that our method outperforms spectral clustering using other initializations.  相似文献   
53.
54.
A fast and accurate method of confidence interval construction for the smoothing parameter in penalised spline and partially linear models is proposed. The method is akin to a parametric percentile bootstrap where Monte Carlo simulation is replaced by saddlepoint approximation, and can therefore be viewed as an approximate bootstrap. It is applicable in a quite general setting, requiring only that the underlying estimator be the root of an estimating equation that is a quadratic form in normal random variables. This is the case under a variety of optimality criteria such as those commonly denoted by maximum likelihood (ML), restricted ML (REML), generalized cross validation (GCV) and Akaike's information criteria (AIC). Simulation studies reveal that under the ML and REML criteria, the method delivers a near‐exact performance with computational speeds that are an order of magnitude faster than existing exact methods, and two orders of magnitude faster than a classical bootstrap. Perhaps most importantly, the proposed method also offers a computationally feasible alternative when no known exact or asymptotic methods exist, e.g. GCV and AIC. An application is illustrated by applying the methodology to well‐known fossil data. Giving a range of plausible smoothed values in this instance can help answer questions about the statistical significance of apparent features in the data.  相似文献   
55.
Traffic flow data are routinely collected for many networks worldwide. These invariably large data sets can be used as part of a traffic management system, for which good traffic flow forecasting models are crucial. The linear multiregression dynamic model (LMDM) has been shown to be promising for forecasting flows, accommodating multivariate flow time series, while being a computationally simple model to use. While statistical flow forecasting models usually base their forecasts on flow data alone, data for other traffic variables are also routinely collected. This paper shows how cubic splines can be used to incorporate extra variables into the LMDM in order to enhance flow forecasts. Cubic splines are also introduced into the LMDM to parsimoniously accommodate the daily cycle exhibited by traffic flows. The proposed methodology allows the LMDM to provide more accurate forecasts when forecasting flows in a real high‐dimensional traffic data set. The resulting extended LMDM can deal with some important traffic modelling issues not usually considered in flow forecasting models. Additionally, the model can be implemented in a real‐time environment, a crucial requirement for traffic management systems designed to support decisions and actions to alleviate congestion and keep traffic flowing.  相似文献   
56.
Abstract. This article presents a framework for comparing bivariate distributions according to their degree of regression dependence. We introduce the general concept of a regression dependence order (RDO). In addition, we define a new non‐parametric measure of regression dependence and study its properties. Besides being monotone in the new RDOs, the measure takes on its extreme values precisely at independence and almost sure functional dependence, respectively. A consistent non‐parametric estimator of the new measure is constructed and its asymptotic properties are investigated. Finally, the finite sample properties of the estimate are studied by means of a small simulation study.  相似文献   
57.
Abstract. We consider N independent stochastic processes (X i (t), t ∈ [0,T i ]), i=1,…, N, defined by a stochastic differential equation with drift term depending on a random variable φ i . The distribution of the random effect φ i depends on unknown parameters which are to be estimated from the continuous observation of the processes Xi. We give the expression of the exact likelihood. When the drift term depends linearly on the random effect φ i and φ i has Gaussian distribution, an explicit formula for the likelihood is obtained. We prove that the maximum likelihood estimator is consistent and asymptotically Gaussian, when T i =T for all i and N tends to infinity. We discuss the case of discrete observations. Estimators are computed on simulated data for several models and show good performances even when the length time interval of observations is not very large.  相似文献   
58.
We introduce a class of random fields that can be understood as discrete versions of multicolour polygonal fields built on regular linear tessellations. We focus first on a subclass of consistent polygonal fields, for which we show Markovianity and solvability by means of a dynamic representation. This representation is used to design new sampling techniques for Gibbsian modifications of such fields, a class which covers lattice‐based random fields. A flux‐based modification is applied to the extraction of the field tracks network from a Synthetic Aperture Radar image of a rural area.  相似文献   
59.
The purpose of this note is to indicate that Fieller's Theorem can be expressed in the matrix formulation of the general linear model. The practical consequence is that one general computer program which can estimate the parameters and test the validity of a pertinent model, can also compute confidence limits for the ratios of any linear combinations of the parameters.  相似文献   
60.
We propose an efficient group sequential monitoring rule for clinical trials. At each interim analysis both efficacy and futility are evaluated through a specified loss structure together with the predicted power. The proposed design is robust to a wide range of priors, and achieves the specified power with a saving of sample size compared to existing adaptive designs. A method is also proposed to obtain a reduced-bias estimator of treatment difference for the proposed design. The new approaches hold great potential for efficiently selecting a more effective treatment in comparative trials. Operating characteristics are evaluated and compared with other group sequential designs in empirical studies. An example is provided to illustrate the application of the method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号