Partitioning Data Sets

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $40.00
Usually ships in 1-2 business days
(Save 61%)
Other sellers (Hardcover)
  • All (7) from $40.00   
  • New (1) from $227.50   
  • Used (6) from $40.00   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$227.50
Seller since 2014

Feedback rating:

(267)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Brand New Item.

Ships from: Chatham, NJ

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

Partitioning data sets into disjoint groups is a problem arising in many domains. The theory of cluster analysis aims to find groups that are both homogeneous (entities in the same group that are similar) and well separated (entities in different groups that are dissimilar). There has been rapid expansion in the axiomatic foundations and the computational complexity of such problems and in the design and analysis of exact or heuristic algorithms to solve them. Applications have burgeoned in psychology, computer vision, target tracking, and other areas. This book contains papers presented at the workshop Partioning Data Sets held at DIMACS in April 1993. Some of the papers cover the main paradigms of the field of cluster analysis methods and algorithms. Other topics include partitioning problems arising from multitarget tracking and surveillance and from computer and human vision. The multiplicity of approaches, methods, problems, and algorithms make for lively and informative reading.

Read More Show Less

Editorial Reviews

Booknews
Refereed versions of papers from a workshop held at DIMACS at Rutgers U. in April 1993, include essays and surveys on cluster analysis theory, methods and applications and related problems in psychology, computer vision, and target tracking. Among the topics are the median procedure for partitions; image segmentation based on optimal layering for precision tracking; mixture models for optical flow computation; and the visual perception of surfaces, their properties, and relationships. No index. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Table of Contents

Foreword
Preface
The Median Procedure for Partitions 3
Structural Properties of Pyramidal Clustering 35
Partitioning by Maximum Adjacency Search of Graphs 55
From Data to Knowledge: Probabilist Objects for a Symbolic Data Analysis 65
A Labeling Algorithm for Minimum Sum of Diameters Partitioning of Graphs 89
Agreement Subtrees, Metric and Consensus for Labeled Binary Trees 97
How to Choose K Entities Among N 105
On the Classification of Monotone-Equivariant Cluster Methods 117
Contiguity-Constrained Hierarchical Clustering 143
Image Segmentation Based on Optimal Layering for Precision Tracking 155
Multidimensional Assignments and Multitarget Tracking 169
Grouping Edges: An Efficient Bayesian Multiple Hypothesis Approach 199
Finding Salient Convex Groups 237
Mixture Models for Optical Flow Computation 271
Multilevel Detection of Stereo Disparity Surfaces 287
Some Problems of Visual Shape Recognition to which the Application of Clustering Mathematics Might Yield Some Potential Benefits 313
Perceptual Models of Small Dot Clusters 331
Subjective Contours in Early Vision and Beyond 359
The Visual Perception of Surfaces, their Properties, and Relationships 373
Visual Computations and Dot Cluster 391
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)