Cited by 1,088

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Bipartite network projection and personal recommendation

Open access

Zhou, Tao, Ren, Jie, Medo, Matúš, Zhang, Yi-Cheng·2007·Physical Review E

Open this paper in CoChat — free account

Abstract

One-mode projecting is extensively used to compress bipartite networks. Since one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original information. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method for compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do a personal recommendation.

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

Crossref · 10.1103/physreve.76.046115

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

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.

Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051

Show all 2 references

Research works printed but not linked: 51

10.1038/35065725 · DOI · Paper page
10.1103/RevModPhys.74.47 · DOI · Paper page
10.1080/00018730110112519 · DOI · Paper page
10.1137/S003614450342480 · DOI · Paper page
10.1016/j.physrep.2005.10.009 · DOI · Paper page
10.1080/00018730601170527 · DOI · Paper page
10.1103/PhysRevE.68.056107 · DOI
10.1038/35082140 · DOI · Paper page
10.1038/35036627 · DOI · Paper page
J. Scott, 2000, Social Network Analysis, 10.1177/0038038588022001007 · DOI · Paper page
10.1073/pnas.021544898 · DOI · Paper page
10.1103/PhysRevE.64.016131 · DOI · Paper page
10.1038/30918 · DOI · Paper page
10.1103/PhysRevE.68.046116 · DOI · Paper page
10.1016/j.physa.2005.05.044 · DOI
10.1103/PhysRevLett.87.248701 · DOI
10.1016/j.physa.2006.04.121 · DOI
10.1103/PhysRevE.72.066107 · DOI
10.1063/1.2137622 · DOI
10.1073/pnas.0610487104 · DOI · Paper page
10.1109/MIC.2003.1167344 · DOI · Paper page
K. Yammine, 2004, Lect. Notes Comput. Sci., 3220, 720, 10.1007/978-3-540-30139-4_68 · DOI
10.1103/PhysRevE.72.066117 · DOI
10.1103/PhysRevE.72.056127 · DOI
10.1103/PhysRevE.72.046105 · DOI
10.1103/PhysRevE.70.036106 · DOI · Paper page
10.1103/PhysRevE.72.036120 · DOI
M. Peltomäki, J. Stat. Mech.: Theory Exp., 2006, P01010
J. W. Grossman, 1995, Congr. Numer., 108, 129
10.1016/S0378-4371(02)00736-7 · DOI · Paper page
10.1142/S0129183107010437 · DOI
10.1103/PhysRevE.73.016122 · DOI
10.1016/j.physa.2006.08.023 · DOI
10.1103/PhysRevE.70.056131 · DOI · Paper page
10.1016/j.physa.2004.11.039 · DOI
10.1103/PhysRevE.64.016132 · DOI · Paper page
10.1073/pnas.0307545100 · DOI · Paper page
10.1145/316194.316229 · DOI · Paper page
10.1016/S1389-1286(00)00083-9 · DOI · Paper page
10.1145/324133.324140 · DOI · Paper page
B. Alexander, 2006, Educ. Res., 41, 33
10.1509/jmkr.37.3.363.18779 · DOI · Paper page
10.1509/jmkr.43.3.355 · DOI
10.1006/jcss.2001.1757 · DOI
10.1145/345124.345143 · DOI
10.1023/A:1022850703159 · DOI · Paper page
J. L. Herlocker, 2004, ACM Trans. Inf. Syst. secur., 22, 5, 10.1145/963770.963772 · DOI · Paper page
10.1209/epl/i2006-10204-8 · DOI
10.1103/PhysRevE.75.021102 · DOI
10.1145/245108.245126 · DOI · Paper page
10.1023/A:1011419012209 · DOI · Paper page

Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
Modeling Relation Paths for Representation Learning of Knowledge Bases
Lin, Y., Liu, Z., Luan, H., Sun, M., Rao, S., & Liu, S. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1082 · Cited by 657
A review of network-based approaches to drug repositioning
Lotfi Shahreza, M., Ghadiri, N., Mousavi, S. R., Varshosaz, J., & Green, J. R. (2018) · Briefings in Bioinformatics · doi:10.1093/bib/bbx017 · Cited by 330
ProjE: Embedding Projection for Knowledge Graph Completion
Shi, B., & Weninger, T. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10677 · Cited by 218
Methods for depicting overlap in overviews of systematic reviews: An introduction to static tabular and graphical displays
Bougioukas, K. I., Vounzoulaki, E., Mantsiou, C. D., Savvides, E. D., Karakosta, C., Diakonidis, T., Tsapas, A., & Haidich, A.-B. (2021) · Journal of Clinical Epidemiology · doi:10.1016/j.jclinepi.2020.12.004 · Cited by 117
Integration of shared-pathogen networks and machine learning reveals the key aspects of zoonoses and predicts mammalian reservoirs
Wardeh, M., Sharkey, K. J., & Baylis, M. (2020) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2019.2882 · Cited by 36

Authors: Zhou, T., Ren, J., Medo, M., & Zhang, Y.-C.
Venue: Physical Review E
Publisher: American Physical Society (APS)
Published: 2007-10-25
Volume: 76
Issue: 4
Pages: 046115-046115
ISSN: 1539-3755 (ISSN-L)
1550-2376
DOI: 10.1103/physreve.76.046115
OpenAlex: W1893639437
Cited by: 1,088
References: 2
FWCI: 23.22
Type: journal article
Language: en
Open access: green
Licence: link.aps.org/licenses/aps-default-license (vor)

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.

Bipartite network projection and personal recommendation

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Self-check

Citations

Cites

Cited by

Metadata

Record

About these checks

Data sources