{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:32:00Z","timestamp":1725503520295},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781363"},{"type":"electronic","value":"9783540781370"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78137-0_14","type":"book-chapter","created":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T23:34:46Z","timestamp":1202945686000},"page":"182-198","source":"Crossref","is-referenced-by-count":4,"title":["On the Merge of Factor Canonical Bases"],"prefix":"10.1007","author":[{"given":"Petko","family":"Valtchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Duquenne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), September 1994, Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"14_CR2","unstructured":"Armstrong, W.: Dependency Structures of Data Base Relationships. In: Rosenfeld, J. (ed.) Proceedings of the 1974 IFIP Congress, Information Processing, Stockholm (SE), August 5-10, 1974, vol.\u00a074, pp. 580\u2013583 (1974)"},{"key":"14_CR3","unstructured":"Birkhoff, G.: Lattice Theory. AMS, 3rd edn., vol.\u00a0XXV. AMS Colloquium Publications (1967)"},{"issue":"4","key":"14_CR4","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. Intl. J. of Algebra and Computation\u00a02(4), 409\u2013431 (1992)","journal-title":"Intl. J. of Algebra and Computation"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(92)90028-9","volume":"40","author":"J. Demetrovics","year":"1992","unstructured":"Demetrovics, J., Libkin, L., Muchnik, I.B.: Functional dependencies in relational databases: A lattice point of view. Discrete Applied Mathematics\u00a040(2), 155\u2013185 (1992)","journal-title":"Discrete Applied Mathematics"},{"volume-title":"Galois connections and Applications","year":"2004","key":"14_CR6","unstructured":"Denecke, K., Ern\u00e9, M., Wismath, S. (eds.): Galois connections and Applications. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"14_CR7","series-title":"Lecture Notes in Artificial Intelligence","first-page":"248","volume-title":"Formal Concept Analysis","author":"J.F. Djoufak Kengue","year":"2005","unstructured":"Djoufak Kengue, J.F., Valtchev, P., Tayou Djamegni, C.: A parallel algorithm for lattice construction. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 248\u2013263. Springer, Heidelberg (2005)"},{"key":"14_CR8","unstructured":"Duquenne, V.: Contextual implications between attributes and some representation properties for finite lattices. In: Ganter, B., Wille, R., Wolf, K.-E. (eds.) Beitrage zur Begriffsanalyse, Mannheim, pp. 213\u2013239 (1987)"},{"key":"14_CR9","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. preprint 831, Technische Hochschule, Darmstadt (1984)"},{"key":"14_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis, Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"14_CR11","first-page":"5","volume":"95","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\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0004-3702(94)00072-9","volume":"74","author":"H.A. Kautz","year":"1995","unstructured":"Kautz, H.A., Kearns, M.J., Selman, B.: Horn approximations of empirical data. Artificial Intelligence\u00a074(1), 129\u2013145 (1995)","journal-title":"Artificial Intelligence"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1613\/jair.183","volume":"3","author":"R. Khardon","year":"1995","unstructured":"Khardon, R.: Translating between horn representations and their characteristic models. Journal of Artificial Intelligence Research\u00a03, 349\u2013372 (1995)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1145\/800135.804425","volume-title":"Eleventh Annual ACM Symposium on Theory of Computing (STOC 1979)","author":"D. Maier","year":"1979","unstructured":"Maier, D.: Minimum covers in the relational database model. In: Eleventh Annual ACM Symposium on Theory of Computing (STOC 1979), pp. 330\u2013337. ACM Press, New York (1979)"},{"key":"14_CR15","unstructured":"Maier, D.: The theory of Relational Databases. Computer Science Press (1983)"},{"issue":"1","key":"14_CR16","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. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"key":"14_CR17","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proc. SIGMOD Workshop DMKD 2000, Dallas (TX), pp. 21\u201330 (2000)"},{"key":"14_CR18","series-title":"Studies in classification, data analysis and knowledge organization","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-642-80098-6_39","volume-title":"Data Analysis and Information Systems. Statistical and Conceptual approaches","author":"G. Stumme","year":"1996","unstructured":"Stumme, G.: Attribute exploration with background implications and exceptions. In: Bock, H.-H., Polasek, W. (eds.) Data Analysis and Information Systems. Statistical and Conceptual approaches. Studies in classification, data analysis and knowledge organization, vol.\u00a07, pp. 457\u2013469. Springer, Heidelberg (1996)"},{"key":"14_CR19","first-page":"307","volume-title":"Proc. of the ICDE-2000","author":"R. Taouil","year":"2000","unstructured":"Taouil, R., et al.: Mining bases for association rules using closed sets. In: Proc. of the ICDE-2000, San Diego (CA), p. 307. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"14_CR20","unstructured":"Valtchev, P., Duquenne, V.: Towards scalable divide-and-conquer methods for computing concepts and implications. In: SanJuan, E., et al. (eds.) Proc. of the 4th Intl. Conf. Journ\u00e9es de l\u2019Informatique Messine (JIM 2003): Knowledge Discovery and Discrete Mathematics, Metz (FR), INRIA, 3-6 September 2003, pp. 3\u201314 (2003)"},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/S0012-365X(02)00349-7","volume":"256","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A partition-based approach towards building Galois (concept) lattices. Discrete Mathematics\u00a0256(3), 801\u2013829 (2002)","journal-title":"Discrete Mathematics"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0030825","volume-title":"Computing and Combinatorics","author":"M. Wild","year":"1995","unstructured":"Wild, M.: Computations with finite closure systems and implications. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 111\u2013120. Springer, Heidelberg (1995)"},{"key":"14_CR23","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. Reidel, Dordrecht-Boston (1982)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: Proc. of the 6th Intl. Conf. on Knowledge Discovery and Data Mining (KDD 2000), Boston (MA), pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: ChARM: An Efficiently Algorithm for Closed Itemset Mining. In: Grossman, R., et al. (eds.) Proceedings of the 2nd SIAM International Conference on Data Mining (ICDM 2002) (2002)","DOI":"10.1137\/1.9781611972726.27"}],"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-78137-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:16:27Z","timestamp":1558264587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78137-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540781363","9783540781370"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78137-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}