{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T01:10:08Z","timestamp":1748913008883,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319389004"},{"type":"electronic","value":"9783319389011"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38901-1_4","type":"book-chapter","created":{"date-parts":[[2016,5,5]],"date-time":"2016-05-05T08:34:23Z","timestamp":1462437263000},"page":"51-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Frequent and Homogeneous Closed Itemsets"],"prefix":"10.1007","author":[{"given":"Ines","family":"Hilali","sequence":"first","affiliation":[]},{"given":"Tao-Yuan","family":"Jen","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"Marinica","sequence":"additional","affiliation":[]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,6]]},"reference":[{"key":"4_CR1","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309\u2013328. AAAI-MIT Press, (1996)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: IEEE International Conference on Data Mining (ICDM), pp. 35\u201342 (2004)","DOI":"10.1109\/ICDM.2004.10093"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11430919_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F Bonchi","year":"2005","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 114\u2013124. Springer, Heidelberg (2005)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 74\u201385. Springer, Heidelberg (2002)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11546849_42","volume-title":"Data Warehousing and Knowledge Discovery","author":"A Casali","year":"2005","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Essential patterns: a perfect cover of frequent patterns. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 428\u2013437. Springer, Heidelberg (2005)"},{"key":"4_CR6","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-319-08732-0_7","volume-title":"Information Search, Integration, and Personalization","author":"I Hilali","year":"2014","unstructured":"Hilali, I., Jen, T.-Y., Laurent, D., Marinica, C., Ben Yahia, S.: Mining interesting disjunctive association rules from unfrequent items. In: Kawtrakul, A., Laurent, D., Spyratos, N., Tanaka, Y. (eds.) ISIP 2013. CCIS, vol. 421, pp. 84\u2013100. Springer, Heidelberg (2014)"},{"issue":"6","key":"4_CR7","first-page":"784","volume":"22","author":"C Marinica","year":"2010","unstructured":"Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE TKDE 22(6), 784\u2013797 (2010)","journal-title":"IEEE TKDE"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Natarajan, R., Shekar, B.: A relatedness-based data-driven approach to determination of interestingness of association rules. In: ACM Symposium on Applied Computing (SAC), pp. 551\u2013552. ACM (2005)","DOI":"10.1145\/1066677.1066803"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"4_CR10","unstructured":"Pei, J., Han, J., Mao, R.: Closet: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/B:FODM.0000022043.43885.55","volume":"3","author":"B Shekar","year":"2004","unstructured":"Shekar, B., Natarajan, R.: A framework for evaluating knowledge-based interestingness of association rules. Fuzzy Optim. Decis. Making 3, 157\u2013185 (2004)","journal-title":"Fuzzy Optim. Decis. Making"},{"issue":"4","key":"4_CR12","first-page":"462","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE TKDE 17(4), 462\u2013478 (2005)","journal-title":"IEEE TKDE"}],"container-title":["Communications in Computer and Information Science","Information Search, Integration and Personalization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38901-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:47:23Z","timestamp":1748911643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38901-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319389004","9783319389011"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38901-1_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"6 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}