首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   116篇
  免费   6篇
管理学   25篇
人口学   10篇
丛书文集   1篇
理论方法论   12篇
社会学   55篇
统计学   19篇
  2022年   1篇
  2020年   1篇
  2019年   4篇
  2018年   2篇
  2017年   3篇
  2016年   1篇
  2015年   4篇
  2014年   2篇
  2013年   27篇
  2012年   4篇
  2011年   5篇
  2010年   4篇
  2009年   5篇
  2008年   5篇
  2007年   3篇
  2006年   6篇
  2005年   5篇
  2004年   7篇
  2003年   2篇
  2002年   4篇
  2001年   2篇
  2000年   2篇
  1999年   2篇
  1998年   1篇
  1997年   2篇
  1996年   2篇
  1995年   1篇
  1994年   1篇
  1992年   2篇
  1991年   1篇
  1990年   4篇
  1989年   2篇
  1988年   3篇
  1980年   1篇
  1977年   1篇
排序方式: 共有122条查询结果,搜索用时 62 毫秒
121.
This paper develops techniques for fitting a circular functional relationship. The model is formulated assuming the centre of the circle is known and taken to be the origin. This incurs some loss of generality, but considerably simplifies the analysis. Methods of estimating the parameters of the relationship, assuming that the co-ordinates have uncorrelated errors with equal variance, are developed and compared by way of simulations. Consistent estimators are obtained from unbiased estimating equations and by maximising the marginal likelihood. Approximate estimators are obtained by approximating the estimating equations and by maximising a modified profile likelihood function. The ideas and methodology are then applied to the relationship with the more realistic assumption of an unknown centre, with an example highlighting the differences between estimation techniques.  相似文献   
122.
Classification of gene expression microarray data is important in the diagnosis of diseases such as cancer, but often the analysis of microarray data presents difficult challenges because the gene expression dimension is typically much larger than the sample size. Consequently, classification methods for microarray data often rely on regularization techniques to stabilize the classifier for improved classification performance. In particular, numerous regularization techniques, such as covariance-matrix regularization, are available, which, in practice, lead to a difficult choice of regularization methods. In this paper, we compare the classification performance of five covariance-matrix regularization methods applied to the linear discriminant function using two simulated high-dimensional data sets and five well-known, high-dimensional microarray data sets. In our simulation study, we found the minimum distance empirical Bayes method reported in Srivastava and Kubokawa [Comparison of discrimination methods for high dimensional data, J. Japan Statist. Soc. 37(1) (2007), pp. 123–134], and the new linear discriminant analysis reported in Thomaz, Kitani, and Gillies [A Maximum Uncertainty LDA-based approach for Limited Sample Size problems – with application to Face Recognition, J. Braz. Comput. Soc. 12(1) (2006), pp. 1–12], to perform consistently well and often outperform three other prominent regularization methods. Finally, we conclude with some recommendations for practitioners.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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