{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T05:37:22Z","timestamp":1791265042839,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021726221443","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T21:15:11Z","timestamp":1048194911000},"page":"321-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":199,"title":["Complete Mining of Frequent Patterns from Graphs: Mining Graph Data"],"prefix":"10.1007","volume":"50","author":[{"given":"Akihiro","family":"Inokuchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Washio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5110572_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proc. of Twentyth Very Large Dada Base Conference: VLDB'94 (pp. 487\u2013499)."},{"key":"5110572_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., & Srikant, R. (1995). Mining sequential patterns. In Proc. of Eleventh International Conference on Data Engineering: ICDE'95 (pp. 3\u201314).","DOI":"10.1109\/ICDE.1995.380415"},{"key":"5110572_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. L. Barabasi","year":"1999","unstructured":"Barabasi, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509\u2013512.","journal-title":"Science"},{"key":"5110572_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic graph theory","author":"N. Biggs","year":"1974","unstructured":"Biggs, N. (1974). Algebraic graph theory. Cambridge: Cambridge University Press."},{"issue":"2","key":"5110572_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"M. S. Chen","year":"1998","unstructured":"Chen, M. S., Park, J. S., & Yu, P. S. (1998). Efficient data mining for path traversal patterns. IEEE Transaction on Knowledge and Data Engineering, 10:2, 209\u2013221.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"5110572_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D. J. Cook","year":"1994","unstructured":"Cook, D. J., & Holder, L. B. (1994). Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1, 231\u2013255.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5110572_CR7","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"A. K. Debnath","year":"1991","unstructured":"Debnath, A. K. et al. (1991). Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. J. Med. Chem, 34, 786\u2013797.","journal-title":"J. Med. Chem"},{"key":"5110572_CR8","unstructured":"Dehaspe, L., Toivonen, H., & King, R. D. (1998). Finding frequent substructures in chemical compound. In Proc. of Fourth International Conference on Knowledge Discovery and Data Mining: KDD'98 (pp. 30\u201336)."},{"key":"5110572_CR9","first-page":"853","volume":"2","author":"L. de Raedt","year":"2001","unstructured":"de Raedt, L., & Kramer, S. (2001). The levelwise version space algorithm and its application to molecular fragment finding. In Proc. of Seventeenth International Joint Conference on Artificial Intelligence: IJCAI'01 (Vol. 2) (pp. 853\u2013859).","journal-title":"Proc. of Seventeenth International Joint Conference on Artificial Intelligence: IJCAI'01"},{"key":"5110572_CR10","series-title":"Technical Report","volume-title":"The graph isomorphism problem","author":"S. Fortin","year":"1996","unstructured":"Fortin, S. (1996). The graph isomorphism problem. Technical Report 96-20, University of Alberta, Edmonton, Alberta, Canada."},{"key":"5110572_CR11","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"key":"5110572_CR12","unstructured":"Geibel, P., & Wysotzki, F. (1996). Learning relational concepts with decision trees. In Proc. of Thirteenth International Conference on Machine Learning: ICML'96 (pp. 166\u2013174)."},{"issue":"1\/2","key":"5110572_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(95)00050-X","volume":"81","author":"T. Hogg","year":"1996","unstructured":"Hogg, T. (1996). Refining the phase transition in combinatorial search. Artificial Intelligence, 81:1\/2, 127\u2013154.","journal-title":"Artificial Intelligence"},{"key":"5110572_CR14","doi-asserted-by":"crossref","unstructured":"Inokuchi, A. Washio, T., & Motoda, H. (1999). Basket analysis for graph structured data. In Proc. of Third Pacific-Asia Conference on Knowledge Discovery and Data Mining: PAKDD'99 (pp. 420\u2013431).","DOI":"10.1007\/3-540-48912-6_56"},{"key":"5110572_CR15","unstructured":"Inokuchi, A. et al. (2000). Application of frequent substructure mining to mutagenesis data analysis. Working notes of International Workshop of KDD Challenge on Real-world Data, PAKDD2000."},{"key":"5110572_CR16","doi-asserted-by":"crossref","unstructured":"Kann, V. (1995). Strong lower bounds on the approximability of some NPO PB-complete maximization problem. In MFCS 95, LNCS (Vol. 969) (pp. 227\u2013236).","DOI":"10.1007\/3-540-60246-1_129"},{"key":"5110572_CR17","unstructured":"Liquiere, M., & Sallantin, J. (1998). Structural machine learning with Galois lattice and graphs. In Proc. of Fifteenth International Conference on Machine Learning: ICML'98 (pp. 305\u2013313)."},{"issue":"3","key":"5110572_CR18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., & Verkamo, A. I. (1997). Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1:3, 259\u2013289.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5110572_CR19","unstructured":"Mckay, B.D. (1990). NAUTY users guide (version 1.5). Technical Report, TR-CS-90-02, Department of Computer Science, Australian National University."},{"key":"5110572_CR20","first-page":"891","volume":"2","author":"S. Nijssen","year":"2001","unstructured":"Nijssen, S., & Kok, J. N. (2001). Faster association rules for multiple relations. In Proc. of Seventeenth International Joint Conference on Artificial Intelligence: IJCAI'01 (Vol. 2) (pp. 891\u2013896).","journal-title":"Proc. of Seventeenth International Joint Conference on Artificial Intelligence: IJCAI'01"},{"key":"5110572_CR21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R. Read","year":"1977","unstructured":"Read, R., & Corneil, D. (1977). The graph isomorphism disease. Journal of Graph Theory, 1, 339\u2013363.","journal-title":"Journal of Graph Theory"},{"key":"5110572_CR22","unstructured":"Srikant, R., Vu, Q., & Agrawal, R. (1997). Mining association rules with item constraints. In Proc. of Third International Conference on Knowledge Discovery and Data Mining: KDD'97 (pp. 67\u201373)."},{"key":"5110572_CR23","unstructured":"Srinivasan, A., King, R. D., Muggleton, S. H., & Sternberg, M. J. E. (1997). The predictive toxicology evaluation challenge. In Proc. of Fifteenth International Joint Conference on Artificial Intelligence: IJCAI'97 (pp. 4\u20139)."},{"issue":"1","key":"5110572_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J. R. Ullman","year":"1976","unstructured":"Ullman, J. R. (1976). An algorithm for subgraph isomorphism. Journal of the ACM, 23:1, 31\u201332.","journal-title":"Journal of the ACM"},{"key":"5110572_CR25","unstructured":"Walsh, T. (2001). Search on high degree graphs. In Proc. of Seventeenth International Conference on Artificial Intelligence: IJCAI'2001 (pp. 266\u2013271)."},{"key":"5110572_CR26","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. J. Watts","year":"1998","unstructured":"Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of small-world networks. Nature, 393, 440\u2013442.","journal-title":"Nature"},{"issue":"1","key":"5110572_CR27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","volume":"75","author":"K. Yoshida","year":"1995","unstructured":"Yoshida, K., & Motoda, H. (1995). Clip: Concept learning from inference pattern. Artificial Intelligence, 75:1, 63\u201392.","journal-title":"Artificial Intelligence"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021726221443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021726221443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021726221443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:42:13Z","timestamp":1752147733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021726221443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5110572"],"URL":"https:\/\/doi.org\/10.1023\/a:1021726221443","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}