Computing frequent graph patterns from semistructured data

作者: N. Vanetik , E. Gudes , S.E. Shimony

DOI: 10.1109/ICDM.2002.1183988

关键词: Association rule learningGraph patternsIsomorphismComputer scienceData modelGraphXMLTheoretical computer scienceNetwork topologyGraph databaseTree (graph theory)Search engine indexing

摘要: Whereas data mining in structured data focuses on frequent data values, in semistructured and graph data the emphasis is on frequent labels and common topologies. Here, the …

参考文章(16)
M. Kuramochi, G. Karypis, Frequent subgraph discovery international conference on data mining. pp. 313- 320 ,(2001) , 10.1109/ICDM.2001.989534
Ming-Syan Chen, Jong Soo Park, P.S. Yu, Efficient data mining for path traversal patterns IEEE Transactions on Knowledge and Data Engineering. ,vol. 10, pp. 209- 221 ,(1998) , 10.1109/69.683753
A. Meisels, M. Orlov, T. Maor, Discovering associations in XML data web information systems engineering. pp. 178- 183 ,(2002) , 10.1109/WISEW.2002.1177861
Xuemin Lin, Chengfei Liu, Yanchun Zhang, Xiaofang Zhou, Efficiently computing frequent tree-like topology patterns in a Web environment technology of object oriented languages and systems. pp. 440- 447 ,(1999) , 10.1109/TOOLS.1999.796518
Muralidhar Subramanian, Vishu Krishnamurthy, Performance Challenges in Object-Relational DBMSs. IEEE Data(base) Engineering Bulletin. ,vol. 22, pp. 27- 31 ,(1999)
Carmel Domshlak, Ronen I. Brafman, Solomon E. Shimony, Preference-based configuration of web page content international joint conference on artificial intelligence. pp. 1451- 1456 ,(2001)
Patric R. J. Östergård, A new algorithm for the maximum-weight clique problem Nordic Journal of Computing. ,vol. 8, pp. 424- 436 ,(2001) , 10.5555/766502.766504
Dan Suciu, Daniela Florescu, David Maier, Alin Deutsch, Mary F. Fernández, Alon Y. Levy, Querying XML Data. IEEE Data(base) Engineering Bulletin. ,vol. 22, pp. 10- 18 ,(1999)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
David Park, Concurrency and Automata on Infinite Sequences Theoretical Computer Science. pp. 167- 183 ,(1981) , 10.1007/BFB0017309