全文获取类型
收费全文 | 81篇 |
免费 | 5篇 |
国内免费 | 4篇 |
出版年
2022年 | 3篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 3篇 |
2012年 | 2篇 |
2011年 | 4篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 5篇 |
2004年 | 3篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有90条查询结果,搜索用时 31 毫秒
71.
P. V. Balakrishnan Martha C. Cooper Varghese S. Jacob Phillip A. Lewis 《Psychometrika》1994,59(4):509-525
Several neural networks have been proposed in the general literature for pattern recognition and clustering, but little empirical comparison with traditional methods has been done. The results reported here compare neural networks using Kohonen learning with a traditional clustering method (K-means) in an experimental design using simulated data with known cluster solutions. Two types of neural networks were examined, both of which used unsupervised learning to perform the clustering. One used Kohonen learning with a conscience and the other used Kohonen learning without a conscience mechanism. The performance of these nets was examined with respect to changes in the number of attributes, the number of clusters, and the amount of error in the data. Generally, theK-means procedure had fewer points misclassified while the classification accuracy of neural networks worsened as the number of clusters in the data increased from two to five.Acknowledgements: Sara Dickson, Vidya Nair, and Beth Means assisted with the neural network analyses. 相似文献
72.
This paper describes the conjunctive counterpart of De Boeck and Rosenberg's hierarchical classes model. Both the original model and its conjunctive counterpart represent the set-theoretical structure of a two-way two-mode binary matrix. However, unlike the original model, the new model represents the row-column association as a conjunctive function of a set of hypothetical binary variables. The conjunctive nature of the new model further implies that it may represent some conjunctive higher order dependencies among rows and columns. The substantive significance of the conjunctive model is illustrated with empirical applications. Finally, it is shown how conjunctive and disjunctive hierarchical classes models relate to Galois lattices, and how hierarchical classes analysis can be useful to construct lattice models of empirical data.The research reported in this paper was supported by NATO (Grant CRG.921321 to Iven Van Mechelen and Seymour Rosenberg) and by the Research Fund of Katholieke Universiteit Leuven (Grants PDM92/19 and POR93/3 to Iven Van Mechelen; Grants OT89/9 and F91/56 to Paul De Boeck). 相似文献
73.
Points of view analysis (PVA), proposed by Tucker and Messick in 1963, was one of the first methods to deal explicitly with individual differences in multidimensional scaling, but at some point was apparently superceded by the weighted Euclidean model, well-known as the Carroll and Chang INDSCAL model. This paper argues that the idea behind points of view analysis deserves new attention, especially as a technique to analyze group differences. A procedure is proposed that can be viewed as a streamlined, integrated version of the Tucker and Messick Process, which consisted of a number of separate steps. At the same time, our procedure can be regarded as a particularly constrained weighted Euclidean model. While fitting the model, two types of nonlinear data transformations are feasible, either for given dissimilarities, or for variables from which the dissimilarities are derived. Various applications are discussed, where the two types of transformation can be mixed in the same analysis; a quadratic assignment framework is used to evaluate the results.The research of the first author was supported by the Royal Netherlands Academy of Arts and Sciences (KNAW); the research of the second author by the Netherlands Organization for Scientific Research (NWO Grant 560-267-029). An earlier version of this paper was presented at the European Meeting of the Psychometric Society, Leuven, 1989. We wish to thank Willem J. Heiser for his stimulating comments to earlier versions of this paper, and we are grateful to the Editor and anonymous referees for their helpful suggestions. 相似文献
74.
The CHIC Model: A Global Model for Coupled Binary Data 总被引:1,自引:0,他引:1
Often problems result in the collection of coupled data, which consist of different N-way N-mode data blocks that have one or more modes in common. To reveal the structure underlying such data, an integrated modeling
strategy, with a single set of parameters for the common mode(s), that is estimated based on the information in all data blocks,
may be most appropriate. Such a strategy implies a global model, consisting of different N-way N-mode submodels, and a global loss function that is a (weighted) sum of the partial loss functions associated with the different
submodels. In this paper, such a global model for an integrated analysis of a three-way three-mode binary data array and a
two-way two-mode binary data matrix that have one mode in common is presented. A simulated annealing algorithm to estimate
the model parameters is described and evaluated in a simulation study. An application of the model to real psychological data
is discussed.
T. Wilderjans 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/2005/04). We are grateful to Kristof Vansteelandt
for providing us with an interesting data set. We also thank three anonymous reviewers for their useful comments. 相似文献
75.
In this paper, we propose a cluster-MDS model for two-way one-mode continuous rating dissimilarity data. The model aims at
partitioning the objects into classes and simultaneously representing the cluster centers in a low-dimensional space. Under
the normal distribution assumption, a latent class model is developed in terms of the set of dissimilarities in a maximum
likelihood framework. In each iteration, the probability that a dissimilarity belongs to each of the blocks conforming to
a partition of the original dissimilarity matrix, and the rest of parameters, are estimated in a simulated annealing based
algorithm. A model selection strategy is used to test the number of latent classes and the dimensionality of the problem.
Both simulated and classical dissimilarity data are analyzed to illustrate the model. 相似文献
76.
The Local Minima Problem in Hierarchical Classes Analysis: An Evaluation of a Simulated Annealing Algorithm and Various Multistart Procedures 总被引:2,自引:1,他引:1
Hierarchical classes models are quasi-order retaining Boolean decomposition models for N-way N-mode binary data. To fit these models to data, rationally started alternating least squares (or, equivalently, alternating
least absolute deviations) algorithms have been proposed. Extensive simulation studies showed that these algorithms succeed
quite well in recovering the underlying truth but frequently end in a local minimum. In this paper we evaluate whether or
not this local minimum problem can be mitigated by means of two common strategies for avoiding local minima in combinatorial
data analysis: simulated annealing (SA) and use of a multistart procedure. In particular, we propose a generic SA algorithm
for hierarchical classes analysis and three different types of random starts. The effectiveness of the SA algorithm and the
random starts is evaluated by reanalyzing data sets of previous simulation studies. The reported results support the use of
the proposed SA algorithm in combination with a random multistart procedure, regardless of the properties of the data set
under study.
Eva Ceulemans is a post-doctoral fellow of the Fund for Scientific Research Flanders (Belgium). Iwin Leenen is a post-doctoral
researcher of the Spanish Ministerio de Educación y Ciencia (programa Ramón y Cajal). The research reported in this paper
was partially supported by the Research Council of K.U. Leuven (GOA/05/04). 相似文献
77.
Hierarchical Classes Modeling of Rating Data 总被引:2,自引:1,他引:1
Hierarchical classes (HICLAS) models constitute a distinct family of structural models for N-way N-mode data. All members of the family include N simultaneous and linked classifications of the elements of the N modes implied by the data; those classifications are organized in terms of hierarchical, if–then-type relations. Moreover,
the models are accompanied by comprehensive, insightful graphical representations. Up to now, the hierarchical classes family
has been limited to dichotomous or dichotomized data. In the present paper we propose a novel extension of the family to two-way
two-mode rating data (HICLAS-R). The HICLAS-R model preserves the representation of simultaneous and linked classifications
as well as of generalized if–then-type relations, and keeps being accompanied by a comprehensive graphical representation.
It is shown to bear interesting relationships with classical real-valued two-way component analysis and with methods of optimal
scaling.
The research reported in this paper was supported by the Research Fund of the University of Leuven (GOA/00/02 and GOA/05/04)
and by the Fund for Scientific Research-Flanders (project G.0146.06). Eva Ceulemans is a Post-doctoral Researcher supported
by the Fund for Scientific Research, Flanders. The authors gratefully acknowledge the help of Gert Quintiens and Kaatje Bollaerts
in collecting the data used in Section 4 and of Jan Schepers in additional analyses of these data. 相似文献
78.
Michael J. Brusco Emilie Shireman Douglas Steinley Susan Brudvig J. Dennis Cradit 《The British journal of mathematical and statistical psychology》2017,70(1):1-24
The emergence of Gaussian model‐based partitioning as a viable alternative to K‐means clustering fosters a need for discrete optimization methods that can be efficiently implemented using model‐based criteria. A variety of alternative partitioning criteria have been proposed for more general data conditions that permit elliptical clusters, different spatial orientations for the clusters, and unequal cluster sizes. Unfortunately, many of these partitioning criteria are computationally demanding, which makes the multiple‐restart (multistart) approach commonly used for K‐means partitioning less effective as a heuristic solution strategy. As an alternative, we propose an approach based on iterated local search (ILS), which has proved effective in previous combinatorial data analysis contexts. We compared multistart, ILS and hybrid multistart–ILS procedures for minimizing a very general model‐based criterion that assumes no restrictions on cluster size or within‐group covariance structure. This comparison, which used 23 data sets from the classification literature, revealed that the ILS and hybrid heuristics generally provided better criterion function values than the multistart approach when all three methods were constrained to the same 10‐min time limit. In many instances, these differences in criterion function values reflected profound differences in the partitions obtained. 相似文献
79.
Multiple correspondence analysis (MCA) is a useful tool for investigating the interrelationships among dummy-coded categorical variables. MCA has been combined with clustering methods to examine whether there exist heterogeneous subclusters of a population, which exhibit cluster-level heterogeneity. These combined approaches aim to classify either observations only (one-way clustering of MCA) or both observations and variable categories (two-way clustering of MCA). The latter approach is favored because its solutions are easier to interpret by providing explicitly which subgroup of observations is associated with which subset of variable categories. Nonetheless, the two-way approach has been built on hard classification that assumes observations and/or variable categories to belong to only one cluster. To relax this assumption, we propose two-way fuzzy clustering of MCA. Specifically, we combine MCA with fuzzy k-means simultaneously to classify a subgroup of observations and a subset of variable categories into a common cluster, while allowing both observations and variable categories to belong partially to multiple clusters. Importantly, we adopt regularized fuzzy k-means, thereby enabling us to decide the degree of fuzziness in cluster memberships automatically. We evaluate the performance of the proposed approach through the analysis of simulated and real data, in comparison with existing two-way clustering approaches. 相似文献
80.
Hosana Alves Gonçalves Caroline Cargnin Geise Machado Jacobsen Renata Kochhann Yves Joanette Rochele Paz Fonseca 《Journal of Cognitive Psychology》2017,29(6):670-690
We investigated the role of age and school type on clustering and switching in verbal fluency tasks (VFTs) with Brazilian children. The children were administered unconstrained, phonemic and semantic VFTs with a duration of 150 or 120 s, respectively. Both age and school type influenced all variables and in terms of performance over time. Older children and private school students outperformed the remainder of the sample, with the first 30 s of each VFT usually being the most productive. Although the size of the clusters produced did not differ between groups, the types of clusters did show some variations, with semantic clusters being the most frequent. Our results revealed strong correlations between switching ability and word production in all three VFTs. In conclusion, the executive functions known as planning and cognitive flexibility play a crucial role in word production by organising and facilitating the recall of lexical information from memory. 相似文献