{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:27:19Z","timestamp":1758266839020,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319179957"},{"type":"electronic","value":"9783319179964"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17996-4_15","type":"book-chapter","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T14:35:44Z","timestamp":1429626944000},"page":"163-173","source":"Crossref","is-referenced-by-count":8,"title":["A Parallel Algorithm for Frequent Subgraph Mining"],"prefix":"10.1007","author":[{"given":"Bay","family":"Vo","sequence":"first","affiliation":[]},{"given":"Dang","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Thanh-Long","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.: Frequent graph mining and its application to molecular databases. In: The IEEE International Conference on Systems, Man and Cybernetics (SMC 2004), pp. 4571\u20134577 (2004)","DOI":"10.1109\/ICSMC.2004.1401252"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-45640-6_5","volume-title":"WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points","author":"J.R. Punin","year":"2002","unstructured":"Punin, J.R., Krishnamoorthy, M.S., Zaki, M.J.: LOGML: Log markup language for web usage mining. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol.\u00a02356, pp. 88\u2013112. Springer, Heidelberg (2002)"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"663","DOI":"10.3233\/IDA-2007-11606","volume":"11","author":"W. Eberle","year":"2007","unstructured":"Eberle, W., Holder, L.: Anomaly detection in data represented as graphs. Intelligent Data Analysis\u00a011, 663\u2013689 (2007)","journal-title":"Intelligent Data Analysis"},{"key":"15_CR4","unstructured":"Dehaspe, L., Toivonen, H., King, R.: Finding Frequent Substructures in Chemical Compounds. In: KDD, pp. 30\u201336 (1998)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2012.12.001","volume":"7","author":"D. Nettleton","year":"2013","unstructured":"Nettleton, D.: Data mining of social networks represented as graphs. Computer Science Review\u00a07, 1\u201334 (2013)","journal-title":"Computer Science Review"},{"key":"15_CR6","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: The IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013724 (2002)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: The IEEE International Conference on Data Mining (ICDM 2003), pp. 549\u2013552 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: The IEEE International Conference on Data Mining (ICDM 2001), pp. 313-320. (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"15_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-540-87479-9_42","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"A. Gago Alonso","year":"2008","unstructured":"Gago Alonso, A., Medina Pagola, J.E., Carrasco-Ochoa, J.A., Mart\u00ednez-Trinidad, J.F.: Mining frequent connected subgraphs reducing the number of candidates. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 365\u2013376. Springer, Heidelberg (2008)"},{"key":"15_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-40511-2_9","volume-title":"Availability, Reliability, and Security in Information Systems and HCI","author":"A. Casali","year":"2013","unstructured":"Casali, A., Ernst, C.: Extracting Correlated Patterns on Multicore Architectures. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES 2013. LNCS, vol.\u00a08127, pp. 118\u2013133. Springer, Heidelberg (2013)"},{"key":"15_CR12","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: The 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann Publishers Inc. (1994)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., Shimony, S.: Computing frequent graph patterns from semistructured data. In: The IEEE International Conference on Data Mining (ICDM 2002), pp. 458\u2013465. IEEE (2002)","DOI":"10.1109\/ICDM.2002.1183988"},{"key":"15_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-30116-5_33","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"P.C. Nguyen","year":"2004","unstructured":"Nguyen, P.C., Washio, T., Ohara, K., Motoda, H.: Using a hash-based method for apriori-based graph mining. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 349\u2013361. Springer, Heidelberg (2004)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","volume":"28","author":"P. Ribeiro","year":"2014","unstructured":"Ribeiro, P., Silva, F.: G-Tries: a data structure for storing and finding subgraphs. Data Mining and Knowledge Discovery\u00a028, 337\u2013377 (2014)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/335191.335372"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Karnagel, T., Kiefer, T., Lehner, W.: Scalable frequent itemset mining on many-core processors. In: The 9th International Workshop on Data Management on New Hardware, Article No. 3. ACM (2013)","DOI":"10.1145\/2485278.2485281"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"4716","DOI":"10.1016\/j.eswa.2014.01.038","volume":"41","author":"D. Nguyen","year":"2014","unstructured":"Nguyen, D., Vo, B., Le, B.: Efficient Strategies for Parallel Mining Class Association Rules. Expert Systems with Applications\u00a041, 4716\u20134729 (2014)","journal-title":"Expert Systems with Applications"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s11227-013-0887-x","volume":"66","author":"F. Zhang","year":"2013","unstructured":"Zhang, F., Zhang, Y., Bakos, J.D.: Accelerating frequent itemset mining on graphics processing units. The Journal of Supercomputing\u00a066, 94\u2013117 (2013)","journal-title":"The Journal of Supercomputing"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1006\/jpdc.2000.1696","volume":"61","author":"D. Cook","year":"2001","unstructured":"Cook, D., Holder, L., Galal, G., Maglothin, R.: Approaches to parallel graph-based knowledge discovery. Journal of Parallel and Distributed Computing\u00a061, 427\u2013446 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"15_CR21","unstructured":"Buehrer, G., Parthasarathy, S., Nguyen, A., Kim, D., Chen, Y.-K., Dubey, P.: Parallel Graph Mining on Shared Memory Architectures. Technical report, Columbus, OH, USA (2005)"},{"key":"15_CR22","unstructured":"Kessl, R., Talukder, N., Anchuri, P., Zaki, M.: Parallel Graph Mining with GPUs. In: The 3rd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, pp. 1\u201316 (2014)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Lin, W., Xiao, X., Ghinita, G.: Large-scale frequent subgraph mining in MapReduce. In: The IEEE 30th International Conference on Data Engineering (ICDE 2014), pp. 844\u2013855. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816705"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17996-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T20:04:24Z","timestamp":1747944264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17996-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319179957","9783319179964"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17996-4_15","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}