Geometry of Data Sets

  • Boris Mirkin
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 11)


  • Entity-to-variable data table can be represented geometrically in three different settings of which one (row-points) pertains to conventional clustering, another (column-vectors), to conceptual clustering, and the third one (matrix space), to approximation clustering.

  • Two principles for standardizing the conditional data tables are suggested as related to the data scatter.

  • Standardizing the aggregable data is suggested based on the flow index concept introduced.

  • Graph-theoretic concepts related to clustering are considered.

  • Low-rank approximation of data, including the popular Principal component and Correspondence analysis techniques, are discussed and extended into a general Sequential fitting procedure, SEFIT, which will be employed for approximation clustering.


Span Tree Singular Value Decomposition Correspondence Analysis Maximum Clique Boolean Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Boris Mirkin
    • 1
  1. 1.DIMACSRutgers UniversityUSA

Personalised recommendations