Complexity study on two clustering problems (extended abstract)
From MaRDI portal
Recommendations
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- scientific article; zbMATH DE number 3984569
- scientific article; zbMATH DE number 4034897
- On complexity of some problems of cluster analysis of vector sequences
Cited in
(21)- Norm statistics and the complexity of clustering problems
- Probabilistic analysis of two \(k\)-cluster problems
- Co-clustering under the maximum norm
- Approximation algorithms for some clustering and classification problems
- On the complexity of some cluster analysis problems
- Co-clustering under the maximum norm
- scientific article; zbMATH DE number 6007853 (Why is no real title available?)
- Algorithms and complexity of range clustering
- Complexity and improved heuristic algorithms for binary fingerprints clustering
- scientific article; zbMATH DE number 3923897 (Why is no real title available?)
- An application of limited branching in clustering
- scientific article; zbMATH DE number 3930160 (Why is no real title available?)
- scientific article; zbMATH DE number 3984569 (Why is no real title available?)
- scientific article; zbMATH DE number 4034897 (Why is no real title available?)
- Bicomplex nets and their zones of clustering
- NP-hardness of some data cleaning problem
- Fingerprint Clustering with Bounded Number of Missing Values
- NP-hardness of the cluster minimization problem revisited
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- Computational complexity of two problems of cognitive data analysis
- Approximate clustering of incomplete fingerprints
This page was built for publication: Complexity study on two clustering problems (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474131)
