The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Distributed large-scale natural graph factorization
Abstract
Natural graphs, such as social networks, email graphs, or instant messaging patterns, have become pervasive through the internet. These graphs are massive, often containing hundreds of millions of nodes and billions of edges. While some theoretical models have been proposed to study such graphs, their analysis is still difficult due to the scale and nature of the 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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Similarity estimation techniques from rounding algorithms
Charikar, M. S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509965 · Cited by 2,220
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Niu, F., Recht, B., Re, C., & Wright, S. J. (2011) · arXiv · doi:10.48550/arxiv.1106.5730 · Cited by 1,211 · cited 2×
“This is analogous to the lock-free SGD [22], albeit in a distributed setting.”
BackgroundLarge-Scale Parallel Collaborative Filtering for the Netflix Prize
Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68880-8_32 · Cited by 700
Large-scale matrix factorization with distributed stochastic gradient descent
Gemulla, R., Nijkamp, E., Haas, P. J., & Sismanis, Y. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020426 · Cited by 589
Representations for partially exchangeable arrays of random variables
Aldous, D. J. (1981) · Journal of Multivariate Analysis · doi:10.1016/0047-259x(81)90099-3 · Cited by 442
Counting triangles and the curse of the last reducer
Suri, S., & Vassilvitskii, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963491 · Cited by 408
An architecture for parallel topic models
Smola, A., & Narayanamurthy, S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920931 · Cited by 399
Self-citationDistributed Algorithms for Topic Models
Newman, D. J., Asuncion, A., Smyth, P., & Welling, M. (2009) · Journal of Machine Learning Research · doi:10.5555/1577069.1755845 · Cited by 393
Scalable inference in latent variable models
Ahmed, A., Aly, M., Gonzalez, J., Narayanamurthy, S., & Smola, A. J. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124312 · Cited by 235
Self-citationInfinite Latent Feature Models and the Indian Buffet Process
Griffiths, T., & Ghahramani, Z. (2005) · Cambridge University Engineering Department Publications Database · Cited by 176
Scalable distributed inference of dynamic user interests for behavioral targeting
Ahmed, A., Low, Y., Aly, M., Josifovski, V., & Smola, A. J. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020433 · Cited by 169
Self-citationFast nonparametric matrix factorization for large-scale collaborative filtering
Yu, K., Zhu, S., Lafferty, J., & Gong, Y. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571979 · Cited by 165
Overlapping clusters for distributed computation
Andersen, R., Gleich, D. F., & Mirrokni, V. (2012) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2124295.2124330 · Cited by 28
Cited by
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
“Among the most recent literature is a technique called graph factorization [1].”
BackgroundMethodmetapath2vec: Scalable Representation Learning for Heterogeneous Networks
Dong, Y., Chawla, N. V., & Swami, A. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098036 · Cited by 2,210
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
GraRep: Learning Graph Representations with Global Structural Information
Cao, S., Lu, W., & Xu, Q. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806512 · Cited by 1,571
Metadata
- Authors
- Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J.
- Venue
- Proceedings of the 22nd international conference on World Wide Web
- Publisher
- ACM
- Published
- 2013-05-13
- Pages
- 37-48
- OpenAlex
- W2142535891
- Cited by
- 648
- References
- 22
- FWCI
- 5.33
- Type
- conference paper
- 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.