apcluster
From MaRDI portal
Apcluster
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.
Cited in
(only showing first 100 items - show all)- Learning grammars for architecture-specific facade parsing
- Medical image segmentation using fruit fly optimization and density peaks clustering
- Near-optimal large-scale k-medoids clustering
- A factor graph model for unsupervised feature selection
- Linear discriminant analysis guided by unsupervised ensemble learning
- A rigorous analysis of the cavity equations for the minimum spanning tree
- An initialization method for the \(K\)-means algorithm using neighborhood model
- Nonlinear system identification using quasi-ARX RBFN models with a parameter-classified scheme
- Robust MST-based clustering algorithm
- Similarities, dissimilarities and types of inner products for data analysis in the context of machine learning. A mathematical characterization
- Self-organised direction aware data partitioning algorithm
- Metric learning by discriminant neighborhood embedding
- Image interpretation: mining the visible and syntactic correlation of annotated words
- Transfer affinity propagation-based clustering
- A hybrid fuzzy K-harmonic means clustering algorithm
- Clustering and community detection in directed networks: a survey
- A novel probabilistic clustering model for heterogeneous networks
- Data clustering via cooperative games: a novel approach and comparative study
- Bounded approximate decentralised coordination via the max-sum algorithm
- Visual saliency with statistical priors
- Inference and learning with hierarchical shape models
- 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
- A review of message passing algorithms in estimation of distribution algorithms
- Time is money: dynamic-model-based time series data-mining for correlation analysis of commodity sales
- Building the library of RNA 3D nucleotide conformations using the clustering approach
- Exemplar-based clustering via simulated annealing
- Topographic mapping of large dissimilarity data sets
- A conditional entropy minimization criterion for dimensionality reduction and multiple kernel learning
- Boolean autoencoders and hypercube clustering complexity
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Agglomerative clustering via maximum incremental path integral
- Classification by integrating plant stress response gene expression data with biological knowledge
- A network hierarchy-based method for functional module detection in protein-protein interaction networks
- High-dimensional clustering via random projections
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- A Binary Variable Model for Affinity Propagation
- Sparse and low-rank matrix regularization for learning time-varying Markov networks
- Merging the components of a finite mixture using posterior probabilities
- Shape-Modeling-with-Spline-Partitions
- Dense neighborhoods on affinity graph
- Affinity propagation clustering using path based similarity
- QCC: a novel clustering algorithm based on quasi-cluster centers
- Fuzzy granular gravitational clustering algorithm for multivariate data
- Shape modeling with spline partitions
- \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data
- Convergence and correctness of belief propagation for the Chinese postman problem
- Ensemble clustering using factor graph
- Iterative ensemble normalized cuts
- Biclustering with a quantum annealer
- A tree-structured framework for purifying ``complex clusters with structural roles of individual data
- Local and global approaches of affinity propagation clustering for large scale data
- A biclustering approach based on factor graphs and the max-sum algorithm
- Community detection in node-attributed social networks: a survey
- Augmented sparse reconstruction of protein signaling networks
- On resolving simultaneous congruences using belief propagation
- Point clustering via voting maximization
- TOBAE: a density-based agglomerative clustering algorithm
- A Poisson-based adaptive affinity propagation clustering for SAGE data
- Finding cluster centers and sizes via multinomial parameterization
- Graclus
- Quantile-based clustering
- Fast density-weighted low-rank approximation spectral clustering
- Overlapping community detection in networks
- Motion-based behaviour learning, profiling and classification in the presence of anomalies
- AntClust
- CLUES
- SEP/COP
- SRN/HMM
- Edgebreaker
- MOCK
- CECM
- archetypes
- Inc-cluster
- SA-cluster
- Visualizing non-metric similarities in multiple maps
- Darwin
- RM-MEDA
- Yale Face
- spls
- APCluster
- kohonen
- CMU Benchmarks
- Clara
- AS 136
- MODEVO
- ShapePheno
- sasplp.m
- breastCancerTRANSBIG
- breastCancerMAINZ
- WebSEEK
- MCQ4Structures
- DOSE
- DAVID
- PEGASUS
- Megaman
- A diffeomorphic mapping based characterization of temporal sequences: application to the pelvic organ dynamics assessment
- SpectralCAT
- RNA FRABASE
- k-means++
This page was built for software: apcluster
