全文获取类型
收费全文 | 168篇 |
免费 | 0篇 |
专业分类
管理学 | 44篇 |
民族学 | 2篇 |
人口学 | 15篇 |
理论方法论 | 10篇 |
社会学 | 36篇 |
统计学 | 61篇 |
出版年
2024年 | 2篇 |
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 7篇 |
2020年 | 6篇 |
2019年 | 17篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 21篇 |
2013年 | 18篇 |
2012年 | 8篇 |
2011年 | 5篇 |
2010年 | 7篇 |
2009年 | 8篇 |
2008年 | 4篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 1篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有168条查询结果,搜索用时 15 毫秒
81.
Alireza Faraz Giovanni Celano Erwin Saniga C. Heuchenne S. Fichera 《Statistical Papers》2014,55(4):933-950
The Hotelling’s \(\textit{T}^{2 }\) control chart with variable parameters (VP \(T^{2})\) has been shown to have better statistical performance than other adaptive control schemes in detecting small to moderate process mean shifts. In this paper, we investigate the statistical performance of the VP \(T^{2}\) control chart coupled with run rules. We consider two well-known run rules schemes. Statistical performance is evaluated by using a Markov chain modeling the random shock mechanism of the monitored process. The in-control time interval of the process is assumed to follow an exponential distribution. A genetic algorithm has been designed to select the optimal chart design parameters. We provide an extensive numerical analysis indicating that the VP \(T^{2}\) control chart with run rules outperforms other charts for small sizes of the mean shift expressed through the Mahalanobis distance. 相似文献
82.
Francesco Gullo Giovanni Ponti Andrea Tagarelli 《Statistical Analysis and Data Mining》2013,6(2):116-135
In recent years, there has been a growing interest in clustering uncertain objects. In contrast to traditional, ‘sharp’ data representation models, uncertain objects are modeled as probability distributions defined over uncertainty regions. In this context, a major issue is related to the poor efficiency of existing algorithms, which is mainly due to expensive computation of the distance between uncertain objects. In this work, we extend our earlier work in which a novel formulation to the problem of clustering uncertain objects is defined based on the minimization of the variance of the mixture models that represent the clusters being discovered. Analytical properties about the computation of variance for cluster mixture models are derived and exploited by a partitional clustering algorithm, called MMVar. This algorithm achieves high efficiency since it does not need to employ any distance measure between uncertain objects. Experiments have shown that MMVar is scalable and outperforms state‐of‐the‐art algorithms in terms of efficiency, while achieving better average performance in terms of accuracy. © 2012 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 6: 116–135, 2013 相似文献
83.
Giovanni Sansavini 《Risk analysis》2011,31(8):1196-1210
In this work, specific indicators are used to characterize the criticality of components in a network system with respect to their contribution to failure cascade processes. A realistic‐size network is considered as reference case study. Three different models of cascading failures are analyzed, differing both on the failure load distribution logic and on the cascade triggering event. The criticality indicators are compared to classical measures of topological centrality to identify the one most characteristic of the cascade processes considered. 相似文献
84.
Data streams arise in several domains. For instance, in computational finance, several statistical applications revolve around the real‐time discovery of associations between a very large number of co‐evolving data feeds representing asset prices. The problem we tackle in this paper consists of learning a linear regression function from multivariate input and output streaming data in an incremental fashion while also performing dimensionality reduction and variable selection. When input and output streams are high‐dimensional and correlated, it is plausible to assume the existence of hidden factors that explain a large proportion of the covariance between them. The methods we propose build on recursive partial least squares (PLS) regression. The hidden factors are dynamically inferred and tracked over time and, within each factor, the most important streams are recursively identified by means of sparse matrix decompositions. Moreover, the recursive regression model is able to adapt to sudden changes in the data generating mechanism and also identifies the number of latent factors. Extensive simulation results illustrate how the methods perform and compare with alternative penalized regression models for streaming data. We also apply the algorithm to solve a multivariate version of the enhanced index tracking problem in computational finance. Copyright © 2010 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 3: 170‐193, 2010 相似文献
85.
Stricter laws require more incisive and costlier enforcement. Because enforcement activity depends both on available tax revenue and the honesty of officials, the optimal legal standard of a benevolent government is increasing in per capita income and decreasing in officials' corruption. In contrast to the “tollbooth view” of regulation, the standard chosen by a self‐interested government is a non‐monotonic function of officials' corruption, and can be either lower or higher than that chosen by a benevolent regulator. International evidence on environmental regulation shows that standards correlate positively with per‐capita income, and negatively with corruption, consistent with the model's predictions for benevolent governments. (JEL: D73, K42, L51) 相似文献
86.
Many modern data mining applications are concerned with the analysis of datasets in which the observations are described by paired high‐dimensional vectorial representations or ‘views’. Some typical examples can be found in web mining and genomics applications. In this article we present an algorithm for data clustering with multiple views, multi‐view predictive partitioning (MVPP), which relies on a novel criterion of predictive similarity between data points. We assume that, within each cluster, the dependence between multivariate views can be modeled by using a two‐block partial least squares (TB‐PLS) regression model, which performs dimensionality reduction and is particularly suitable for high‐dimensional settings. The proposed MVPP algorithm partitions the data such that the within‐cluster predictive ability between views is maximized. The proposed objective function depends on a measure of predictive influence of points under the TB‐PLS model which has been derived as an extension of the predicted residual sums of squares (PRESS) statistic commonly used in ordinary least squares regression. Using simulated data, we compare the performance of MVPP to that of competing multi‐view clustering methods which rely upon geometric structures of points, but ignore the predictive relationship between the two views. State‐of‐art results are obtained on benchmark web mining datasets. © 2012 Wiley Periodicals, Inc. Statistical Analysis and Data Mining, 2012 相似文献
87.
In several modern applications, ranging from genomics to neuroimaging, there is a need to compare measurements across different populations, such as those collected from samples of healthy and diseased individuals. The interest is in detecting a group effect, and typically many thousands or even millions of tests need to be performed simultaneously, as exemplified in genomics where single tests are applied for each gene across the genome. Traditional procedures, such as multivariate analysis of variance (MANOVA), are not suitable when dealing with nonvector‐valued data structures such as functional or graph‐structured observations. In this article, we discuss an existing distance‐based MANOVA‐like approach, the distance‐based F (DBF) test, for detecting such differences. The null sampling distribution of the DBF test statistic relies on the distribution of the measurements and the chosen distance measure, and is generally unavailable in closed form. In practice, Monte Carlo permutation methods are deployed which introduce errors in estimating small p‐values and increase familywise type I error rates when not using enough permutations. In this work, we propose an approximate distribution for the DBF test allowing inferences to be drawn without the need for costly permutations. This is achieved by approximating the permutation distribution that would be obtained by enumerating all permutations by the Pearson type III distribution using moment matching. The use of the Pearson type III distribution is motivated via empirical observations with real data. We provide evidence with real and simulated data that the resulting approximate null distribution of the DBF test is flexible enough to work well with a range of distance measures. Through extensive simulations involving different data types and distance measures, we provide evidence that the proposed methodology yields the same statistical power that would otherwise only be achievable if many millions of Monte Carlo permutations were performed. 相似文献
88.
Julian di Giovanni Andrei A. Levchenko Isabelle Mejean 《Econometrica : journal of the Econometric Society》2014,82(4):1303-1340
This paper uses a data base covering the universe of French firms for the period 1990–2007 to provide a forensic account of the role of individual firms in generating aggregate fluctuations. We set up a simple multisector model of heterogeneous firms selling to multiple markets to motivate a theoretically founded decomposition of firms' annual sales growth rate into different components. We find that the firm‐specific component contributes substantially to aggregate sales volatility, mattering about as much as the components capturing shocks that are common across firms within a sector or country. We then decompose the firm‐specific component to provide evidence on two mechanisms that generate aggregate fluctuations from microeconomic shocks highlighted in the recent literature: (i) when the firm size distribution is fat‐tailed, idiosyncratic shocks to large firms directly contribute to aggregate fluctuations, and (ii) aggregate fluctuations can arise from idiosyncratic shocks due to input–output linkages across the economy. Firm linkages are approximately three times as important as the direct effect of firm shocks in driving aggregate fluctuations. 相似文献
89.
Abstract. The paper tests predictions of a traditional intra‐household bargaining model which, under reasonable assumptions, shows that lack of bargaining power in the value chain significantly reduces the capacity for obtaining benefits from increased product demand arising from trade liberalization and therefore is positively associated with child labour. Cross‐sectional and panel negative binomial estimates in a sample of emerging countries support this hypothesis. They show that proxies of domestic workers’ bargaining power in the international division of labour (such as the share of primary product exports) are significantly related to child labour, net of the effect of traditional controls such as parental income, quality of education, international aid, and trade liberalization. The positive impact of the share of primary product exports on child labour outlines a potential paradox. The paradox suggests that trade liberalization does not always have straightforward positive effects on social indicators and that its short‐run effects on income distribution and distribution of skills and market power across countries need to be carefully evaluated. 相似文献
90.
The flower at a point x in a Steiner triple system
is the set of all triples containing x. Denote by IR*[r] the set of all integers k such that there exists a pair of KTS(2r+1) having k+r triples in common, r of them being the triples of a common flower. In this article we determine the set IR*[r] for any positive integer r≡1 (mod 3) (only nine cases are left undecided for r=7,13,16,19), and establish that IR*[r]=J[r] for r≡1 (mod 3) and r22 where J[r]={0,1,…,2r(r−1)/3−6,2r(r−1)/3−4,2r(r−1)/3}. 相似文献