{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:55:44Z","timestamp":1777614944358,"version":"3.51.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319405957","type":"print"},{"value":"9783319405964","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40596-4_46","type":"book-chapter","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T05:51:57Z","timestamp":1465537917000},"page":"549-561","source":"Crossref","is-referenced-by-count":3,"title":["POSGRAMI: Possibilistic Frequent Subgraph Mining in a Single Large Graph"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Moussaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Montaceur","family":"Zaghdoud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalel","family":"Akaichi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,11]]},"reference":[{"issue":"8","key":"46_CR1","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Guralnik, V., Karypis, G.: A scalable algorithm for clustering sequential data. In: Proceedings of IEEE International Conference on Data Mining, ICDM 2001, pp. 179\u2013186 (2001)","DOI":"10.1109\/ICDM.2001.989516"},{"issue":"7","key":"46_CR3","first-page":"517","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: GRAMI: frequent subgraph and pattern mining in a single large graph. PVLDB 7(7), 517\u2013528 (2014)","journal-title":"PVLDB"},{"issue":"3","key":"46_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"J McGregor","year":"1979","unstructured":"McGregor, J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229\u2013250 (1979)","journal-title":"Inf. Sci."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases, pp. 405\u2013418. ACM (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"2","key":"46_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/sam.10004","volume":"1","author":"V Chaoji","year":"2008","unstructured":"Chaoji, V., Al Hasan, M., Salem, S., Besson, J., Origami, M.J.Z.: A novel and effective approach for mining representative orthogonal graph patterns. Stat. Anal. Data Min. 1(2), 67\u201384 (2008)","journal-title":"Stat. Anal. Data Min."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Yan, X.: Closegraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Series. KDD 2003, pp. 286\u2013295. ACM, New York (2003)","DOI":"10.1137\/1.9781611972733.15"},{"issue":"10","key":"46_CR8","first-page":"1094","volume":"23","author":"S Benferhat","year":"2008","unstructured":"Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Modeling positive and negative information in possibility theory. Int. J. Inf. Syst. (IJIS) 23(10), 1094\u20131118 (2008)","journal-title":"Int. J. Inf. Syst. (IJIS)"},{"key":"46_CR9","first-page":"9","volume":"100","author":"LA Zadeh","year":"1999","unstructured":"Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. FuzzySets Syst. 100, 9\u201334 (1999)","journal-title":"FuzzySets Syst."},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1007\/978-3-540-75256-1_73","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"I Jenhani","year":"2007","unstructured":"Jenhani, I., Ben Amor, N., Elouedi, Z., Benferhat, S., Mellouli, K.: Information affinity: a new similarity measure for possibilistic uncertain information. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 840\u2013852. Springer, Heidelberg (2007)"},{"key":"46_CR11","unstructured":"Yan, X.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, Series. ICDM 2002. IEEE Computer Society, Washington, DC (2002)"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40596-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:05:45Z","timestamp":1498305945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40596-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405957","9783319405964"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40596-4_46","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}