Computing frequent graph patterns from semistructured data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 458-465

  Vanetik, N ^a   Gudes, E ^a   Shimony, S E ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules, Proc. of the 20th Int'l Conf. on VLDB, Santiago, Chile, September 1994.
2. Editors: T. Bray, J. Paoli, and C. Sperberg-McQueen, Extensible markup language (XML) 1.0, February 1998, http://www.w3.org/XML/#9802xml10.
3. M.S. Chen, J. S. Park, P. S. Yu, Efficient Data Mining for Path Traversal Patterns, IEEE Transactions on Knowledge and Data Engineering, 10(2), 1998: 209-221.
4. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Maier, D. Suciu, Querying XML data, IEEE Data Engineering Bulletin 22(3), 1999: 27-34.
5. A. Deutsch, M. F. Fernandez, D. Suciu, Storing Semistructured Data with STORED, Proceedings of SIGMOD Conference 1999: 431-442.
6. C. Domshlak, R. Brafman and S.E. Shimony, Preference-based Configuration of Web Page Content, Proceedings of IJCAI, August 2001.
7. R. Goldman and J. Widom, DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases, Proc. of 23rd VLDB Conf., Athens, Greece, 1997.
8. VFLib Graph Matching Library, http://amalfi.dis.unina.it/graph/db/vflib- 2.0/doc/vflib.html.
9. M. Kuramochi and G. Karypis, Frequent Subgraph Discovery, Proceedings of IEEE ICDM, 2001.
10. X.Lin, Ch.Liu, Y.Zhang and X.Zhou, Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment, Proceedings of 31st Int. Conf. on Tech. of Object-Oriented Language and Systems, 1998.
11. Maximum weight clique program, http://www.tcs.hut.fi/~pat/wclique.html.
12. B. D. McKay, Isomorph-free exhaustive generation, Journal of Algorithms, vol. 26, 1998: 306-324.
13. A. Meisels, M. Orlov, T. Maor, Discovering associations in XML data, BGU Technical report, 2001.
14. R. Milner, Calculi for synchrony and asynchrony, Proceedings of TCS 25, 1983: 267-310.
15. Movie database, http://us.imdb.com.
16. P. R. J. Ostergard, A new algorithm for the maximum-weight clique problem, Helsinki University of Technology, internal report. 2001.
17. D.M.R. Park, Concurrency and automata on infinite sequences, Proceedings of 5th GI Conference (P.Deussen, ed.), LNCS 104, Springer-Verlag, 1981: 167-183.
18. N.Vanetik, Discovery of frequent patterns in semi-structured data, M.Sc. thesis, Dept. of Computer Science, Ben Curion University, 2002.
19. K. Wang, H. Liu, Discovering Typical Structures of Documents: A Road Map Approach, Proceedings of SIGIR 1998: 146-154.