apcluster

swMATH11001CRANapclusterMaRDI QIDQ22953FDOQ22953

Affinity Propagation Clustering

Ulrich Bodenhofer, Andreas Kothmeier

Last update: 19 September 2023

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 1.4.10, 1.0.1, 1.0.2, 1.0.3, 1.1.0, 1.1.1, 1.2.0, 1.2.1, 1.3.0, 1.3.1, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.0, 1.4.1, 1.4.2, 1.4.3, 1.4.4, 1.4.5, 1.4.6, 1.4.7, 1.4.8, 1.4.9, 1.4.11

Official website: http://cran.r-project.org/web/packages/apcluster/index.html

Source code repository: https://github.com/cran/apcluster

Description

Implements Affinity Propagation clustering introduced by Frey andDueck (2007) <doi:10.1126/science.1136800>. The algorithms are largely analogous to the 'Matlab' code published by Frey and Dueck. The package further provides leveraged affinity propagation and an algorithm for exemplar-based agglomerative clustering that can also be used to join clusters obtained from affinity propagation. Various plotting functions are available for analyzing clustering results.

Cites work

• Clustering by passing messages between data points

Cited In (only showing first 100 items - show all)

• Boolean autoencoders and hypercube clustering complexity
• QCC: a novel clustering algorithm based on quasi-cluster centers
• Transfer affinity propagation-based clustering
• Medical image segmentation using fruit fly optimization and density peaks clustering
• A review of message passing algorithms in estimation of distribution algorithms
• Community detection in node-attributed social networks: a survey
• Bounded approximate decentralised coordination via the max-sum algorithm
• Affinity propagation clustering using path based similarity
• A factor graph model for unsupervised feature selection
• Linear discriminant analysis guided by unsupervised ensemble learning
• Convergence and correctness of belief propagation for the Chinese postman problem
• Biclustering with a quantum annealer
• Clustering algorithm based on mutual K‐nearest neighbor relationships
• A tree-structured framework for purifying ``complex clusters with structural roles of individual data
• Similarities, dissimilarities and types of inner products for data analysis in the context of machine learning. A mathematical characterization
• A Binary Variable Model for Affinity Propagation
• 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
• Augmented sparse reconstruction of protein signaling networks
• Metric learning by discriminant neighborhood embedding
• 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
• Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
• \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data
• Ensemble clustering using factor graph
• Iterative ensemble normalized cuts
• Robust MST-based clustering algorithm
• Dense neighborhoods on affinity graph
• Data clustering via cooperative games: a novel approach and comparative study
• Visual saliency with statistical priors
• Near-optimal large-scale k-medoids clustering
• Learning grammars for architecture-specific facade parsing
• Self-organised direction aware data partitioning algorithm
• Time is money: dynamic-model-based time series data-mining for correlation analysis of commodity sales
• Clustering and community detection in directed networks: a survey
• A novel probabilistic clustering model for heterogeneous networks
• Topographic mapping of large dissimilarity data sets
• A conditional entropy minimization criterion for dimensionality reduction and multiple kernel learning
• Shape-Modeling-with-Spline-Partitions
• A biclustering approach based on factor graphs and the max-sum algorithm
• 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
• Parallel subgradient algorithm with block dual decomposition for large-scale optimization
• 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
• 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
• Sequential minimal optimization in convex clustering repetitions
• Discrete facility location in machine learning
• Affinity propagation: An exemplar‐based tool for clustering in psychological research
• Summarization and search over geometric spaces
• Enhanced clustering embedded in curvilinear distance analysis guided by pairwise constraints
• Data-driven process decomposition and robust online distributed modelling for large-scale processes
• aal
• Affinity propagation and uncapacitated facility location problems
• An exemplar-based clustering using efficient variational message passing
• Shrinkage clustering: a fast and size-constrained algorithm for biomedical applications
• MANOVA, LDA, and FA criteria in clusters parameter estimation
• 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
• 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
• clusteval
• Fast density-weighted low-rank approximation spectral clustering
• Inference and learning with hierarchical shape models
• Point clustering via voting maximization
• TOBAE: a density-based agglomerative clustering algorithm
• Archetypoids: a new approach to define representative archetypal data
• 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
• Exemplar-based clustering via simulated annealing
• Graclus
• Clustering of imbalanced high-dimensional media data
• Mining axiomatic fuzzy set association rules for classification problems
• Finding cluster centers and sizes via multinomial parameterization
• A model for clustering data from heterogeneous dissimilarities
• AntClust
• Edgebreaker
• CECM
• archetypes
• Inc-cluster
• SA-cluster
• Darwin
• RM-MEDA
• Yale Face
• spls
• APCluster
• kohonen
• CMU Benchmarks

This page was built for software: apcluster