scientific article; zbMATH DE number 1107550

MaRDI QIDQ4373479zbMATH OpenFDO

Authors W. H. E. Day

Publication date 21 January 1998

zbMATH Keywords

classification problemscomplexity theoryNP-completenesstutorial

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Computational complexity of problems in classification according to a relation matrix
• Computational complexity of two problems of cognitive data analysis
• scientific article; zbMATH DE number 218387
• On the complexity of some data analysis problems

Cited in

(14)

• Complexity of classification problems
• Classification of binary vectors by stochastic complexity.
• Clustering on trees
• Taxicab correspondence analysis
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Distinguishing and classifying from n-ary properties
• Extremes in the Complexity of Computing Metric Distances Between Partitions
• Classification from a Computable Viewpoint
• Computer-Aided complexity classification of combinational problems
• scientific article; zbMATH DE number 139608 (Why is no real title available?)
• scientific article; zbMATH DE number 622666 (Why is no real title available?)
• Recognition method of algorithms classes on the basis of asymptotics for the elasticity of complexity functions
• Elements of classification. Combinatorial aspects and algorithms
• Computational complexity of two problems of cognitive data analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373479)