Finding frequent structures in semistructured data

ICIC Express Letters

Volumn 3, Issue 2, 2009, Pages 135-140

  Shettar, Rajashree ^a   Shobha, Gangadhara T ^a  

^a R V COLLEGE OF ENGINEERING   (India)

Author keywords

Candidate generation; Frequent structures; Semi structured data; SeuS algorithm

Indexed keywords

CANDIDATE GENERATION; EXPERIMENTAL COMPARISON; FREQUENT PATTERN MINING; FREQUENT STRUCTURES; GRAPH-BASED; SEARCH SPACES; SEMI-STRUCTURED DATA; SEUS ALGORITHM; SUBGRAPHS; TWO-GRAPHS;

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MINING;

ALGORITHMS;

EID: 67649520156     PISSN: 1881803X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. K. Wang and H. Liu, Discovering structural association of semi-structured data, IEEE Transactions on Knowledge and Data Engineering, vol.12, no.3, 2000.
2. S. Abiteboul, P. Buneman and D. Suciu, Data on the Web, Morgan Kaufmann, 2000.
3. R. Agrawal and R. Srikanth, Fast algorithms for mining association rules, Proc. of the 20th International Int. Conf. on Very Large Databases, pp.487-499, Morgan Kaufmann, 1994.
4. R. C. Agrawal, C. C. Aggarwal, V. V. V. Prasad and V. Crestana, A tree projection algorithm for generation of large item sets for association rules, IBM Research Report RC21341, 1998.
5. S. Ghzizadeh and S. S. Chawathe, SEuS: Structure extraction using summaries, Proc. of the 5th International Conference on Discovery Science, LA1/4beck, Germany, 2002.
6. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc. of the 20th International Conference Very Large Databases Theory, 1994.
7. B. D. McKay, Nauty User's Guide, ver 1.5, 2002.
8. M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proc. fo tht IEEE International Conference on Data Mining, 2001.
9. A. Srinivasan, R. D. King, S. Muggleton and M. Sternberg, The predictive toxicology evaluation challenge, Proc. of the 15th International Joint Conference on Artificial Intelligence, Morgan- Kaufmann, pp.1-6, 1997.
10. A. Srinivasan, R. D. King, S. Muggleton and M. Sternberg, Carcinogenesis predictions using ILP, Proc. of the 7th International Workshop on Inductive Logic programming, Springer-Verlag, Berlin, vol.1297, pp.273-287, 1997.
11. L. Dehaspe, H. Toivonen and R. D. King, Finding frequent substructures in chemical compounds, Proc. of the 4th International Conference on Knowledge Discovery and Data Mining, AAAI Press, pp.30-36, 1998.
12. R. N. Chittimoori, L. B. Holder and D. J. Cook, Applying the SUBDUE substructure discovery system to the chemical toxicity domain, Proc. of the 12th International Florida AI Research Society Conference, pp.90-94, 1999.
13. H. Kalviainen and E. Oja, Comparisons of attributed graph matching algorithms for computer vision, Proc. of STEP-90, Finnish Artifical Intelligence Symposium, Oulu, Finland, pp.354-368, 1990.
14. D. A. L Piriyakumar and P. Levi, An efficient Aß based algorithm for optimal graph matching applied to computer vision, Proc. of the GRWSIA-98, Munich, 1998.
15. V. A. Cicirello, Intelligent Retrieval of Solid Models, Master Thesis, Drexel University, PA, 1999. Philadelphia,
16. D. Dupplaw and P. H. Lewis, Content-based image retrieval with scale spaced object trees, Proc. of SPIE: Storage and retrieval for Media Databases, vol.3972, pp.253-261, 2000.
17. L. Holder, D. Cook and S. Djoko, Substructure discovery in the SUBDUE system, Proc. of the Workshop on Knowledge Discovery in Databases, pp.169-180, 1994.
18. C.-W. K. Chen and D. Y. Y. Yun, Unifying graph-matching problem with a practical solution, Proc. of the International Conference on Systems, Signals, Control, Computers, 1998. [19] K. Yoshida and H. Motoda, CLIP: Concept learning from inference patterns, Artificial Intelligence, vol.75, no.1, pp.63-92, 1995.
19. K. Yoshida, H. Motoda and N. Indurkhya, Unifying learning methods by colored digraphs, Proc. of the International Workshop on Algorithmic Learning Theory, vol.744, pp.342-355, 1993.
20. D. J. Cook and L. B. Holder, Graph-based data mining, ISTA: Intelligent Systems & Their Applications, vol.15, 2000.
21. 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, pp.13-23, 2000.
22. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc.ofthe20thInternational Conference Very Large Data Bases, Morgan Kaufmann, pp.487-499, 1994.
23. M. Kuramochi and G. Karypis, Frequent subgraph discovery, Proc. ofthe 1st IEEE Conference on Data Mining, 2001.
24. J. Rissanen, Sochastic Complexity in Statistical Inquiry, Singapore: World Scientific Publishing, 1989.