ANF: A fast and scalable tool for data mining in massive graphs

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

Volumn , Issue , 2002, Pages 81-90

  Palmer, Christopher R ^a   Gibbons, Phillip B ^b   Faloutsos, Christos ^a  

^a Carnegie Mellon University   (United States)

^b INTEL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; GRAPH THEORY; TELECOMMUNICATION TRAFFIC; WORLD WIDE WEB;

BINARY RELATIONAL TABLE; DATA MINING TOOL;

DATA MINING;

EID: 0242625288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. L. A. Adamic. The small world Web. In Proceedings of the European Conf. on Digital Libraries, 1999.
2. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
3. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, and R. Stata. Graph structure in the Web. In Proceedings of the 9th International World Wide Web Conference, pages 247-256, 2000.
4. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441-453, December 1997.
5. Cook and Holder. Graph-based data mining. ISTA: Intelligent Systems & their applications, 15, 2000.
6. CORA search engine. http://www.cora.whizbang.com.
7. P. Domingos and M. Richardson. Mining the network value of customers. In KDD-2001, pages 57-66, 2001.
8. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, 1999.
9. P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31:182-209, 1985.
10. IMDB. http://www.imdb.com.
11. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PDKK, pages 13-23, 2000.
12. http://cs.bell-labs.com/who/ches/map/.
13. S. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. The Web as a graph. In ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 1-10, 2000.
14. R. J. Lipton and J. F. Naughton. Estimating the size of generalized transitive closures. In Proceedings of 15th International Conference on Very Large Data Bases, pages 315-326, 1989.
15. M. H. Nodine, M. T. Goodrich, and J. S. Vitter. Blocking for external graph search. In Proc. ACM PODS Conference (PODS-93), pages 222-232, 1993.
16. C. R. Palmer, G. Siganos, M. Faloutsos, C. Faloutsos, and P. Gibbons. The connectivity and fault-tolerance of the Internet topology. In Workshop on Network-Related Data Management (NRDM-2001), 2001.
17. C. R. Palmer and J. G. Steffan. Generating network topologies that obey power laws. In IEEE Globecom 2000, 2000.
18. G. Salton and M. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
19. http://www.isi.edu/scam/mercator/maps.html.
20. S. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the Internet topology. In IEEE Globecom 2001, 2001.