Algorithms for estimating relative importance in networks
S. White, und P. Smyth. KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, Seite 266--275. New York, NY, USA, ACM Press, (2003)
DOI: http://doi.acm.org/10.1145/956750.956782
%0 Conference Paper
%1 956782
%A White, Scott
%A Smyth, Padhraic
%B KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
%C New York, NY, USA
%D 2003
%I ACM Press
%K pagerank networks
%P 266--275
%R http://doi.acm.org/10.1145/956750.956782
%T Algorithms for estimating relative importance in networks
%@ 1-58113-737-0
@inproceedings{956782,
added-at = {2007-01-23T12:12:38.000+0100},
address = {New York, NY, USA},
author = {White, Scott and Smyth, Padhraic},
biburl = {https://www.bibsonomy.org/bibtex/2f5a4bd069b63d6cd4b62df40e7a6af39/philipp},
booktitle = {KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining},
doi = {http://doi.acm.org/10.1145/956750.956782},
interhash = {0e9f548fe480b974dbaf0c2355938ea8},
intrahash = {f5a4bd069b63d6cd4b62df40e7a6af39},
isbn = {1-58113-737-0},
keywords = {pagerank networks},
location = {Washington, D.C.},
pages = {266--275},
publisher = {ACM Press},
timestamp = {2007-01-23T12:12:38.000+0100},
title = {Algorithms for estimating relative importance in networks},
year = 2003
}