Pages that link to "Item:Q1102746"
From MaRDI portal
The following pages link to NP-hard problems in hierarchical-tree clustering (Q1102746):
Displaying 50 items.
- On making directed graphs transitive (Q414917) (← links)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Graph clustering (Q458448) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- Fitting semiparametric clustering models to dissimilarity data (Q484231) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Closer (Q813432) (← links)
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- Ensemble clustering by means of clustering embedding in vector spaces (Q898340) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- Optimal clustering of multipartite graphs (Q947074) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Computational complexity of inferring phylogenies from dissimilarity matrices (Q1091978) (← links)
- The complexity of ultrametric partitions on graphs (Q1098632) (← links)
- Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. (Q1129103) (← links)
- Constructing optimal ultrametrics (Q1314829) (← links)
- The noising method: A new method for combinatorial optimization (Q1319680) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- \(l_\infty\)-approximation via subdominants. (Q1599172) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- Consensus of partitions: a constructive approach (Q1761306) (← links)
- \(\Delta\) additive and \(\Delta\) ultra-additive maps, Gromov's trees, and the Farris transform (Q1765374) (← links)
- From hypertrees to arboreal quasi-ultrametrics (Q1766738) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Gaussian mixture model with an extended ultrametric covariance structure (Q2089298) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- Clustering with partial information (Q2268879) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- A weighted framework for unsupervised ensemble learning based on internal quality measures (Q2329902) (← links)
- Projective clustering ensembles (Q2377272) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
- Sub-dominant theory in numerical taxonomy (Q2489653) (← links)
- Noising methods for a clique partitioning problem (Q2489901) (← links)
- Functional non-parametric latent block model: a multivariate time series clustering approach for autonomous driving validation (Q2674522) (← links)
- Hierarchical means clustering (Q2680186) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
