{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:51:19Z","timestamp":1758271879845},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319419190"},{"type":"electronic","value":"9783319419206"}],"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-41920-6_4","type":"book-chapter","created":{"date-parts":[[2016,6,26]],"date-time":"2016-06-26T21:11:43Z","timestamp":1466975503000},"page":"43-57","source":"Crossref","is-referenced-by-count":9,"title":["A Closed Frequent Subgraph Mining Algorithm in Unique Edge Label Graphs"],"prefix":"10.1007","author":[{"given":"Nour","family":"El Islem Karabadji","sequence":"first","affiliation":[]},{"given":"Sabeur","family":"Aridhi","sequence":"additional","affiliation":[]},{"given":"Hassina","family":"Seridi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1089\/cmb.2015.0134","volume":"23","author":"S Aridhi","year":"2016","unstructured":"Aridhi, S., Sghaier, H., Zoghlami, M., Maddouri, M., Nguifo, E.M.: Prediction of ionizing radiation resistance in bacteria using a multiple instance learning model. Journal of Computational Biology 23(1), 10\u201320 (2016)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"4_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M Boley","year":"2010","unstructured":"Boley, M., Horv\u00e1th, T., Poign\u00e9, A., Wrobel, S.: Listing closed sets of strongly accessible set systems with applications to data mining. Theoretical Computer Science 411(3), 691\u2013700 (2010)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","unstructured":"Cheng, J., Ke, Y., Ng, W.: Graphgen: A graph synthetic generator (2006)"},{"issue":"1\u20132","key":"4_CR4","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining-an overview. Fundamenta Informaticae 66(1\u20132), 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter, B., Reuter, K.: Finding all closed sets: A general approach. Order 8(3), 283\u2013290 (1991)","journal-title":"Order"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D., Vazirgiannis, M.: Evaluating cooperation in communities with the k-core structure. In: 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 87\u201393 (2011)","DOI":"10.1109\/ASONAM.2011.65"},{"issue":"2","key":"4_CR7","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D Gunopulos","year":"2003","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Transactions on Database Systems (TODS) 28(2), 140\u2013174 (2003)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. Data Mining and Knowledge Discovery 21(3), 472\u2013508 (2010)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 581\u2013586. ACM (2004)","DOI":"10.1145\/1014052.1014123"},{"issue":"3","key":"4_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR11","first-page":"630","volume":"242","author":"L Nourine","year":"2012","unstructured":"Nourine, L., Petit, J.M.: Extending set-based dualization: Application to pattern mining. ECAI 242, 630\u2013635 (2012)","journal-title":"ECAI"},{"key":"4_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-38901-1_2","volume-title":"Information Search, Integration and Personalization","author":"L Nourine","year":"2016","unstructured":"Nourine, L., Petit, J.M.: Dualization on partially ordered sets: Preliminary results. In: Choong, Y.W., Kotzinos, D., Spyratos, N., Tanaka, Y. (eds.) ISIP 2014. CCIS, vol. 497, pp. 23\u201334. Springer, Heidelberg (2016)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Saidi, R., Aridhi, S., Nguifo, E.M., Maddouri, M.: Feature extraction in protein sequences classification: A new stability measure. In: Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine, BCB 2012, pp. 683\u2013689. ACM, New York (2012)","DOI":"10.1145\/2382936.2383060"},{"issue":"2","key":"4_CR14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/846183.846188","volume":"1","author":"J Srivastava","year":"2000","unstructured":"Srivastava, J., Cooley, R., Deshpande, M., Tan, P.N.: Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explor. Newsl. 1(2), 12\u201323 (2000)","journal-title":"SIGKDD Explor. Newsl."},{"key":"4_CR15","unstructured":"Thomas, L., Valluri, S., Karlapalem, K.: Isg: Itemset based subgraph mining. Tech. rep., Technical Report, IIIT, Hyderabad, December 2009"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: Margin: Maximal frequent subgraph mining. ACM Transactions on Knowledge Discovery from Data (TKDD) 4(3), 10 (2010)","DOI":"10.1145\/1839490.1839491"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: FIMI, vol. 126 (2004)","DOI":"10.1145\/1133905.1133916"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 286\u2013295. ACM (2003)","DOI":"10.1145\/956750.956784"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41920-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T21:09:08Z","timestamp":1692392948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41920-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319419190","9783319419206"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41920-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}