Pages that link to "Item:Q2564098"

The following pages link to Mathematical classification and clustering (Q2564098):

Displaying 50 items.

• Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads (Q263223) (← links)
• FINDCLUS: fuzzy individual differences clustering (Q263346) (← links)
• Block-relaxation approaches for fitting the INDCLUS model (Q263355) (← links)
• Approximate functions in a problem of sets separation (Q346819) (← links)
• Sequential clustering with radius and split criteria (Q351557) (← links)
• Summarizing transactional databases with overlapped hyperrectangles (Q408648) (← links)
• Entropy on covers (Q408699) (← links)
• Local equivalences of distances between clusterings -- a geometric perspective (Q420920) (← links)
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
• Book review of: B. Goldengorin et al., Cell formation in industrial engineering. Theory, algorithms and experiments (Q497460) (← links)
• Stability-based validation of bicluster solutions (Q614075) (← links)
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
• A hybrid ACO-GRASP algorithm for clustering analysis (Q646719) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• Kernel-based hard clustering methods in the feature space with automatic variable weighting (Q736304) (← links)
• Clustering for time-varying relational count data (Q830430) (← links)
• Multi-objective biclustering: When non-dominated solutions are not enough (Q839510) (← links)
• Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis (Q840098) (← links)
• On the random generation and counting of weak order extensions of a poset with given class cardinalities (Q867611) (← links)
• Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
• Interactive error correction in implicative theories (Q899138) (← links)
• A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
• On the random generation of monotone data sets (Q963446) (← links)
• Symmetry in data mining and analysis: a unifying view based on hierarchy (Q1048428) (← links)
• Cluster analysis and mathematical programming (Q1365055) (← links)
• Recognition of Robinsonian dissimilarities (Q1378872) (← links)
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
• A clustering algorithm based on graph connectivity (Q1607070) (← links)
• Sequential combination methods for data clustering analysis (Q1613232) (← links)
• Pyramids and weak hierarchies in the ordinal model for clustering (Q1613414) (← links)
• Variational algorithms for biclustering models (Q1663249) (← links)
• Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• Nearest neighbour approach in the least-squares data imputation algorithms (Q1763919) (← links)
• Personnel allocation among bank branches using a two-stage multi-criterial approach. (Q1810495) (← links)
• The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies (Q1874534) (← links)
• Synergies between operations research and data mining: the emerging use of multi-objective approaches (Q1926877) (← links)
• Towards a general theory of classifications (Q1932170) (← links)
• Classification based on formal concept analysis and biclustering: possibilities of the approach (Q1938786) (← links)
• Multiset neurons (Q2111605) (← links)
• On similarity (Q2158084) (← links)
• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices (Q2172627) (← links)
• Noise-free latent block model for high dimensional data (Q2218334) (← links)
• Biclustering meets triadic concept analysis (Q2248533) (← links)
• Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices (Q2248666) (← links)
• Nearest neighbours in least-squares data imputation algorithms with different missing patterns (Q2257590) (← links)
• Profile likelihood biclustering (Q2293724) (← links)
• Decision reducts and bireducts in a covering approximation space and their relationship to set definability (Q2330010) (← links)
• Ordering properties of the first eigenvector of certain similarity matrices (Q2337077) (← links)
• Robust classifying of prokaryotic genomes (Q2359344) (← links)