An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda · Lecture notes in computer science · 2000
Cited by 1,039 works. doi:10.1007/3-540-45372-5_2
Authors
References
- Fast Algorithms for Mining Association Rules in Large Databases
- Fast algorithms for mining association rules
- Data mining and knowledge discovery: making sense out of data
- Levelwise Search and Borders of Theories in Knowledge Discovery
- Substructure Discovery Using Minimum Description Length and Background Knowledge
- Artificial intelligence approach to structure-activity studies. Computer automated structure evaluation of biological activity of organic molecules
- Finding frequent substructures in chemical compounds
- MULTICASE 1. A Hierarchical Computer Automated Structure Evaluation Program
- Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming.
- The Graph Isomorphism Problem