APCluster

swMATH11002MaRDI QIDQ22954FDOQ22954

Author name not available (Why is that?)

Described by source

• Clustering by Passing Messages Between Data Points

Cited In (91)

• Boolean autoencoders and hypercube clustering complexity
• QCC: a novel clustering algorithm based on quasi-cluster centers
• A Conditional Entropy Minimization Criterion for Dimensionality Reduction and Multiple Kernel Learning
• Topographic Mapping of Large Dissimilarity Data Sets
• Medical image segmentation using fruit fly optimization and density peaks clustering
• Fast density-weighted low-rank approximation spectral clustering
• Inference and learning with hierarchical shape models
• A review of message passing algorithms in estimation of distribution algorithms
• Community detection in node-attributed social networks: a survey
• Point clustering via voting maximization
• TOBAE: a density-based agglomerative clustering algorithm
• Bounded approximate decentralised coordination via the max-sum algorithm
• Archetypoids: a new approach to define representative archetypal data
• Affinity propagation clustering using path based similarity
• Robust MST-Based Clustering Algorithm
• Frameworks for multivariate \(m\)-mediods based modeling and classification in Euclidean and general feature spaces
• Overlapping community detection in networks
• Motion-based behaviour learning, profiling and classification in the presence of anomalies
• Biclustering with a quantum annealer
• A tree-structured framework for purifying ``complex clusters with structural roles of individual data
• Exemplar-based clustering via simulated annealing
• On Resolving Simultaneous Congruences Using Belief Propagation
• Clustering of imbalanced high-dimensional media data
• Mining axiomatic fuzzy set association rules for classification problems
• A Binary Variable Model for Affinity Propagation
• Finding cluster centers and sizes via multinomial parameterization
• Sparse and low-rank matrix regularization for learning time-varying Markov networks
• A matrix modular neural network based on task decomposition with subspace division by adaptive affinity propagation clustering
• Unified formulation of linear discriminant analysis methods and optimal parameter selection
• Building the library of RNA 3D nucleotide conformations using the clustering approach
• A model for clustering data from heterogeneous dissimilarities
• Image interpretation: mining the visible and syntactic correlation of annotated words
• Agglomerative clustering via maximum incremental path integral
• Classification by integrating plant stress response gene expression data with biological knowledge
• Analyzing gene expression time-courses based on multi-resolution shape mixture model
• \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data
• Ensemble clustering using factor graph
• Iterative ensemble normalized cuts
• Visualizing non-metric similarities in multiple maps
• Visual saliency with statistical priors
• Near-optimal large-scale k-medoids clustering
• Self-organised direction aware data partitioning algorithm
• Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
• Clustering and community detection in directed networks: a survey
• A novel probabilistic clustering model for heterogeneous networks
• Quantile-based clustering
• A rigorous analysis of the cavity equations for the minimum spanning tree
• Nonlinear system identification using quasi-ARX RBFN models with a parameter-classified scheme
• A hybrid fuzzy K-harmonic means clustering algorithm
• Fuzzy granular gravitational clustering algorithm for multivariate data
• An initialization method for the \(K\)-means algorithm using neighborhood model
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• High-dimensional clustering via random projections
• Shape modeling with spline partitions
• A Poisson-based adaptive affinity propagation clustering for SAGE data
• A diffeomorphic mapping based characterization of temporal sequences: application to the pelvic organ dynamics assessment
• Merging the components of a finite mixture using posterior probabilities
• A network hierarchy-based method for functional module detection in protein-protein interaction networks
• Local and global approaches of affinity propagation clustering for large scale data
• Recovery guarantees for exemplar-based clustering
• Transfer affinity propagation-based clustering
• Sequential minimal optimization in convex clustering repetitions
• Discrete facility location in machine learning
• A factor graph model for unsupervised feature selection
• Linear discriminant analysis guided by unsupervised ensemble learning
• Shrinkage Clustering: A Fast and Size-Constrained Algorithm for Biomedical Applications
• Affinity propagation: An exemplar‐based tool for clustering in psychological research
• Convergence and correctness of belief propagation for the Chinese postman problem
• Clustering algorithm based on mutual K‐nearest neighbor relationships
• Enhanced clustering embedded in curvilinear distance analysis guided by pairwise constraints
• Data-driven process decomposition and robust online distributed modelling for large-scale processes
• Affinity propagation and uncapacitated facility location problems
• An exemplar-based clustering using efficient variational message passing
• Summarization and Search Over Geometric Spaces
• Augmented sparse reconstruction of protein signaling networks
• Metric learning by discriminant neighborhood embedding
• Similarities, Dissimilarities and Types of Inner Products for Data Analysis in the Context of Machine Learning
• MANOVA, LDA, and FA criteria in clusters parameter estimation
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
• Dense neighborhoods on affinity graph
• Data clustering via cooperative games: a novel approach and comparative study
• Learning grammars for architecture-specific facade parsing
• Time is money: dynamic-model-based time series data-mining for correlation analysis of commodity sales
• The Parallel Seeding Algorithm for k-Means Problem with Penalties
• Stochastic approximation algorithm with randomization at the input for unsupervised parameters estimation of Gaussian mixture model with sparse parameters
• A fast multiobjective fuzzy clustering with multimeasures combination
• A biclustering approach based on factor graphs and the max-sum algorithm
• Parallel subgradient algorithm with block dual decomposition for large-scale optimization
• An approximation algorithm for the uniform capacitated \(k\)-means problem
• Minimal basis subspace representation: a unified framework for rigid and non-rigid motion segmentation
• Space-time tree ensemble for action recognition and localization

This page was built for software: APCluster