Mining the space of graph properties

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 187-196

  Jeh, Glen ^a   Widom, Jennifer ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Data mining; Graph mining

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA MINING; JAVA PROGRAMMING LANGUAGE; LOGIC PROGRAMMING; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; SEMANTICS; SET THEORY; XML;

DATA MINING ALGORITHMS; GRAPH MINING; GRAPH STRUCTURES; INDUCTIVE DATABASES;

GRAPH THEORY;

EID: 12244255360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014075     Document Type: Conference Paper

References (26)

1. http://dbpubs.stanford.edu.
2. http://clubnexus.Stanford.edu.
3. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (VLDB), Santiago, Chile, September 1994.
4. Gaurav Bhalotia, Arvind Hulgeri, Charuta, Soumen Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In Proceedings of the 18th International Conference on Data Engineering (ICDE), San Jose, California, USA, February 2002.
5. Sergey Brin. Extracting patterns and relations from the World Wide Web. In Proceedings of the WebDB Workshop at the 6th International Conference on Extending Database Technology (EDBT), Valencia, Spain, March 1998.
6. Luc Dehaspe and Hannu TT Toivonen. Discovery of Relational Association Rules, pages 189-212. Springer-Verlag Heidelberg, Germany, 2001. http://cittsor.nj.nec.com/486120.html.
7. Bart Goethals and Jan Van den Bussche. Relational association rules: getting WARMeR. In Proceedings of the BSF Exploratory Workshop on Pattern Detection and Discovery in Data Mining, volume 2447 of Lecture Notes in Computer Science, pages 125-139, Germany, 2002. Springer-Verlag Heidelberg.
8. Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, and Hector Garcia-Molina. Proximity search in databases. In Proceedings of the &4th International Conference on Very Large Databases (VLDB), New York City, New York, USA, August 1998.
9. Taher H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the Eleventh International World Wide Web Conference (WWW), Honolulu, Hawaii, USA, May 2002.
10. Christoph Helma, Stefan Kramer, and Luc De Raedt. The molecular feature miner MolFea. In Proceedings of the Beilstein-Institut Workshop, Bozen, Italy, May 2002.
11. Tomasz Imielinski and Heikki Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58-64, 1996.
12. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the Principles of Data Mining and Knowledge Discovery, 4th European Conference (PKDD), Lyon, France, September 2000.
13. Glen Jeh and Jennifer Widom. SimRank: A measure of structural-context similarity. In Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining (KDD), Edmonton, Alberta, Canada, July 2002.
14. Glen Jeh and Jennifer Widom. Mining the space of graph properties. Technical report, Stanford University Database Group, 2003. http://dbpubs. stanford.edu/pub/2003-10.
15. Glen Jeh and Jennifer Widom. Scaling personalized web search. In Proceedings of the Twelfth International World Wide Web Conference (WWW), Budapest, Hungary, May 2003.
16. M. M. Kessler. Bibliographic coupling between scientific papers. American Documentation, 14:10-25, 1963.
17. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, USA, January 1998.
18. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. Technical report, Department of Computer Science, University of Minnesota, 2002. http://www.cs.umn.edu/~kuram/papers/feg- long.pdf.
19. Surnjani Djoko Lawrence B. Holder, Diane J. Cook. Substructure discovery in the SUBDUE system. In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases (KDD), Seattle, Washington, USA, July 1994.
20. Stephen Muggleton and Luc De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19/20:629-679, 1994.
21. Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford University Database Group, 1998. http://citeseer.nj.nec.com/368196.html.
22. Henry Small. Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the American Society for Information Science, 24:265-269, 1973.
23. Neel Sundaresan and Jeonghee Yi. Mining the web for relations. In Proceedings of the Ninth International World Wide Web Conference (WWW), Amsterdam, The Netherlands, May 2000. http://www9.org/w9cdrom/363/363.html.
24. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Vol. 1-2. W H Freeman & Co., New York City, New York, USA, 1989.
25. Xifeng Yan and Jiawei Han. gSpan: Graph-based substructure pattern mining. In Proceedings of the International Conference on Data Mining (ICDM), Maebashi City, Japan, December 2002.
26. Mohammed J. Zaki. Efficiently mining trees in a forest. In Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining (KDD), Edmonton, Alberta, Canada, July 2002.