NP-hard problems in hierarchical-tree clustering
From MaRDI portal
Publication:1102746
DOI10.1007/BF00289116zbMath0644.68055OpenAlexW2055764977MaRDI QIDQ1102746
Mirko Křivánek, Jaroslav Morávek
Publication date: 1986
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289116
Analysis of algorithms and problem complexity (68Q25) Numerical optimization and variational techniques (65K10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes, Computational complexity of inferring phylogenies from dissimilarity matrices, Parameterizing edge modification problems above lower bounds, Projective clustering ensembles, The complexity of ultrametric partitions on graphs, Cluster analysis and mathematical programming, Graph-Based Data Clustering with Overlaps, A new temporal interpretation of cluster editing, Cluster Editing, On the complexity of multi-parameterized cluster editing, Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data., Functional non-parametric latent block model: a multivariate time series clustering approach for autonomous driving validation, A golden ratio parameterized algorithm for cluster editing, \((1,1)\)-cluster editing is polynomial-time solvable, Hierarchical disjoint principal component analysis, Improved Algorithms for Bicluster Editing, Hierarchical means clustering, Exact Algorithms for Cluster Editing: Evaluation and Experiments, Ensemble clustering by means of clustering embedding in vector spaces, On making directed graphs transitive, Graph clustering with a constraint on cluster sizes, A randomized PTAS for the minimum consensus clustering with a fixed number of clusters, Consensus and fuzzy partition of dendrograms from a three-way dissimilarity array, On facet-inducing inequalities for combinatorial polytopes, Unnamed Item, Graph-based data clustering with overlaps, Graph clustering, Editing graphs into disjoint unions of dense clusters, Finding the closest ultrametric, On the approximation of correlation clustering and consensus clustering, Fitting semiparametric clustering models to dissimilarity data, A faster algorithm for the cluster editing problem on proper interval graphs, On a semi-superwized graph clustering problem, APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM, ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM, Optimal clustering of multipartite graphs, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Combinatorial optimisation and hierarchical classifications, Cluster editing: kernelization based on edge cuts, Exact algorithms for cluster editing: Evaluation and experiments, Consensus of partitions: a constructive approach, Fixed-parameter enumerability of cluster editing and related problems, \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform, From hypertrees to arboreal quasi-ultrametrics, Sub-dominant theory in numerical taxonomy, Noising methods for a clique partitioning problem, On the parameterized complexity of consensus clustering, Clustering with partial information, Cluster editing with locally bounded modifications, NP-hardness results for the aggregation of linear orders into median orders, Average parameterization and partial kernelization for computing medians, Clustering with Partial Information, A dual reformulation and solution framework for regularized convex clustering problems, Parameterized algorithms for module map problems, Closest 4-leaf power is fixed-parameter tractable, A more effective linear kernelization for cluster editing, Alternative Parameterizations for Cluster Editing, The Branch and Cut Method for the Clique Partitioning Problem, A simple and improved parameterized algorithm for bicluster editing, Going weighted: parameterized algorithms for cluster editing, Application of the “descent with mutations” metaheuristic to a clique partitioning problem, A weighted framework for unsupervised ensemble learning based on internal quality measures, Gaussian mixture model with an extended ultrametric covariance structure, Going Weighted: Parameterized Algorithms for Cluster Editing, The Multi-parameterized Cluster Editing Problem, \(l_\infty\)-approximation via subdominants., Constructing optimal ultrametrics, The generic complexity of the bounded problem of graphs clustering, The noising method: A new method for combinatorial optimization, Closer
Cites Work
