Combinatorial data analysis

Combinatorial data analysis (CDA) is the study of data sets where the arrangement of objects is important. CDA can be used either to determine how well a given combinatorial construct reflects the observed data, or to search for a suitable combinatorial construct that does fit the data.

See also

• Cluster analysis
• Structured data analysis (statistics)

References

• Lawrence J. Hubert (1987). Assignment Methods in Combinatorial Data Analysis. Marcel Dekker. ISBN 978-0824776176.
• Lawrence J. Hubert, Phipps Arabie, Jacqueline Meulman (2001). Combinatorial Data Analysis: Optimization by Dynamic Programming. SIAM. ISBN 978-0898714784.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Michael J Brusco, Stephanie Stahl (2005). Branch-and-bound Applications in Combinatorial Data Analysis. Springer. ISBN 978-0387250373.