{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:44:18Z","timestamp":1758271458864},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173158"},{"type":"electronic","value":"9783642173165"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17316-5_51","type":"book-chapter","created":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T19:19:48Z","timestamp":1289503188000},"page":"537-548","source":"Crossref","is-referenced-by-count":10,"title":["TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support"],"prefix":"10.1007","author":[{"given":"Yuhua","family":"Li","sequence":"first","affiliation":[]},{"given":"Quan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ruixuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dongsheng","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"First IEEE International Conference on Data Mining (ICDM 2001)","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: First IEEE International Conference on Data Mining (ICDM 2001), pp. 313\u2013320. IEEE Computer Society, San Jose (2001)"},{"key":"51_CR2","first-page":"458","volume-title":"Second IEEE International Conference on Data Mining (ICDM 2002)","author":"N. Vanetik","year":"2002","unstructured":"Vanetik, N., Gudes, E., Shimony, S.E.: Computing Frequent Graph Patterns from Semistructured Data. In: Second IEEE International Conference on Data Mining (ICDM 2002), pp. 458\u2013465. IEEE Computer Society, Maebashi City (2002)"},{"key":"51_CR3","first-page":"549","volume-title":"3rd IEEE International Conference on Data Mining (ICDM 2003)","author":"J. Han","year":"2003","unstructured":"Han, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraph in the presence of Isomorphims. In: 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 549\u2013552. IEEE Computer Society, Melbourne (2003)"},{"key":"51_CR4","first-page":"721","volume-title":"Second IEEE International Conference on Data Mining (ICDM 2002)","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Second IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013723. IEEE Computer Society, Maebashi City (2002)"},{"key":"51_CR5","first-page":"1","volume-title":"Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations (OSDM 2005)","author":"B. Christian","year":"2005","unstructured":"Christian, B.: An Implementation of the FP-growth Algorithm. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations (OSDM 2005), pp. 1\u20135. ACM, Chicago (2005)"},{"key":"51_CR6","first-page":"286","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003)","author":"J. Han","year":"2003","unstructured":"Han, J., Yan, X.: CloseGraph: Mining Closed Frequent Graph Patterns. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 286\u2013295. ACM, Washington (2003)"},{"key":"51_CR7","unstructured":"PTamas, H., PJan, R., Stefan, W.: Frequent subgraph mining in outerplanar graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 1097\u20131111. ACM, Philadelphia (2006)"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Yan, X., Zhou, J., Han, J.: Mining closed relational graphs with connectivity constraints. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (KDD 2005), pp. 324\u2013333. ACM, Chicago (2005)","DOI":"10.1145\/1081870.1081908"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: MARGIN: Maximal Frequent Subgraph Mining. In: Proceedings of the Sixth International Conference on Data Mining (ICDM 2006), pp. 1097\u20131101. IEEE Computer Society, Hong Kong (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Wang, N., Parthasarathy, S., Tan, K., Tung, A.K.H.: CSV: visualizing and mining cohesive subgraphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (KDD 2008), pp. 445\u2013458. ACM, Vancouver (2008)","DOI":"10.1145\/1376616.1376663"},{"issue":"5","key":"51_CR11","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Trans. Knowl. Data Eng.\u00a017(5), 652\u2013664 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"51_CR12","first-page":"347","volume-title":"3rd IEEE International Conference on Data Mining (ICDM 2003)","author":"P. Tzvetkov","year":"2003","unstructured":"Tzvetkov, P., Yan, X., Han, J.: TSP: Mining Top-K Closed Sequential Patterns. In: 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 347\u2013354. IEEE Computer Society, Maebashi (2003)"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Databases. In: SIAM International Conference on Data Mining (SDM 2003), San Francisco, pp. 166\u2013177 (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/MUE.2009.67","volume-title":"The 3rd International Conference on Multimedia and Ubiquitous Engineering (MUE 2009)","author":"Y. Li","year":"2009","unstructured":"Li, Y., Lin, Q., Zhong, G.: Duan. D.: A Directed Labeled Graph Frequent Pattern Mining Algorithm based on Minimum Code. In: The 3rd International Conference on Multimedia and Ubiquitous Engineering (MUE 2009), pp. 353\u2013359. Conference Publishing Services, Qingdao (2009)"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/1557019.1557089","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009)","author":"A. Maunz","year":"2009","unstructured":"Maunz, A., Helma, C., Kramer, S.: Large-scale graph mining using backbone refinement classes. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2009), pp. 617\u2013626. ACM, Paris (2009)"},{"key":"51_CR16","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. In: 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp.413\u2013413. ACM, Baltimore (2003)"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17316-5_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:06:16Z","timestamp":1553227576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17316-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173158","9783642173165"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17316-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}