{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T12:23:46Z","timestamp":1737030226001,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708285"},{"type":"electronic","value":"9783540709015"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70901-5_9","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T14:28:43Z","timestamp":1179412123000},"page":"130-150","source":"Crossref","is-referenced-by-count":4,"title":["About the Lossless Reduction of the Minimal Generator Family of a Context"],"prefix":"10.1007","author":[{"given":"Tarek","family":"Hamrouni","sequence":"first","affiliation":[]},{"given":"Petko","family":"Valtchev","sequence":"additional","affiliation":[]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[]},{"given":"Engelbert Mephu","family":"Nguifo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., et al.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"key":"9_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-540-32262-7_13","volume-title":"Formal Concept Analysis","author":"K. Nehme","year":"2005","unstructured":"Nehme, K., et al.: On computing the minimal generator family for concept lattices and Icebergs. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 192\u2013207. Springer, Heidelberg (2005)"},{"key":"9_CR3","first-page":"66","volume-title":"Proceeding of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2(2), Boston, Massachusetts, USA","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., et al.: Mining frequent patterns with counting inference. In: Proceeding of the 6th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2(2), Boston, Massachusetts, USA, 20-23 August, 2000, pp. 66\u201375. ACM Press, New York (2000)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., et al.: Efficient mining of association rules using closed itemset lattices. J. of Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"J. of Information Systems"},{"issue":"42","key":"9_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"2","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., et al.: Computing iceberg concept lattices with Titanic. J. on Knowledge and Data Engineering (KDE)\u00a02(42), 189\u2013222 (2002)","journal-title":"J. on Knowledge and Data Engineering (KDE)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11546849_34","volume-title":"Data Warehousing and Knowledge Discovery","author":"T. Hamrouni","year":"2005","unstructured":"Hamrouni, T., Ben Yahia, S., Slimani, Y.: Prince: An algorithm for generating rule bases without closure computations. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol.\u00a03589, pp. 346\u2013355. Springer, Heidelberg (2005)"},{"key":"9_CR7","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, June 1994, pp. 478\u2013499 (1994)"},{"key":"9_CR8","unstructured":"Li, J., et al.: Minimum description length principle: Generators are preferable to closed patterns. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), Boston, Massachusetts, USA, 16-20 July, 2006, pp. 409\u2013414 (2006)"},{"key":"9_CR9","unstructured":"De Raedt, L., Ramon, J.: Condensed representations for inductive logic programming. In: Dubois, D., Welty, C. (eds.) Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), Whistler, Canada, pp. 438\u2013446 (2004)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1145\/1065167.1065215","volume-title":"Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on Principles Of Database Systems (PODS 2005), Baltimore, Maryland, USA","author":"H. Li","year":"2005","unstructured":"Li, H., et al.: Relative risk and odds ratio: a data mining perspective. In: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART symposium on Principles Of Database Systems (PODS 2005), Baltimore, Maryland, USA, pp. 368\u2013377. ACM Press, New York (2005)"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T. Calders","year":"2006","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.-F.: A survey on condensed representations for frequent sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 64\u201380. Springer, Heidelberg (2006)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. J. of Data Mining and Knowledge Discovery (DMKD)\u00a09, 223\u2013248 (2004)","journal-title":"J. of Data Mining and Knowledge Discovery (DMKD)"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/TKDE.2006.1599385","volume":"18","author":"J. Li","year":"2006","unstructured":"Li, J.: On optimal rule discovery. IEEE J. on Transactions on Knowledge and Data Engineering (TKDE)\u00a018(4), 460\u2013471 (2006)","journal-title":"IEEE J. on Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/11408079_17","volume-title":"Database Systems for Advanced Applications","author":"G. Dong","year":"2005","unstructured":"Dong, G., et al.: Mining succinct systems of minimal generators of formal concepts. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 175\u2013187. Springer, Heidelberg (2005)"},{"key":"9_CR15","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Succinct system of minimal generators: A thorough study, limitations and new definitions. In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia, 30 October \u2013 1 November, 2006, pp. 139\u2013153 (2006)"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis, p. 283. Springer, Heidelberg (1999)"},{"key":"9_CR17","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Redundancy-free generic bases of association rules. In: Proceedings of the 8th French Conference on Machine Learning (CAp 2006), Presses Universitaires de Grenoble, Tr\u00e9gastel, France, 22 - 24 May, 2006, pp. 363\u2013378 (2006)"},{"key":"9_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-32262-7_16","volume-title":"Formal Concept Analysis","author":"A. G\u00e9ly","year":"2005","unstructured":"G\u00e9ly, A., et al.: Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 235\u2013248. Springer, Heidelberg (2005)"},{"key":"9_CR19","unstructured":"Hamrouni, T., Ben Yahia, S., Mephu Nguifo, E.: Generic association rule bases: Are they so succinct? In: Proceedings of the 4th International Conference on Concept Lattices and their Applications (CLA 2006), Hammamet, Tunisia, 30 October \u2013 1 November, 2006, pp. 155\u2013169 (2006)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency structures of database relationships. In: Proceedings of IFIP Congress, Geneva, Switzerland, September 1974, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"issue":"95","key":"9_CR21","first-page":"5","volume":"24","author":"J.L. Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines.\u00a024(95), 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines."},{"key":"9_CR22","unstructured":"Valtchev, P., Duquenne, V.: Towards scalable divide-and-conquer methods for computing concepts and implications. Accepted in the Jounal of Discrete Applied Mathematics (2006)"},{"key":"9_CR23","series-title":"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.\u00a02431, pp. 74\u201385. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70901-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T11:31:06Z","timestamp":1737027066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70901-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708285","9783540709015"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70901-5_9","relation":{},"subject":[]}}