Clusters, Orders, and Trees: Methods and Applications

In Honor of Boris Mirkin's 70th Birthday

Editors:

ISBN: 978-1-4939-0741-0 (Print) 978-1-4939-0742-7 (Online)

Table of contents (23 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xi

  2. No Access

    Chapter

    Pages 1-9

    Three and One Questions to Dr. B. Mirkin About Complexity Statistics

  3. Classification and Cluster

    1. Front Matter

      Pages 11-11

    2. No Access

      Chapter

      Pages 13-50

      A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

    3. No Access

      Chapter

      Pages 51-62

      Experiments with a Non-convex Variance-Based Clustering Criterion

    4. No Access

      Chapter

      Pages 63-75

      Strategy-Proof Location Functions on Finite Graphs

    5. No Access

      Chapter

      Pages 77-89

      A Pseudo-Boolean Approach to the Market Graph Analysis by Means of the p-Median Model

    6. No Access

      Chapter

      Pages 91-102

      Clustering as an Approach to 3D Reconstruction Problem

    7. No Access

      Chapter

      Pages 103-117

      Selecting the Minkowski Exponent for Intelligent K-Means with Feature Weighting

    8. No Access

      Chapter

      Pages 119-150

      High-Dimensional Data Classification

    9. No Access

      Chapter

      Pages 151-165

      Algorithm FRiS-TDR for Generalized Classification of the Labeled, Semi-labeled and Unlabeled Datasets

    10. No Access

      Chapter

      Pages 167-180

      From Separating to Proximal Plane Classifiers: A Review

    11. No Access

      Chapter

      Pages 181-185

      A Note on the Effectiveness of the Least Squares Consensus Clustering

  4. Order and Tree

    1. Front Matter

      Pages 187-187

    2. No Access

      Chapter

      Pages 189-199

      Single or Multiple Consensus for Linear Orders

    3. No Access

      Chapter

      Pages 201-210

      Choice Functions on Tree Quasi-Orders

    4. No Access

      Chapter

      Pages 211-230

      Weak Hierarchies: A Central Clustering Structure

    5. No Access

      Chapter

      Pages 231-247

      Some Observations on Oligarchies, Internal Direct Sums, and Lattice Congruences

    6. No Access

      Chapter

      Pages 249-272

      Thinking Ultrametrically, Thinking p-Adically

    7. No Access

      Chapter

      Pages 273-293

      A New Algorithm for Inferring Hybridization Events Based on the Detection of Horizontal Gene Transfers

  5. Measurement

    1. Front Matter

      Pages 295-295

    2. No Access

      Chapter

      Pages 297-312

      Meaningful and Meaningless Statements in Landscape Ecology and Environmental Sustainability

    3. No Access

      Chapter

      Pages 313-330

      Nearest Neighbour in Least Squares Data Imputation Algorithms for Marketing Data

    4. No Access

      Chapter

      Pages 331-340

      AST Method for Scoring String-to-text Similarity

previous Page of 2