{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:11:25Z","timestamp":1759032685909,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T00:00:00Z","timestamp":1489795200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Nature Science Foundation of Hebei Province","award":["F2015402114","F2015402070"],"award-info":[{"award-number":["F2015402114","F2015402070"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61170190"],"award-info":[{"award-number":["61170190"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s13042-017-0655-y","type":"journal-article","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T09:32:40Z","timestamp":1489829560000},"page":"1445-1455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Uncertain maximal frequent subgraph mining algorithm based on adjacency matrix and weight"],"prefix":"10.1007","volume":"9","author":[{"given":"Di","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiadong","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,18]]},"reference":[{"key":"655_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.knosys.2015.08.018","volume":"90","author":"G Lee","year":"2015","unstructured":"Lee G, Yun U, Ryang H (2015) An uncertainty-based approach: frequent itemset mining from uncertain data with different item importance. Knowl Based Syst 90:239\u2013256","journal-title":"Knowl Based Syst"},{"key":"655_CR2","doi-asserted-by":"crossref","first-page":"1460007","DOI":"10.1142\/S0218213014600070","volume":"23","author":"N Kurumatani","year":"2014","unstructured":"Kurumatani N, Monji H, Ohkawa T (2014) Binding site extraction by similar subgraphs mining from protein molecular surfaces and its application to protein classification. Int J Artif Intell Tools 23:1460007","journal-title":"Int J Artif Intell Tools"},{"key":"655_CR3","doi-asserted-by":"crossref","first-page":"1450005","DOI":"10.1142\/S0218213014500055","volume":"23","author":"B Douar","year":"2014","unstructured":"Douar B, Latiri C, Liquiere M et al (2014) a projection bias in frequent subgraph mining can make a difference. Int J Artif Intell Tools 23:1450005","journal-title":"Int J Artif Intell Tools"},{"key":"655_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s13042-014-0253-1","volume":"7","author":"K Myithili","year":"2016","unstructured":"Myithili K, Parvathi R, Akram M (2016) Certain types of intuitionistic fuzzy directed hypergraphs. Int J Mach Learn Cybern 7:287\u2013295","journal-title":"Int J Mach Learn Cybern"},{"key":"655_CR5","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s13042-014-0267-8","volume":"7","author":"A NagoorGani","year":"2016","unstructured":"NagoorGani A, Akram M, Vijayalakshmi P (2016) Certain types of fuzzy sets in a fuzzy graph. Int J Mach Learn Cybern 7:573\u2013579","journal-title":"Int J Mach Learn Cybern"},{"key":"655_CR6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ins.2015.12.034","volume":"339","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Wang GR, Chen L et al (2016) Efficient pattern matching on big uncertain graphs. Inf Sci 339:369\u2013394","journal-title":"Inf Sci"},{"key":"655_CR7","first-page":"13","volume":"18","author":"A Lnokuchi","year":"2002","unstructured":"Lnokuchi A, Washio T, Motoda H (2002) An apriori-based algorithm for mining frequent substructures from graph data. Princ Data Min Knowl Discov 18:13\u201323","journal-title":"Princ Data Min Knowl Discov"},{"key":"655_CR8","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data, In: Proc. of the 4th European Conf. on Principles of Data Mining and Knowledge Discovery, Lyon: Springer-Verlag, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"655_CR9","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent sub-graph discovery. In: Proc. of the 2001 IEEE Int Conf. on Data Mining, San Jose: IEEE Computer Society, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"655_CR10","unstructured":"Yan X, Han J (2002) GSpanGraph-based Sub-Structure Pattern Mining, In: Proc. of the 2002 IEEE Int Conf. on Data Mining, MaebashiIEEE Computer Society, pp 721\u2013724"},{"key":"655_CR11","unstructured":"Huan J, Wang W, Prins J (2002) Efficient mining of frequent sub-graphs in the presence of isomorphism. In: Proc. of the 2003 IEEE Int Conf. on Data Mining, Melbourne: IEEE Computer Society, pp 549\u2013552"},{"key":"655_CR12","first-page":"2071","volume":"28","author":"LX Guo","year":"2011","unstructured":"Guo LX, Zhang DT, Chen L et al (2011) Research and application of data sieving algorithm based on GSpan. Appl Res Comput 28:2071\u20132072","journal-title":"Appl Res Comput"},{"key":"655_CR13","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) Closegraph: mining closed frequent graph patterns. In: Proc. of the 9th ACM SIGKDD Int Conf. on Knowledge Discovery and Data Mining, Washington: ACM, pp 286\u2013295","DOI":"10.1145\/956750.956784"},{"key":"655_CR14","doi-asserted-by":"crossref","unstructured":"J. Huan, W. Wang, J. Prins, et al, SPIN: Mining Maximal Frequent Sub-graphs from Graph Databases, In: Proc. of the 10th ACM SIGKDD Int Conf. on Knowledge Discovery and Data Mining, Seattle: ACM, pp.581-586, 2004","DOI":"10.1145\/1014052.1014123"},{"key":"655_CR15","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.3724\/SP.J.1016.2013.02146","volume":"36","author":"ZN Zou","year":"2013","unstructured":"Zou ZN, Zhu R (2013) Mining top-K maximal cliques from large uncertain graphs. Chin J Comput 36:2146\u20132155","journal-title":"Chin J Comput"},{"key":"655_CR16","first-page":"797","volume":"25","author":"MP Li","year":"2014","unstructured":"Li MP, Gao H, Zou ZN (2014) K-reach query processing based on graph compression. J Softw 25:797\u2013812","journal-title":"J Softw"},{"key":"655_CR17","first-page":"2208","volume":"49","author":"MP Li","year":"2013","unstructured":"Li MP, Zou ZN, Gao H et al (2013) Computing expected shortest distance in uncertain graph. J Comput Res Dev 49:2208\u20132220","journal-title":"J Comput Res Dev"},{"key":"655_CR18","unstructured":"Zou Z, Li JZ, Gao H et al. (2010) Discovering Frequent Subgraph Over Uncertain Graph Database Under Probabilistic Sementids, In: Proc. of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201910), Washington, DC, USA, pp 633\u2013642"},{"key":"655_CR19","first-page":"1387","volume":"33","author":"M Han","year":"2010","unstructured":"Han M, Zhang W, Li JZ (2010) RAKING: an efficient K-maximal frequent pattern mining algorithm on uncertain graph database. J Comput 33:1387\u20131395","journal-title":"J Comput"},{"key":"655_CR20","first-page":"20","volume":"3","author":"WL Wang","year":"2013","unstructured":"Wang WL, Li JZ (2013) MUSIC: an efficient of mining frequent sub-graph patterns in uncertain graph databases. Intell Comput Appl 3:20\u201323","journal-title":"Intell Comput Appl"},{"key":"655_CR21","unstructured":"Liu Y, Wang Y, Shang XQ (2014) An uncertain graph classification algorithm based on discriminative sub-graphs. Journal of Shanxi Normal University(Natural Science Edition), vol 42, pp 16\u201319"},{"key":"655_CR22","first-page":"112","volume":"51","author":"J Hu","year":"2015","unstructured":"Hu J, He LB, Mao YM et al (2015) Research of improved mining frequent subgraph patterns in uncertain graph databases. Comput Eng Appl 51:112\u2013116","journal-title":"Comput Eng Appl"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-017-0655-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0655-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0655-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T01:15:09Z","timestamp":1533604509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-017-0655-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,18]]},"references-count":22,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["655"],"URL":"https:\/\/doi.org\/10.1007\/s13042-017-0655-y","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2017,3,18]]}}}