ISBN:
1280437189
,
9781280437182
,
9780511170911
Language:
English
Pages:
Online-Ressource (xv, 384 p)
,
ill
Series Statement:
Structural analysis in the social sciences 25
Parallel Title:
Print version Generalized Blockmodeling
DDC:
302/.01/5195
Keywords:
Sociometry
;
Social networks Mathematical models
Description / Table of Contents:
""CONTENTS""; ""PREFACE""; ""1 SOCIAL NETWORKS AND BLOCKMODELS""; ""1.1 AN INTUITIVE STATEMENT OF NETWORK IDEAS""; ""1.1.1 Fundamental types of social relations""; ""1.1.2 Types of relational data arrays""; ""1.2 BLOCKS AS PARTS OF NETWORKS""; ""1.2.1 Blocks""; ""1.3 SOME BLOCK TYPES""; ""1.4 SPECIFYING BLOCKMODELS""; ""1.4.1 Parent�child role systems""; ""1.4.2 Organizational hierarchies""; ""1.4.3 Systems of ranked clusters""; ""1.4.4 Baboon grooming networks""; ""1.5 CONVENTIONAL BLOCKMODELING""; ""1.5.1 Equivalence and blockmodeling""; ""1.6 GENERALIZED BLOCKMODELING""
Description / Table of Contents:
""1.7 AN OUTLINE MAP OF THE TOPICS CONSIDERED""""2 NETWORK DATA SETS""; ""2.1 CLASSIC DATA SETS""; ""2.1.1 Sampson monastery data""; ""2.1.2 Bank wiring room data""; ""2.1.3 Newcomb fraternity data""; ""2.2 NEWER DATA SETS""; ""2.2.1 Little league baseball teams""; ""2.2.2 Political actor network""; ""2.2.3 Student government data""; ""2.2.4 Kansas search and rescue network""; ""2.2.5 A Bales-type group dynamics network""; ""2.2.6 Ragusan families marriage networks""; ""2.2.7 Two baboon grooming networks""; ""2.3 DATA SET PROPERTIES""; ""2.4 SOME ADDITIONAL REMARKS CONCERNING DATA""
Description / Table of Contents:
""3 MATHEMATICAL PRELUDE""""3.1 BASIC SET THEORY""; ""3.2 RELATIONS""; ""3.2.1 Operations with binary relations""; ""3.2.2 Comparing relations""; ""3.2.3 Special operations""; ""3.3 FUNCTIONS""; ""3.3.1 Products of functions""; ""3.3.2 Relational homomorphisms""; ""3.4 BASIC ALGEBRA""; ""3.5 TRANSITIONS TO CHAPTERS 4 AND 9""; ""4 RELATIONS AND GRAPHS FOR NETWORK ANALYSIS""; ""4.1 GRAPHS""; ""4.1.1 Examples of graphs""; ""4.1.2 Traveling on a graph""; ""4.1.3 Graph coloring""; ""4.2 TYPES OF BINARY RELATIONS""; ""4.2.1 Properties of relations""; ""4.2.2 Closures""
Description / Table of Contents:
""4.2.3 Computing the transitive closure""""4.2.4 Special elements""; ""4.2.5 Tournaments""; ""4.3 PARTITIONS AND EQUIVALENCE RELATIONS""; ""4.4 ACYCLIC RELATIONS""; ""4.4.1 Levels""; ""4.5 ORDERS""; ""4.5.1 Factorization""; ""4.5.2 Hasse diagram""; ""4.5.3 Numberings""; ""4.6 NETWORKS""; ""4.7 CENTRALITY IN NETWORKS""; ""4.7.1 Algorithmic aspects""; ""4.8 SUMMARY AND TRANSITION""; ""5 CLUSTERING APPROACHES""; ""5.1 AN INTRODUCTION TO CLUSTER ANALYTIC IDEAS""; ""5.2 USUAL CLUSTERING PROBLEMS""; ""5.2.1 An example""; ""5.2.2 The usual steps of solving clustering problems""
Description / Table of Contents:
""5.3 (DIS)SIMILARITIES""""5.3.1 (Dis)similarity measures for numerical data""; ""5.3.2 (Dis)similarity measures for binary data""; ""5.4 CLUSTERING ALGORITHMS""; ""5.4.1 The hierarchical approach""; ""5.4.2 The leader algorithm""; ""5.4.3 The relocation algorithms""; ""5.5 CONSTRAINED CLUSTERING""; ""5.5.1 The constrained clustering problem""; ""5.5.2 Solving constrained clustering problems""; ""5.5.3 The structure enforcement coefficient""; ""5.5.4 An empirical example""; ""5.6 MULTICRITERIA CLUSTERING""; ""5.6.1 A multicriteria clustering problem""
Description / Table of Contents:
""5.6.2 Solving discrete multicriteria optimization problems""
Note:
Includes bibliographical references (p. [363]-374) and indexes
URL:
https://doi.org/10.1017/CBO9780511584176
URL:
Volltext
(URL des Erstveröffentlichers)
URL:
Volltext
(URL des Erstveröffentlichers)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Permalink