The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Superparamagnetic Clustering of Data
Abstract
We present a new approach for clustering, based on the physical properties of an inhomogeneous ferromagnetic model. We do not assume any structure of the underlying distribution of the data. A Potts spin is assigned to each data point and short range interactions between neighboring points are introduced. Spin-spin correlations, measured (by Monte Carlo procedure) in a superparamagnetic regime in which aligned domains appear, serve to partition the data points into clusters. Our method outperforms other algorithms for toy problems as well as for real data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Pattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
Fortuin, C. M., & Kasteleyn, P. W. (1972) · Physica · doi:10.1016/0031-8914(72)90045-6 · Cited by 1,741
Statistical mechanics and phase transitions in clustering
Rose, K., Gurewitz, E., & Fox, G. C. (1990) · Physical Review Letters · doi:10.1103/physrevlett.65.945 · Cited by 458
Principles of Statistical Mechanics
Katz, A. (1967) · Cited by 384
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
“The existing methods for finding communities in large networks are useful if the community structure is such that it can be interpreted in terms of separated sets of communities (see Fig. 1b and Refs. [10, 15 , 16, 17, 18]).”
MethodComparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Clustering of the self-organizing map
Vesanto, J., & Alhoniemi, E. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846731 · Cited by 2,680
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Unsupervised spike detection and sorting with wavelets and superparamagnetic clustering
Quiroga, R. Q., Nadasdy, Z., & Ben-Shaul, Y. (2004) · Neural Computation · doi:10.1162/089976604774201631 · Cited by 2,119
Statistical mechanics of community detection
Reichardt, J., & Bornholdt, S. (2006) · Physical Review E · doi:10.1103/physreve.74.016110 · Cited by 2,048
the Immunological Genome Consortium, Gautier, E. L., Shay, T., Miller, J., Greter, M., Jakubzick, C., Ivanov, S., Helft, J., Chow, A., Elpek, K. G., et al. (2012) · Nature Immunology · doi:10.1038/ni.2419 · Cited by 1,972
Protein complexes and functional modules in molecular networks
Spirin, V., & Mirny, L. A. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2032324100 · Cited by 1,461
Yanai, I., Benjamin, H., Shmoish, M., Chalifa-Caspi, V., Shklar, M., Ophir, R., Bar-Even, A., Horn-Saban, S., Safran, M., Domany, E., et al. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti042 · Cited by 1,300
Self-citationCluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Induction of pathogenic TH17 cells by inducible salt-sensing kinase SGK1
Wu, C., Yosef, N., Thalhamer, T., Zhu, C., Xiao, S., Kishi, Y., Regev, A., & Kuchroo, V. K. (2013) · Nature · doi:10.1038/nature11984 · Cited by 1,022
Overlapping community detection in networks: The state-of-the-art and comparative study
Xie, J., Kelley, S., & Szymanski, B. K. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501657 · Cited by 930
Evaluation of clustering algorithms for protein-protein interaction networks
Brohée, S., & van Helden, J. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-488 · Cited by 892
Overlapping Community Detection in Networks: the State of the Art and Comparative Study
Xie, J., Kelley, S., & Szymanski, B. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.5813 · Cited by 865
Coupled two-way clustering analysis of gene microarray data
Getz, G., Levine, E., & Domany, E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.210134797 · Cited by 813
Self-citationDeciphering the transcriptional network of the dendritic cell lineage
the Immunological Genome Consortium, Miller, J. C., Brown, B. D., Shay, T., Gautier, E. L., Jojic, V., Cohain, A., Pandey, G., Leboeuf, M., Elpek, K. G., et al. (2012) · Nature Immunology · doi:10.1038/ni.2370 · Cited by 781
Murat, A., Migliavacca, E., Gorlia, T., Lambiv, W. L., Shay, T., Hamou, M.-F., de Tribolet, N., Regli, L., Wick, W., Kouwenhoven, M. C. M., et al. (2008) · Journal of Clinical Oncology · doi:10.1200/jco.2007.15.7164 · Cited by 721
Self-citationclusterMaker: a multi-algorithm clustering plugin for Cytoscape
Morris, J. H., Apeltsin, L., Newman, A. M., Baumbach, J., Wittkop, T., Su, G., Bader, G. D., & Ferrin, T. E. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-436 · Cited by 621
Detecting Fuzzy Community Structures in Complex Networks with a Potts Model
Reichardt, J., & Bornholdt, S. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.218701 · Cited by 593
Clique Percolation in Random Networks
Derényi, I., Palla, G., & Vicsek, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.160202 · Cited by 558
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Correlation, hierarchies, and networks in financial markets
Tumminello, M., Lillo, F., & Mantegna, R. N. (2010) · Journal of Economic Behavior & Organization · doi:10.1016/j.jebo.2010.01.004 · Cited by 380
Detecting network communities: a new systematic and efficient algorithm
Donetti, L., & Muñoz, M. A. (2004) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2004/10/p10012 · Cited by 374
Econophysics review: I. Empirical facts
Chakraborti, A., Toke, I. M., Patriarca, M., & Abergel, F. (2011) · Quantitative Finance · doi:10.1080/14697688.2010.539248 · Cited by 345
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Defining transcription modules using large-scale gene expression data
Ihmels, J., Bergmann, S., & Barkai, N. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth166 · Cited by 338
DNA microarrays identification of primary and secondary target genes regulated by p53
Kannan, K., Amariglio, N., Rechavi, G., Jakob-Hirsch, J., Kela, I., Kaminski, N., Getz, G., Domany, E., & Givol, D. (2001) · Oncogene · doi:10.1038/sj.onc.1204319 · Cited by 331
Self-citationNef, S., Schaad, O., Stallings, N. R., Cederroth, C. R., Pitetti, J.-L., Schaer, G., Malki, S., Dubois-Dauphin, M., Boizet-Bonhoure, B., Descombes, P., et al. (2005) · Developmental Biology · doi:10.1016/j.ydbio.2005.09.008 · Cited by 283
Börner, K., Sanyal, S., & Vespignani, A. (2007) · Annual Review of Information Science and Technology · doi:10.1002/aris.2007.1440410119 · Cited by 279
Resampling Method for Unsupervised Estimation of Cluster Validity
Levine, E., & Domany, E. (2001) · Neural Computation · doi:10.1162/089976601753196030 · Cited by 271
Self-citationBiclustering on expression data: A review
Pontes, B., Giráldez, R., & Aguilar-Ruiz, J. S. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.06.028 · Cited by 256
The modular architecture of protein–protein binding interfaces
Reichmann, D., Rahat, O., Albeck, S., Meged, R., Dym, O., & Schreiber, G. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407280102 · Cited by 239
Automated long-term recording and analysis of neural activity in behaving animals
Dhawale, A. K., Poddar, R., Wolff, S. B., Normand, V. A., Kopelowitz, E., & Ölveczky, B. P. (2017) · eLife · doi:10.7554/elife.27702 · Cited by 159
Tabach, Y., Milyavsky, M., Shats, I., Brosh, R., Zuk, O., Yitzhaky, A., Mantovani, R., Domany, E., Rotter, V., & Pilpel, Y. (2005) · Molecular Systems Biology · doi:10.1038/msb4100030 · Cited by 72
Self-citationReal-Time Image Segmentation on a GPU
Abramov, A., Kulvicius, T., Wörgötter, F., & Dellen, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16233-6_14 · Cited by 34
High-performance dynamic quantum clustering on graphics processors
Wittek, P. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.08.048 · Cited by 16
A NEW MEASURE FOR PARTY COHERENCE: APPLYING A PHYSICS-BASED CONCEPT TO THE SWISS PARTY SYSTEM
CHRISTEN, M., OTT, T., & SCHWARZ, D. (2013) · Advances in Complex Systems · doi:10.1142/s0219525913500112 · Cited by 1
Metadata
- Authors
- Blatt, M., Wiseman, S., & Domany, E.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1996-04-29
- Volume
- 76
- Issue
- 18
- Pages
- 3251-3254
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2043154233
- Cited by
- 537
- References
- 15
- FWCI
- 3.36
- 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.