Using structure indices for efficient approximation of network properties

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 357-366

  Rattigan, Matthew J ^a   Maier, Marc ^a   Jensen, David ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Centrality; Knowledge discovery in graphs; Network structure index; Social network analysis

Indexed keywords

APPROXIMATION THEORY; DATA MINING; GRAPH THEORY; SET THEORY; STATISTICS;

BIOINFORMATICS; KNOWLEDGE DISCOVERY; NETWORK STRUCTURE INDEX (NSI); SOCIAL NETWORK ANALYSIS;

INTERNET;

EID: 33749555021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150443     Document Type: Conference Paper

References (28)

1. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review E, 64, 2001.
2. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996.
3. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25:163-177, 2001.
4. E. Chow. A graph search heuristic for shortest distance paths. Technical Report UCRL-JRNL-202894, Lawrence Livermore National Laboratory, 2004.
5. D. Coppersmith and S. Winograd. Matrix muliplication via arithmetic progressions. Journal of Symbolic Computing. 9:251-280, 1990.
6. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hangar. Acad. Sci. 5, 17-61. 1960.
7. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004.
8. R. W. Floyd. Algorithm 97 (shortest path). Communications of the ACM, 5(6):345, 1962.
9. L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks 1:215-239, 1979.
10. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In Proceedings of the International Joint Conference on Artificial Intelligence, 1999.
11. A.V. Goldberg and C. Harrelson. Computing the shortest path: A * search meets graph theory. In ACM-SIAM Symposium on Discrete Algorithms, 2005.
12. J. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
13. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
14. th Annual IEEE Symposium on Foundations of Computer Science, 2004.
15. R. Krauthgamer and J. R. Lee. Navigating nets: Simple algorithms for proximity search. In ACM-SIAM Symposium on Discrete Algorithms, 2004.
16. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005.
17. J. Neville and D. Jensen. Dependency networks for relational data. In Proceedings of the 4th IEEE International Conference on Data Mining, 2004.
18. T. S. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies 1:170-179, 2002.
19. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: A fast and scalable tool for data mining in massive graphs. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.
20. M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed location. In Proceedings of the 2nd International Workshop on Peer- To-Peer Systems, 2003.
21. Y. Shavitt and T. Tankel. Big-Bang simulation for embedding network distances in Euclidean space. In Proceedings of IEEE Infocom, 2003.
22. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the ACM Symposium on Principles of Distributed Computing, 2005.
23. Ö. Şimşek and D. Jensen. Decentralized search in networks using homophily and degree disparity. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005.
24. L. Tang and M. Crovella. Virtual landmarks for the Internet. In Proceedings of the Internet Measurement Conference, 2003.
25. D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.
26. D. J. Watts and S. H. Strogatz. Collective dynamics of smallworld networks. Nature, 393:440-442, 1998.
27. Wikipedia contributors (2006). Six Degrees of Kevin Bacon. Wikipedia, The Free Encyclopedia. Retrieved 15:10, April 15, 2006 from http://en.wikipedia. org/w/index.php? title=Six_Degrees_of_Kevin_Bacon&oldid=48040027.
28. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A lightweight network location service without virtual coordinates. In Proceedings of SIGCOMM, 2005.