未读消息消息

店铺

我的订单收藏

拍卖

拍卖交易我的竞拍收藏

我的好友资金账户

客服 |

帮助中心 9:00-20:30 在线留言

客服电话

010-89648155

服务时间

客服咨询 8:00-21:00

纠纷处理 9:00-21:00

图书审核 9:00-18:00

监督与建议

请选择

手机孔网

国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

分享

作者: [美] 休伯特著

出版社: 清华大学出版社

出版时间: 2011-02

版次: 1

ISBN: 9787302245018

定价: 25.00

装帧: 平装

开本: 16开

纸张: 胶版纸

页数: 163页

分类: 自然科学

2 张插图图片

Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. Combinatorial Data Analysis: Optimization by Dynamic Programming focuses on the identification of arrangements, which are then further restricted to where the combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP).

The authors provide a comprehensive and self-contained review delineating a very general DP paradigm, or schema, that can serve two functions. First, the paradigm can be applied in various special forms to encompass all previously proposed applications suggested in the classification literature. Second, the paradigm can lead directly to many more novel uses. An appendix is included as a user's manual for a collection of programs available as freeware.

The incorporation of a wide variety of CDA tasks under one common optimization framework based on DP is one of this book's strongest points. The authors include verifiably optimal solutions to nontrivially sized problems over the array of data analysis tasks discussed.

This monograph provides an applied documentation source, as well as an introduction to a collection of associated computer programs, that will be of interest to applied statisticians and data analysts as well as notationally sophisticated users.
Preface

1 Introduction

2 General Dynamic Programming Paradigm

2.1 An Introductory Example: Linear Assignment

2.2 The GDPP

3 Cluster Analysis

3.1 Partitioning

3.1.1 Admissibility Restrictions on Partitions

3.1.2 Partitioning Based on Two-Mode Proximity Matrices

3.2 Hierarchical Clustering

3.2.1 Hierarchical Clustering and the Optimal Fitting of Ultrametrics

3.2.2 Constrained Hierarchical Clustering

4 Object Sequencing and Seriation

4.1 Optimal Sequencing of a Single Object Set

4.1.1 Symmetric One-Mode Proximity Matrices

4.1.2 Skew-Symmetric One-Mode Proximity Matrices

4.1.3 Two-Mode Proximity Matrices

4.1.4 Object Sequencing for Symmetric One-Mode Proximity Matrices Based on the Construction of Optimal Paths

4.2 Sequencing an Object Set Subject to Precedence Constraints

4.3 Construction of Optimal Ordered Partitions

5 Heuristic Applications of the GDPP

5.1 Cluster Analysis

5.2 Object Sequencing and Seriation

6 Extensions and Generalizations

6.1 Introduction

6.1.1 Multiple Data Sources

6.1.2 Multiple Structures

6.1.3 Uses for the Information in the SetsΩ1……Ωk

6.1.4 A Priori Weights for Objects and/or Proximities

6.2 Prospects

Appendix: Available Programs

Bibliography

Author Index

Subject Index
内容简介:
Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. Combinatorial Data Analysis: Optimization by Dynamic Programming focuses on the identification of arrangements, which are then further restricted to where the combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP).

The authors provide a comprehensive and self-contained review delineating a very general DP paradigm, or schema, that can serve two functions. First, the paradigm can be applied in various special forms to encompass all previously proposed applications suggested in the classification literature. Second, the paradigm can lead directly to many more novel uses. An appendix is included as a user's manual for a collection of programs available as freeware.

The incorporation of a wide variety of CDA tasks under one common optimization framework based on DP is one of this book's strongest points. The authors include verifiably optimal solutions to nontrivially sized problems over the array of data analysis tasks discussed.

This monograph provides an applied documentation source, as well as an introduction to a collection of associated computer programs, that will be of interest to applied statisticians and data analysts as well as notationally sophisticated users.
目录:
Preface

1 Introduction

2 General Dynamic Programming Paradigm

2.1 An Introductory Example: Linear Assignment

2.2 The GDPP

3 Cluster Analysis

3.1 Partitioning

3.1.1 Admissibility Restrictions on Partitions

3.1.2 Partitioning Based on Two-Mode Proximity Matrices

3.2 Hierarchical Clustering

3.2.1 Hierarchical Clustering and the Optimal Fitting of Ultrametrics

3.2.2 Constrained Hierarchical Clustering

4 Object Sequencing and Seriation

4.1 Optimal Sequencing of a Single Object Set

4.1.1 Symmetric One-Mode Proximity Matrices

4.1.2 Skew-Symmetric One-Mode Proximity Matrices

4.1.3 Two-Mode Proximity Matrices

4.1.4 Object Sequencing for Symmetric One-Mode Proximity Matrices Based on the Construction of Optimal Paths

4.2 Sequencing an Object Set Subject to Precedence Constraints

4.3 Construction of Optimal Ordered Partitions

5 Heuristic Applications of the GDPP

5.1 Cluster Analysis

5.2 Object Sequencing and Seriation

6 Extensions and Generalizations

6.1 Introduction

6.1.1 Multiple Data Sources

6.1.2 Multiple Structures

6.1.3 Uses for the Information in the SetsΩ1……Ωk

6.1.4 A Priori Weights for Objects and/or Proximities

6.2 Prospects

Appendix: Available Programs

Bibliography

Author Index

Subject Index

查看详情

相关分类

农业/林业畜牧/养殖生物科学环境科学数学物理学力学化学天文学测绘学地球科学大气科学（气象学）地质学海洋学

国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

九五品

大爽爽的书摊的书店

天津市南开区

平均发货15小时成功完成率94.23%

￥45.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）一版一印基本全新内页没有写划

九五品

亚倪正版书

吉林省长春市

平均发货19小时成功完成率97.24%

￥45.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）正版库存未阅

九五品

红梅书店的书店

北京市通州区

平均发货19小时成功完成率90.38%

￥45.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

八五品

理科工程技术专卖店

江苏省南京市

平均发货3小时成功完成率98.15%

￥45.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）正版库存书塑封包装

九五品

亚倪正版书

吉林省长春市

平均发货19小时成功完成率97.24%

￥49.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

八五品

江城凯文书店

湖北省武汉市

平均发货6小时成功完成率96.12%

￥51.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）正版现货，品相完好，套书默认发一本

九品

旧书香书城

北京市昌平区

平均发货23小时成功完成率86.49%

￥64.85

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）正版现货！实物拍摄，品相成色自定！高于原价出售！【售出后不退不换货哦！！！】有疑问请联系商家！确认好在下单！以免争议！

九品

未来科技书店

北京市海淀区

平均发货22小时成功完成率75%

￥69.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）平装16开薄册，2011年一版一印，品佳。

2011-02 印刷
印次: 1

九品

采菽的书店

平均发货4小时成功完成率96.88%

￥98.00

立即购买加入购物车不属于本条目
国际著名数学图书（影印版）：组合数据分析·通过动态规划进行优化（英文版）

八品

山海书坊

北京市海淀区

平均发货1小时成功完成率94.67%

￥129.00

立即购买加入购物车不属于本条目