乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T04:35:30Z","timestamp":1720931730903},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,8]],"date-time":"2005-09-08T00:00:00Z","timestamp":1126137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10618-005-0003-9","type":"journal-article","created":{"date-parts":[[2005,9,8]],"date-time":"2005-09-08T13:00:35Z","timestamp":1126184435000},"page":"243-271","source":"Crossref","is-referenced-by-count":249,"title":["Finding Frequent Patterns in a Large Sparse Graph*"],"prefix":"10.1007","volume":"11","author":[{"given":"Michihiro","family":"Kuramochi","sequence":"first","affiliation":[]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., and Raghavan, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. of 1998 ACM SIGMOD International Conference on Management of Data, pp. 94\u2013105.","DOI":"10.1145\/276304.276314"},{"key":"3_CR2","unstructured":"Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th International Conference on Very Large Data Bases (VLDB), J.B. Bocca, M. Jarke, and C. Zaniolo (Eds.), Morgan Kaufmann, pp. 487\u2013499."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proc. of the 11th International Conference on Data Engineering (ICDE), P.S. Yu and A.L.P. Chen (Eds.), IEEE Press, pp. 3\u201314.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Berendt, B., Hotho, A., and Stumme, G. 2002. Towards semantic web mining. In International Semantic Web Conference (ISWC), pp. 264\u2013278.","DOI":"10.1007\/3-540-48005-6_21"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"H.M. Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H. et al. 2000. The protein data bank. Nucleic Acids Research, 28:235\u2013242.","journal-title":"Nucleic Acids Research"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Berman, P. and Fujito, T. 1995. On the approximation properties of independent set problem in degree 3 graphs. In Proc. of Workshop on Algorithms and Data Structures, pp. 449\u2013460.","DOI":"10.1007\/3-540-60220-8_84"},{"key":"3_CR7","unstructured":"Blake, C.L. and Merz, C.J. 1998. UCI Repository of Machine Learning Databases."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Borgelt, C. and Berthold, M.R. 2002. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. of 2002 IEEE International Conference on Data Mining (ICDM), pp. 51\u201358.","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Huttenlocher, D., Kedem, K., and Kleinberg, J. 1999. Fast detection of common geometric substructure in proteins. In Proc. of the 3rd ACM RECOMB International Conference on Computational Molecular Biology, pp. 104\u2013114.","DOI":"10.1145\/299432.299464"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, M. and Gudes, E. 2004. Diagonally subgraphs pattern mining. In Proc. of the 9th ACM SIGMOD workshop on research issues in Data Mining and Knowledge Discovery DMKD '04, pp. 51\u201358.","DOI":"10.1145\/1008694.1008702"},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D.J. Cook","year":"1994","unstructured":"Cook, D.J. and 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"},{"issue":"2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J. and Holder, L.B. 2000. Graph-based data mining. IEEE Intelligent Systems, 15(2):32\u201341.","journal-title":"IEEE Intelligent Systems"},{"issue":"3","key":"3_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00962235","volume":"5","author":"D.J. Cook","year":"1995","unstructured":"Cook, D.J., Holder, L.B., and Djoko, S. 1995. Knowledge discovery from structural data. Journal of Intelligent Information Systems, 5(3):229\u2013245.","journal-title":"Journal of Intelligent Information Systems"},{"key":"3_CR14","unstructured":"Dehaspe, L., Toivonen, H., and King, R.D. 1998. Finding frequent substructures in chemical compounds. In Proc. of the 4th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-98), R. Agrawal, P. Stolorz, and G. Piatetsky-Shapiro (Eds.), AAAI Press, pp. 30\u201336."},{"key":"3_CR15","unstructured":"De Raedt, L. and Kramer, S. 2001. The level-wise version space algorithm and its application to molecular fragment finding. In Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pp. 853\u2013862."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., and Karypis, G. 2002. Automated approaches for classifying structures. In Proc. of the 2nd Workshop on Data Mining in Bioinformatics (BIOKDD '02) pp. 11\u201318.","DOI":"10.21236\/ADA439498"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., and Karypis, G. 2003. Frequent sub-structure based approaches for classifying chemical compounds. In Proc. of 2003 IEEE International Conference on Data Mining (ICDM), pp. 35\u201342.","DOI":"10.21236\/ADA439580"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Feige, U., Goldwasser, S., Lovasz, L., Safra, S., and Szegedy, M. 1991. Approximating clique is almost NP-complete. In Proc. of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 2\u201312.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"3_CR19","unstructured":"Fortin, S. 1996. The Graph Isomorphism Problem (Tech. Rep. No. TR96-20). Department of Computing Science, University of Alberta."},{"key":"3_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of np-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of np-completeness. New York: W. H. Freeman and Company."},{"key":"3_CR21","unstructured":"Ghazizadeh, S. and Chawathe, S. 2002a. Discovering Freuqent Structures Using Summaries (Tech. Rep. No. CS-TR-4364). Department of Computer Science, University of Maryland."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Ghazizadeh, S. and Chawathe, S. 2002b. SEuS: Structure extraction using summaries. In Proc. of the 5th International Conference on Discovery Science, pp. 71\u201385.","DOI":"10.1007\/3-540-36182-0_9"},{"key":"3_CR23","unstructured":"Gonzalez, J., Holder, L.B. and Cook, D.J. 2001. Application of graph-based concept learning to the predictive toxicology domain. In Proc. of the Predictive Toxicology Challenge Workshop."},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1006\/jmbi.1993.1074","volume":"229","author":"H.M. Grindley","year":"1993","unstructured":"Grindley, H.M., Artymiuk, P.J., Rice, D.W., and Willett, P. 1993. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. Journal of Molecular Biology, 229:707\u2013721.","journal-title":"Journal of Molecular Biology"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Guralnik, V. and Karypis, G. 2001. A scalabale algorithm for clustering sequence datasets. In Proc. of 2001 IEEE International Conference on Data Mining (ICDM).","DOI":"10.1109\/ICDM.2001.989516"},{"issue":"1","key":"3_CR27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., and Radhakrishnan, J. 1997. Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica, 18(1):145\u2013163.","journal-title":"Algorithmica"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In Proc. of ACM SIGMOD International Conference on Management of Data Dallas, TX, pp. 1\u201312.","DOI":"10.1145\/342009.335372"},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S. 1983. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics, 6:243\u2013254.","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR30","unstructured":"Holder, L.B., Cook, D.J., and Djoko, S. 1994. Substructure discovery in the SUBDUE system. In Proc. of the AAAI Workshop on Knowledge Discovery in Databases, pp. 169\u2013180."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Hong, M., Zhou, H., Wang, W., and Shi, B. 2003. An efficient algorithm of frequent connected subgraph extraction. In Proc. of the 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-03), Springer-Verlag, Vol. 2637, pp. 40\u201351.","DOI":"10.1007\/3-540-36175-8_5"},{"key":"3_CR32","unstructured":"Huan, J., Wang, W., and Prins, J. 2003. Efficient mining of frequent subgraph in the presence of isomophism. In Proc. of 2003 IEEE International Conference on Data Mining (ICDM'03), pp. 549\u2013552."},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., and Motoda, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'00), Lyon, France, pp. 13\u201323.","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"3","key":"3_CR34","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003, March","unstructured":"Inokuchi, A., Washio, T., and Motoda, H. 2003. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321\u2013354.","journal-title":"Machine Learning"},{"key":"3_CR35","unstructured":"Inokuchi, A., Washio, T., Nishimura, K., and Motoda, H. 2002. A Fast Algorithm for Mining Frequent Connected Subgraphs (Tech. Rep. No. RT0448). IBM Research, Tokyo Research Laboratory."},{"key":"3_CR36","unstructured":"Jensen, D. and Goldberg, H. (Eds.). 1998. Artificial Intelligence and Link Analysis Papers from the 1998 Fall Symposium. AAAI Press."},{"key":"3_CR37","first-page":"19","volume":"2","author":"I. Jonyer","year":"2001a","unstructured":"Jonyer, I., Cook, D.J., and Holder, L.B. 2001a. Discovery and evaluation of graph-based hierarchical conceptual clusters. Journal of Machine Learning Research, 2:19\u201343.","journal-title":"Journal of Machine Learning Research"},{"issue":"1\u20132","key":"3_CR38","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1142\/S0218213001000441","volume":"10","author":"I. Jonyer","year":"2001b","unstructured":"Jonyer, I., Holder, L.B., and Cook, D.J. 2001b. Hierarchical conceptual structural clustering. International Journal on Artificial Intelligence Tools, 10(1\u20132):107\u2013136.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Khanna, S., Motwani, R., Sudan, M., and Vazirani, U.V. 1994. On syntactic versus computational views of approximability. In Proc. of IEEE Symposium on Foundations of Computer Science, pp. 819\u2013830.","DOI":"10.1109\/SFCS.1994.365712"},{"issue":"5","key":"3_CR40","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M. 1999. Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), 46(5):604\u2013632.","journal-title":"Journal of the ACM (JACM)"},{"key":"3_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume":"1627","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A.S. 1999. The Web as a graph: Measurements, models and methods. Lecture Notes in Computer Science, 1627:1\u201317.","journal-title":"Lecture Notes in Computer Science"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Ko, C. 2000. Logic induction of valid behavior specifications for intrusion detection. In IEEE Symposium on Security and Privacy (S&P), pp. 142\u2013155.","DOI":"10.1109\/SECPRI.2000.848452"},{"issue":"2","key":"3_CR43","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1089\/cmb.1996.3.289","volume":"3","author":"I. Koch","year":"1996","unstructured":"Koch, I., Lengauer, T., and Wanke, E. 1996. An algorithm for finding maximal common subtopoloties in a set of protein structures. Journal of Computational Biology, 3(2):289\u2013306.","journal-title":"Journal of Computational Biology"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Kramer, S., De Raedt, L., and Helma, C. 2001. Molecular feature mining in HIV data. In Proc. of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-01), pp. 136\u2013143.","DOI":"10.1145\/502512.502533"},{"key":"3_CR45","unstructured":"Kuramochi, M., Deshpande, M., and Karypis, G. 2004. Data mining: Next generation challenges and future directions. In H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha (eds.), AAAI Press (in press), pp. 315\u2013334."},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Kuramochi, M. and Karypis, G. 2001. Frequent subgraph discovery. In Proc. of 2001 IEEE International Conference on Data Mining (ICDM), pp. 313\u2013320.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Kuramochi, M. and Karypis, G. 2002. An Efficient Algorithm for Discovering Frequent Subgraphs (Tech. Rep. No. 02-026). University of Minnesota, Department of Computer Science.","DOI":"10.21236\/ADA439497"},{"issue":"9","key":"3_CR48","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004a","unstructured":"Kuramochi, M. and Karypis, G. 2004a. An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering, 16(9):1038\u20131051.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Kuramochi, M. and Karypis, G. 2004b. Finding frequent patterns in a large sparse graph. In Proc. of the 2004 SIAM International Conference on Data Mining (SDM04).","DOI":"10.1137\/1.9781611972740.32"},{"issue":"4","key":"3_CR50","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/382912.382914","volume":"3","author":"W. Lee","year":"2000","unstructured":"Lee, W. and Stolfo, S.J. 2000. A framework for constructing features and models for intrusion detection systems. ACM Transactions on Information and System Security, 3(4):227\u2013261.","journal-title":"ACM Transactions on Information and System Security"},{"key":"3_CR51","unstructured":"Leibowitz, N., Fligelman, Z.Y., Nussinov, R., and Wolfson, H.J. 1999. Multiple structural alignment and core detection by geometric hashing. In Proc. of the 7th international conference on intelligent systems in molecular biology, Heidelberg: Germany, pp. 169\u2013177."},{"issue":"2","key":"3_CR52","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1089\/106652701300312896","volume":"8","author":"N. Leibowitz","year":"2001","unstructured":"Leibowitz, N., Nussinov, R., and Wolfson, H.J. 2001. MUSTA\u2014a general, efficient, automated method for multiple structure alignment and detection of common motifs: Application to proteins. Journal of Computational Biology, 8(2):93\u2013121.","journal-title":"Journal of Computational Biology"},{"key":"3_CR53","unstructured":"Li, W., Han, J., and Pei, J. 2001. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proc. of 2001 IEEE International Conference on Data Mining (ICDM), pp. 369\u2013376."},{"key":"3_CR54","unstructured":"Liu, B., Hsu, W., and Ma, Y. 1998. Integrating classification and association rule mining. In Proc. of the 4th Internation Conference on Knowledge Discovery and Data Mining (kdd-98), pp. 80\u201386."},{"key":"3_CR55","unstructured":"McKay, B.D. (n.d.). Nauty users guide. http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"key":"3_CR56","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D. 1981. Practical graph isomorphism. Congressus Numerantium, 30:45\u201387.","journal-title":"Congressus Numerantium"},{"key":"3_CR57","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0022-2836(90)90312-A","volume":"212","author":"E.M. Mitchell","year":"1989","unstructured":"Mitchell, E.M., Artymiuk, P.J., Rice, D.W., and Willett, P. 1989. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. Journal of Molecular Biology, 212:151\u2013166.","journal-title":"Journal of Molecular Biology"},{"key":"3_CR58","unstructured":"Mooney, R.J., Melville, P., Tang, L.R., Shavlik, J., Castro Dutra, I. de, Page, D. et al. 2004. Relational data mining with inductive logic programming for link discovery. In AAAI Press\/The MIT Press, pp. 239\u2013255."},{"issue":"11","key":"3_CR59","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/319382.319390","volume":"42","author":"S.H. Muggleton","year":"1999","unstructured":"Muggleton, S.H. 1999. Scientific knowledge discovery using Inductive Logic Programming. Communications of the ACM, 42(11):42\u201346.","journal-title":"Communications of the ACM"},{"key":"3_CR60","first-page":"195","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J. 2002. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120:195\u2013205.","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"Palmer, C.R., Gibbons, P.B., and Faloutsos, C. 2002. ANF: A fast and scalable tool for data mining in massive graphs. In Proc. of the 8th ACM SIGKDD Internal Conference on Knowlege Discovery and Data Mining (KDD-2002) Edmonton, AB, Canada, pp. 81\u201390.","DOI":"10.1145\/775047.775059"},{"issue":"6","key":"3_CR62","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1093\/bioinformatics\/14.6.516","volume":"14","author":"X. Pennec","year":"1998","unstructured":"Pennec, X. and Ayache, N. 1998. A geometric algorithm to find small but highly simialar 3D substructures in proteins. Bioinformatics, 14(6):516\u2013522.","journal-title":"Bioinformatics"},{"key":"3_CR63","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1021\/ci010381f","volume":"42","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W. 2002. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J. Chem. Inf. Comput. Sci., 42:305\u2013316.","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"3_CR64","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R.C. Read","year":"1977","unstructured":"Read, R.C. and Corneil, D.G. 1977. The graph isomorph disease. Journal of Graph Theory, 1:339\u2013363.","journal-title":"Journal of Graph Theory"},{"key":"3_CR65","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J.M. Robson","year":"1986","unstructured":"Robson, J.M. 1986. Algorithms for maximum independent sets. Journal of Algorithms, 7:425\u2013440.","journal-title":"Journal of Algorithms"},{"key":"3_CR66","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., King, R.D., Muggleton, S.H., and Sternberg, M.J.E. 1997. Carcinogenesis predictions using ILP. In Proc. of the 7th International Workshop on Inductive Logic Programming S. D\u017eeroski and N. Lavra\u010d (Eds.), Springer-Verlag, (Vol. 1297, pp. 273\u2013287).","DOI":"10.1007\/3540635149_56"},{"key":"3_CR67","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., and Shimony, S.E. 2002. Computing frequent graph patterns from semistructured data. In Proc. of 2002 IEEE International Conference on Data Mining (ICDM), pp. 458\u2013465.","DOI":"10.1109\/ICDM.2002.1183988"},{"issue":"4","key":"3_CR68","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TKDE.2002.1019211","volume":"14","author":"X. Wang","year":"2002","unstructured":"Wang, X., Wang, J.T.L., Shasha, D., Shapiro, B.A., Rigoutsos, I., and Zhang, K. 2002. Finding patterns in three dimensional graphs: Algorithms and applications to scientific data mining. IEEE Transactions on Knowledge and Data Engineering, 14(4):731\u2013749.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3_CR69","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K., and Iacobucci, D. 1994. Social network analysis : Methods and applications. Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"3_CR70","unstructured":"Yan, X. and Han, J. 2002. gSpan: Graph-based substructure pattern mining. In Proc. of 2002 IEEE International Conference on Data Mining (ICDM), pp. 721\u2013724."},{"key":"3_CR71","doi-asserted-by":"crossref","unstructured":"Yan, X. and Han, J. 2003. CloseGraph: Mining closed frequent graph patterns. In Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), pp. 286\u2013295.","DOI":"10.1145\/956750.956784"},{"issue":"1","key":"3_CR72","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. and Motoda, H. 1995. CLIP: Concept learning from inference patterns. Artificial Intelligence, 75(1):63\u201392.","journal-title":"Artificial Intelligence"},{"key":"3_CR73","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00872095","volume":"4","author":"K. Yoshida","year":"1994","unstructured":"Yoshida, K., Motoda, H., and Indurkhya, N. 1994. Graph-based induction as a unified learning framework. Journal of Applied Intelligence, 4:297\u2013328.","journal-title":"Journal of Applied Intelligence"},{"key":"3_CR74","doi-asserted-by":"crossref","unstructured":"Zaki, M.J. and Gouda, K. 2003. Fast vertical mining using diffsets. In Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), pp. 326\u2013335.","DOI":"10.1145\/956750.956788"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0003-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-005-0003-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-005-0003-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T09:59:17Z","timestamp":1586426357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-005-0003-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,8]]},"references-count":73,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s10618-005-0003-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,8]]}}}