Clustering by passing messages between data points
From MaRDI portal
Publication:80140
DOI10.1126/SCIENCE.1136800zbMATH Open1226.94027OpenAlexW2165232124WikidataQ31091773 ScholiaQ31091773MaRDI QIDQ80140FDOQ80140
Authors: Brendan J. Frey, Delbert Dueck, Brendan J. Frey, Delbert Dueck 
Publication date: 16 February 2007
Published in: Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1126/science.1136800
Recommendations
Cited In (only showing first 100 items - show all)
- Set-based granular computing: a lattice model
- 10.1162/jmlr.2003.3.4-5.747
- Boolean autoencoders and hypercube clustering complexity
- Fast density-weighted low-rank approximation spectral clustering
- Inference and learning with hierarchical shape models
- 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
- Clustering on the torus
- Frameworks for multivariate \(m\)-mediods based modeling and classification in Euclidean and general feature spaces
- 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
- Clustering of imbalanced high-dimensional media data
- Mining axiomatic fuzzy set association rules for classification problems
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee
- Bayesian cluster ensembles
- Weighted community detection and data clustering using message passing
- Adaptive affinity propagation clustering
- 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
- apcluster
- APCluster
- 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
- Robust MST-based clustering algorithm
- ClusterR
- Visualizing non-metric similarities in multiple maps
- Visual saliency with statistical priors
- On resolving simultaneous congruences using belief propagation
- Near-optimal large-scale k-medoids clustering
- Knowledge discovery by accuracy maximization
- Binary whale optimization algorithm and binary moth flame optimization with clustering algorithms for clinical breast cancer diagnoses
- 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
- Topographic mapping of large dissimilarity data sets
- Quantile-based clustering
- A rigorous analysis of the cavity equations for the minimum spanning tree
- A hybrid fuzzy K-harmonic means clustering algorithm
- Deep mixtures of unigrams for uncovering topics in textual data
- Fuzzy granular gravitational clustering algorithm for multivariate data
- Dynamic graph merging for image segmentation
- An initialization method for the \(K\)-means algorithm using neighborhood model
- Title not available (Why is that?)
- 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
- Local and global approaches of affinity propagation clustering for large scale data
- Recovery guarantees for exemplar-based clustering
- Convergence and correctness of belief propagation for weighted min-max flow
- Robust optimization with Tchebysheff decomposition for Mars entry probe design
- Quantifying statistical interdependence. III: \(N>2\) point processes
- QCC: a novel clustering algorithm based on quasi-cluster centers
- A novel optimization approach towards improving separability of clusters
- Anomaly detection in the probability simplex under different geometries
- Transfer affinity propagation-based clustering
- Medical image segmentation using fruit fly optimization and density peaks clustering
- Clustering analysis of multivariate data: a weighted spatial ranks-based approach
- Sequential minimal optimization in convex clustering repetitions
- A review of message passing algorithms in estimation of distribution algorithms
- Discrete facility location in machine learning
- Affinity propagation clustering using path based similarity
- Protein complex identification based on weighted PPI network with multi-source information
- A factor graph model for unsupervised feature selection
- Linear discriminant analysis guided by unsupervised ensemble learning
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- Nonintrusive load identification for industrial users integrated with LSQR and sequential leader clustering
- Convergence and correctness of belief propagation for the Chinese postman problem
- Three-constraints affinity matrix on simultaneous identification of the clustering and cardinality of wireless propagation multipaths
- Summarization and search over geometric spaces
- Clustering algorithm based on mutual K‐nearest neighbor relationships
- Enhanced clustering embedded in curvilinear distance analysis guided by pairwise constraints
- A novel density peaks clustering algorithm based on \(k\) nearest neighbors for improving assignment process
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- Cross-study replicability in cluster analysis
- Data-driven process decomposition and robust online distributed modelling for large-scale processes
- Similarities, dissimilarities and types of inner products for data analysis in the context of machine learning. A mathematical characterization
- A continuous entropy rate estimator for spike trains using a K-means-based context tree
- Multi-layer bundling as a new approach for determining multi-scale correlations within a high-dimensional dataset
- Accelerated sequential data clustering
- Application of affinity propagation for prototype sample detection, with application to face recognition
- Affinity propagation and uncapacitated facility location problems
- An exemplar-based clustering using efficient variational message passing
- Non-convex clustering via proximal alternating linearized minimization method
- Augmented sparse reconstruction of protein signaling networks
- IDENTIFICATION OF COMMUNITY STRUCTURE IN COMPLEX NETWORKS USING AFFINITY PROPAGATION CLUSTERING METHOD
- Metric learning by discriminant neighborhood embedding
- Shrinkage clustering: a fast and size-constrained algorithm for biomedical applications
Uses Software
This page was built for publication: Clustering by passing messages between data points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q80140)
