The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Clustering by Passing Messages Between Data Points
Abstract
Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called “affinity propagation,” which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Self-citation
Research works printed but not linked: 16
- J. MacQueen, in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, L. Le Cam, J. Neyman, Eds. (Univ. of California Press, Berkeley, CA, 1967), vol. 1, pp. 281–297.
- 10.1038/ng1630 · DOI
- 10.1093/nar/gkg111 · DOI
- C. D. Manning H. Schutze Foundations of Statistical Natural Language Processing (MIT Press Cambridge MA 1999).
- 10.1006/jcss.2002.1882 · doi:10.1006/jcss.2002.1882
- 10.1109/TIT.2005.850085 · DOI · Paper page
- S. Dasgupta, L. J. Schulman, Proc. 16th Conf. UAI (Morgan Kaufman, San Francisco, CA, 2000), pp. 152–159.
- 10.1198/1061860043001 · DOI · Paper page
- R. R. Sokal, C. D. Michener, Univ. Kans. Sci. Bull.38, 1409 (1958).
- 10.1109/34.868688 · DOI · Paper page
- 10.1126/science.1086309 · DOI
- 10.1109/18.748992 · DOI · Paper page
- 10.1109/26.539767 · DOI · Paper page
- 10.1126/science.1073287 · DOI · Paper page
- B. J. Frey, R. Koetter, N. Petrovic, in Proc. 14th Conf. NIPS (MIT Press, Cambridge, MA, 2002), pp. 737–743.
- T. Meltzer, C. Yanover, Y. Weiss, in Proc. 10th Conf. ICCV (IEEE Computer Society Press, Los Alamitos, CA, 2005), pp. 428–435.
Cited by
Clustering by fast search and find of density peaks
Rodriguez, A., & Laio, A. (2014) · Science · doi:10.1126/science.1242072 · Cited by 4,942
WebGestalt 2019: gene set analysis toolkit with revamped UIs and APIs
Liao, Y., Wang, J., Jaehnig, E. J., Shi, Z., & Zhang, B. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz401 · Cited by 3,144
Text as Data: The Promise and Pitfalls of Automatic Content Analysis Methods for Political Texts
Grimmer, J., & Stewart, B. M. (2013) · Political Analysis · doi:10.1093/pan/mps028 · Cited by 3,297
Cell types in the mouse cortex and hippocampus revealed by single-cell RNA-seq
Zeisel, A., Muñoz-Manchado, A. B., Codeluppi, S., Lönnerberg, P., La Manno, G., Juréus, A., Marques, S., Munguba, H., He, L., Betsholtz, C., et al. (2015) · Science · doi:10.1126/science.aaa1934 · Cited by 3,124
Systematic identification of genomic markers of drug sensitivity in cancer cells
Garnett, M. J., Edelman, E. J., Heidorn, S. J., Greenman, C. D., Dastur, A., Lau, K. W., Greninger, P., Thompson, I. R., Luo, X., Soares, J., et al. (2012) · Nature · doi:10.1038/nature11005 · Cited by 2,456
Metadata
- Authors
- Frey, B. J., & Dueck, D.
- Venue
- Science
- Published
- 2007-02-16
- Volume
- 315
- Issue
- 5814
- Pages
- 972-976
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2165232124
- Cited by
- 6,758
- References
- 3
- FWCI
- 232.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
