全文获取类型
收费全文 | 143篇 |
免费 | 8篇 |
国内免费 | 12篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 14篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 6篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 7篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 12篇 |
2004年 | 6篇 |
2003年 | 7篇 |
2002年 | 5篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有163条查询结果,搜索用时 15 毫秒
1.
A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined. 相似文献
2.
3.
4.
U-statistic hierarchical clustering 总被引:2,自引:0,他引:2
Roy G. D'Andrade 《Psychometrika》1978,43(1):59-67
A monotone invariant method of hierarchical clustering based on the Mann-Whitney U-statistic is presented. The effectiveness of the complete-link, single-link, and U-statistic methods in recovering tree structures from error perturbed data are evaluated. The U-statistic method is found to be consistently more effective in recovering the original tree structures than either the single-link or complete-link methods. 相似文献
5.
An examination of the effect of six types of error perturbation on fifteen clustering algorithms 总被引:21,自引:0,他引:21
An evaluation of several clustering methods was conducted. Artificial clusters which exhibited the properties of internal cohesion and external isolation were constructed. The true cluster structure was subsequently hidden by six types of error-perturbation. The results indicated that the hierarchical methods were differentially sensitive to the type of error perturbation. In addition, generally poor recovery performance was obtained when random seed points were used to start theK-means algorithms. However, two alternative starting procedures for the nonhierarchical methods produced greatly enhanced cluster recovery and were found to be robust with respect to all of the types of error examined. 相似文献
6.
Indclus: An individual differences generalization of the adclus model and the mapclus algorithm 总被引:4,自引:0,他引:4
We present a new model and associated algorithm, INDCLUS, that generalizes the Shepard-Arabie ADCLUS (ADditive CLUStering) model and the MAPCLUS algorithm, so as to represent in a clustering solution individual differences among subjects or other sources of data. Like MAPCLUS, the INDCLUS generalization utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach to impose discrete (0,1) constraints on parameters defining cluster membership. All subjects in an INDCLUS analysis are assumed to have a common set of clusters, which are differentially weighted by subjects in order to portray individual differences. As such, INDCLUS provides a (discrete) clustering counterpart to the Carroll-Chang INDSCAL model for (continuous) spatial representations. Finally, we consider possible generalizations of the INDCLUS model and algorithm.We are indebted to Seymour Rosenberg for making available the data from Rosenberg and Kim [1975]. Also, this work has benefited from the observations of S. A. Boorman, W. S. DeSarbo, G. Furnas, P. E. Green, L. J. Hubert, L. E. Jones, J. B. Kruskal, S. Pruzansky, D. Schmittlein, E. J. Shoben, S. D. Soli, and anonymous referees.This research was supported in part by NSF Grant SES82 00441, LEAA Grant 78-NI-AX-0142, and NSF Grant SES80 04815. 相似文献
7.
Wayne S. Desarbo 《Psychometrika》1982,47(4):449-475
A general class of nonhierarchical clustering models and associated algorithms for fitting them are presented. These (metric) clustering models generalize the Shepard-Arabie Additive Clusters model in allowing for: (1). either overlapping or nonoverlapping clusters; (2). either symmetric (one-way clustering) or nonsymmetric (two-way clustering) proximities (input data); and, (3). either symmetric or diagonal weights. The GENNCLUS algorithms utilize alternating least-squares methods combining ordinary and constrained least-squares, nonlinear constrained mathematical programming, and combinatorial optimization techniques in estimating model parameters. In addition to developing the mathematical bases of these models, a comprehensive set of Monte Carlo simulations of the different models is reported. Two applications concerning brand-switching data and celebrity-brand proximities are discussed. Finally, extensions to three-way models, nonmetric analyses, and other model specifications are provided.Wayne S. DeSarbo is a Member of Technical Staff in the Mathematics and Statistics Research Center at Bell Laboratories in Murray Hill, N.J. I wish to thank R. Gnanadesikan, J. D. Carroll, and P. Arabie for their comments on a previous draft of this paper. I also wish to acknowledge the computer assistance provided by Linda Clark. Finally, I wish to thank the reviewers and editor for their very complete reviews and comments. 相似文献
8.
We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy logics, we show how the idea of rational change from “crisp” base revision, as embodied by the idea of partial meet (base) revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy base revision and illustrate how the operation works in several important special instances of the framework. We also axiomatise the related operation of partial meet fuzzy base contraction.This paper is an extended version of a paper presented at the Nineteenth Conference on Uncertainty in Arti.cial Intelligence (UAI’03). 相似文献
9.
On Some Varieties of MTL-algebras 总被引:1,自引:0,他引:1
10.
Tucker3 hierarchical classes analysis 总被引:1,自引:0,他引:1
This paper presents a new model for binary three-way three-mode data, called Tucker3 hierarchical classes model (Tucker3-HICLAS). This new model generalizes Leenen, Van Mechelen, De Boeck, and Rosenberg's (1999) individual differences hierarchical classes model (INDCLAS). Like the INDCLAS model, the Tucker3-HICLAS model includes a hierarchical classification of the elements of each mode, and a linking structure among the three hierarchies. Unlike INDCLAS, Tucker3-HICLAS (a) does not restrict the hierarchical classifications of the three modes to have the same rank, and (b) allows for more complex linking structures among the three hierarchies. An algorithm to fit the Tucker3-HICLAS model is described and evaluated in an extensive simulation study. An application of the model to hostility data is discussed.The first author is a Research Assistant of the Fund for Scientific Research-Flanders (Belgium). The research reported in this paper was partially supported by the Research Council of K.U. Leuven (GOA/2000/02). We are grateful to Kristof Vansteelandt for providing us with an interesting data set. 相似文献