{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:14:00Z","timestamp":1738214040301,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789208"},{"type":"electronic","value":"9783540789215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78921-5_12","type":"book-chapter","created":{"date-parts":[[2008,3,12]],"date-time":"2008-03-12T07:51:29Z","timestamp":1205308289000},"page":"186-197","source":"Crossref","is-referenced-by-count":1,"title":["Galois Lattices and Bases for MGK-Valid Association Rules"],"prefix":"10.1007","author":[{"given":"Jean","family":"Diatta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel R.","family":"Feno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Totohasina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Hilderman, R.J., Hamilton, H.J.: Knowledge discovery and interestingness measures: A survey. Technical Report CS 99-04, Department of Computer Science, University of Regina (1999)"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proc. of the ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) Proc. of the ACM SIGMOD International Conference on Management of Data, Washington, vol.\u00a022, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"12_CR3","unstructured":"Guillaume, S.: Traitement des donn\u00e9es volumineuses. Mesures et algorithmes d\u2019extraction des r\u00e8gles d\u2019association et r\u00e8gles ordinales. PhD thesis, Universit\u00e9 de Nantes, France (2000)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"22","author":"X. Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S.: Mining both positive and negative rules. ACM J. Information Systems\u00a022, 381\u2013405 (2004)","journal-title":"ACM J. Information Systems"},{"key":"12_CR5","unstructured":"Feno, D., Diatta, J., Totohasina, A.: Normalis\u00e9e d\u2019une mesure probabiliste de qualit\u00e9 des r\u00e8gles d\u2019association: \u00e9tude de cas. In: Actes du 2nd Atelier Qualit\u00e9 des Donn\u00e9es et des Connaissances, Lille, France, pp. 25\u201330 (2006)"},{"key":"12_CR6","unstructured":"Birkhoff, G.: Lattice theory. 3rd edn., Coll. Publ., XXV. American Mathematical Society, Providence, RI (1967)"},{"key":"12_CR7","first-page":"5","volume":"95","author":"J.L. Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Famille non redondante d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences humaines\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences humaines"},{"key":"12_CR8","first-page":"35","volume":"113","author":"M. Luxemburger","year":"1991","unstructured":"Luxemburger, M.: Implications partielles dans un contexte. Math. Inf. Sci. hum.\u00a0113, 35\u201355 (1991)","journal-title":"Math. Inf. Sci. hum."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proc. of the ACM SIGMOD Conference, pp. 255\u2013264 (1997)","DOI":"10.1145\/253260.253325"},{"key":"12_CR10","first-page":"5","volume":"74","author":"I. Lerman","year":"1981","unstructured":"Lerman, I., Gras, R., Rostam, H.: Elaboration et \u00e9valuation d\u2019un indice d\u2019implication pour des donn\u00e9es binaires. Math Sc. Hum.\u00a074, 5\u201335 (1981)","journal-title":"Math Sc. Hum."},{"key":"12_CR11","unstructured":"Huynh, X., Guillet, F., Briand, H.: Une plateforme exploratoire pour la qualit\u00e9 des r\u00e8gles d\u2019association: Apport pour l\u2019analyse implicative. In: Troisi\u00e8mes Rencontres Internationales A.S.I., pp. 339\u2013349 (2005)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlation. In: Proc. of the ACM SIGMOD Conference, pp. 265\u2013276 (1997)","DOI":"10.1145\/253260.253327"},{"key":"12_CR13","unstructured":"Totohasina, A., Ralambondrainy, H.: Lon: A pertinent new measure for mining information from many types of data. In: IEEE SITIS 2005, pp. 202\u2013207 (2005)"},{"key":"12_CR14","unstructured":"Barbut, M., Monjardet, B.: Ordre et classification. In: Hachette, Paris (1970)"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered sets, pp. 445\u2013470. Ridel, Dordrecht-Boston (1982)"},{"key":"12_CR16","first-page":"580","volume":"74","author":"W.W. Armstrong","year":"1974","unstructured":"Armstrong, W.W.: Dependency structures of data base relationships. Information Processing\u00a074, 580\u2013583 (1974)","journal-title":"Information Processing"},{"key":"12_CR17","unstructured":"Diatta, J.: Charact\u00e9risation des ensembles critiques d\u2019une famille de Moore finie. In: Rencontres de la Soci\u00e9t\u00e9 Francophone de Classification, Montr\u00e9al, Canada, pp. 126\u2013129 (2005)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1142\/S0218196792000256","volume":"2","author":"A. Day","year":"1992","unstructured":"Day, A.: The lattice theory of functional dependencies and normal decompositions. Internat. J. Algebra Comput.\u00a02, 409\u2013431 (1992)","journal-title":"Internat. J. Algebra Comput."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1006444906980","volume":"16","author":"N. Caspard","year":"1999","unstructured":"Caspard, N.: A characterization theorem for the canonical basis of a closure operator. Order\u00a016, 227\u2013230 (1999)","journal-title":"Order"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(02)00209-3","volume":"127","author":"N. Caspard","year":"2003","unstructured":"Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics\u00a0127, 241\u2013269 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.mathsocsci.2003.09.008","volume":"47","author":"F. Domenach","year":"2004","unstructured":"Domenach, F., Leclerc, B.: Closure systems, implicational systems, overhanging relations and the case of hierarchical classification. Mathematical Social Sciences\u00a047, 349\u2013366 (2004)","journal-title":"Mathematical Social Sciences"},{"key":"12_CR22","unstructured":"Zaki, M.J., Ogihara, M.: Theoretical Foundations of Association Rules. In: 3rd SIGMOD 1998 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), pp. 1\u20138 (1998)"},{"key":"12_CR23","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Proc. 15emes Journees Bases de Donnees Avancees, BDA, pp. 361\u2013381 (1999)"},{"key":"12_CR24","doi-asserted-by":"publisher","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 Knowledge Discovery\u00a01, 241\u2013258 (1997)","journal-title":"Data Mining Knowledge Discovery"},{"key":"12_CR25","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., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems\u00a024, 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.2307\/1914037","volume":"41","author":"C.R. Plott","year":"1973","unstructured":"Plott, C.R.: Path independence, rationality and social choice. Econometrica\u00a041, 1075\u20131091 (1973)","journal-title":"Econometrica"}],"container-title":["Lecture Notes in Computer Science","Concept Lattices and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78921-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T02:01:00Z","timestamp":1738116060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78921-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789208","9783540789215"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78921-5_12","relation":{},"subject":[]}}