Combinatorial data analysis

In statistics, combinatorial data analysis (CDA) is the study of data sets where the order in which objects are arranged 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.^[1]^[2]^[3]

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.

This statistics-related article is a stub. You can help Wikipedia by expanding it.

[1] Lawrence J. Hubert (1987). Assignment Methods in Combinatorial Data Analysis. Marcel Dekker. ISBN 978-0824776176.

[2] 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)

[3] Michael J Brusco; Stephanie Stahl (2005). Branch-and-bound Applications in Combinatorial Data Analysis. Springer. ISBN 978-0387250373.

[1]

[2]

[3]

See also

References