检索结果-内蒙古大学图书馆

Inducing a blockmodel structure of two-mode binary data using seriation procedures

JOURNAL OF MATHEMATICAL PSYCHOLOGY 2006年第5期50卷 468-477页

作者： Brusco, Michael Steinley, Douglas Florida State Univ Dept Mkt Tallahassee FL 32306 USA Univ Missouri Columbia MO USA

We show that seriation of the rows and columns of a two-mode, binary matrix can be an effective method for producing a reordering of the matrix that reveals a blockmodel structure of the data. The objective criterion of the seriation process is based on Robinson patterning of matrix elements. The key advantages of the proposed method are: (a) it can be used in conjunction with existing two-mode blockmodeling algorithms by facilitating selection of the number of classes for the rows and columns of the matrix and the appropriate types of ideal blocks;(b) the model uses a well-grounded index based on Robinson structure, (c) guaranteed optimal solutions can be obtained for problems of practical size, and (d) the seriation method is frequently capable of producing a solution that has a substantive interpretation with respect to the orderings of the row objects and column items. (c) 2006 Elsevier Inc. All rights reserved.

关键词： combinatorial data analysis seriation Robinson matrix blockmodel two-mode binary data

来源：评论

学校读者我要写书评

暂无评论

A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices

引用

JOURNAL OF MATHEMATICAL PSYCHOLOGY 2007年第5期51卷 325-338页

作者： Brusco, Michael Steinley, Douglas Florida State Univ Coll Business Dept Marketing Tallahassee FL 32306 USA Univ Missouri Columbia MO USA

The clustering of two-mode proximity matrices is a challenging combinatorial optimization problem that has important applications in the quantitative social sciences. We focus on one particular type of problem related to the clustering of a two-mode binary matrix, which is relevant to the establishment of generalized blockmodels for social networks. In this context, clusters for the rows of the two-mode matrix intersect with clusters of the columns to form blocks, which should ideally be either complete (all Is) or null (all Os). A new procedure based on variable neighborhood search is presented and compared to an existing two-mode K-means clustering algorithm. The new procedure. generally provided slightly greater explained variation;however, both methods yielded exceptional recovery of cluster structure. (C) 2007 Elsevier Inc. All rights reserved.

关键词： combinatorial data analysis blockmodel two-mode binary data cluster analysis variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：