共查询到3条相似文献,搜索用时 15 毫秒
1.
A new agglomerative method is proposed for the simultaneous hierarchical clustering of row and column elements of a two-mode
data matrix. The procedure yields a nested sequence of partitions of the union of two sets of entities (modes). A two-mode
cluster is defined as the union of subsets of the respective modes. At each step of the agglomerative process, the algorithm
merges those clusters whose fusion results in the smallest possible increase in an internal heterogeneity measure. This measure
takes into account both the variance within the respective cluster and its centroid effect defined as the squared deviation
of its mean from the maximum entry in the input matrix. The procedure optionally yields an overlapping cluster solution by
assigning further row and/or column elements to clusters existing at a preselected hierarchical level. Applications to real
data sets drawn from consumer research concerning brand-switching behavior and from personality research concerning the interaction
of behaviors and situations demonstrate the efficacy of the method at revealing the underlying two-mode similarity structure. 相似文献
2.
B. G. Mirkin 《Journal of Classification》1987,4(1):7-31
We review methods of qualitative factor analysis (QFA) developed by the author and his collaborators over the last decade and discuss the use of QFA methods for the additive clustering problem. The QFA method includes, first, finding a square Boolean matrix in a fixed set of Boolean matrices with simple structures to approximate a given similarity matrix, and, second, repeating this process again and again using residual similarity matrices. We present convergence properties for three versions of the method, provide cluster interpretations for results obtained from the algorithms, and give formulas for the evaluation of factor shares of the initial similarities variance.I am indebted to Professor P. Arabie and the referees for valuable comments and editing of the text. 相似文献
3.
In this paper, we propose a bicriterion objective function for clustering a given set ofN entities, which minimizes [d–(1–)s], where 01, andd ands are the diameter and the split of the clustering, respectively. When =1, the problem reduces to minimum diameter clustering, and when =0, maximum split clustering. We show that this objective provides an effective way to compromise between the two often conflicting criteria. While the problem is NP-hard in general, a polynomial algorithm with the worst-case time complexityO(N
2) is devised to solve the bipartition version. This algorithm actually gives all the Pareto optimal bipartitions with respect to diameter and split, and it can be extended to yield an efficient divisive hierarchical scheme. An extension of the approach to the objective [(d
1+d
2)–2(1–)s] is also proposed, whered
1 andd
2 are diameters of the two clusters of a bipartition.This research was supported in part by the National Science and Engineering Research Council of Canada (Grant OGP 0104900). The authors wish to thank two anonymous referees, whose detailed comments on earlier drafts improved the paper. 相似文献