%0 Conference Paper %1 ahmed_distributed_2013 %A Ahmed, Amr %A Shervashidze, Nino %A Narayanamurthy, Shravan %A Josifovski, Vanja %A Smola, Alexander J. %B Proceedings of the 22nd international conference on World Wide Web - WWW '13 %C Rio de Janeiro, Brazil %D 2013 %I ACM Press %K Embedding_Algorithm Matrix_Factorization Node_Embeddings %P 37--48 %R 10.1145/2488388.2488393 %T Distributed large-scale natural graph factorization %U http://dl.acm.org/citation.cfm?doid=2488388.2488393 %X 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. %@ 978-1-4503-2035-1

@inproceedings{ahmed_distributed_2013, 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.}, added-at = {2020-02-21T16:09:44.000+0100}, address = {Rio de Janeiro, Brazil}, author = {Ahmed, Amr and Shervashidze, Nino and Narayanamurthy, Shravan and Josifovski, Vanja and Smola, Alexander J.}, biburl = {https://www.bibsonomy.org/bibtex/26b4e548b352f7f60872c7d4aca3194f6/tschumacher}, booktitle = {Proceedings of the 22nd international conference on {World} {Wide} {Web} - {WWW} '13}, doi = {10.1145/2488388.2488393}, file = {Ahmed et al - Distributed Large-scale Natural Graph Factorization.pdf:C\:\\Users\\Admin\\Documents\\Research\\_Paperbase\\Graph Embeddings\\Ahmed et al - Distributed Large-scale Natural Graph Factorization.pdf:application/pdf}, interhash = {d3f3a53b9e218a2a8d8b26dc6c68c745}, intrahash = {6b4e548b352f7f60872c7d4aca3194f6}, isbn = {978-1-4503-2035-1}, keywords = {Embedding_Algorithm Matrix_Factorization Node_Embeddings}, language = {en}, pages = {37--48}, publisher = {ACM Press}, timestamp = {2020-02-21T16:09:44.000+0100}, title = {Distributed large-scale natural graph factorization}, url = {http://dl.acm.org/citation.cfm?doid=2488388.2488393}, urldate = {2020-01-27}, year = 2013 }