Mining frequent labeled and partially labeled graph patterns

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 91-102

  Vanetik, N ^a   Gudes, E ^a  

^a Department of Computer Science ^*  (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; PARTIALLY LABELED GRAPH PATTERNS; ROAD-MAP;

ALGORITHMS; DATA ACQUISITION; DATA REDUCTION; DATABASE SYSTEMS; GRAPH THEORY; INDEXING (OF INFORMATION); INFORMATION ANALYSIS; PATTERN RECOGNITION; QUERY LANGUAGES; TREES (MATHEMATICS); WEB BROWSERS; WORLD WIDE WEB; XML;

DATA MINING;

EID: 2442423029     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1319987     Document Type: Conference Paper

References (22)

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. A. Inokuchi, T. Washio, and H. Motoda, An apriori-based algorithm for mining frequent substructures from graph data, Proc. of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, Lyon, France, September 2000: 13-23.
9. M. Kuramochi and G. Karypis, Frequent Subgraph Discovery, Proceedings of IEEE ICDM, 2001.
10. M. Kuramochi and G. Karypis, Frequent Subgraph Discovery, Technical report #02-26, 2002.
11. 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.
12. V. Lipetz, A novel algorithm for subgraph isomorphism computation, manuscript, 2003.
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 Gurion University, 2002.
19. Natalia Vanetik, Ehud Gudes, Eyal Shimony, Computing frequent graph patterns from Semi-structured data, Proceedings of ICDM 2002: 458-466.
20. K. Wang, H. Liu, Discovering Typical Structures of Documents: A Road Map Approach, Proceedings of SIGIR 1998: 721-723.
21. Ke Wang, Bing Liu, Lan Yi, Gao Gong, Discovering Frequent Substructures from Hierarchical Semi-structured data, In Proc. SDM2002.
22. X. Van and J. Han, gSpan: Graph-Based Substructure Pattern Mining, Proceedings of ICDM 2002: 458-466.