{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:29:55Z","timestamp":1743100195157,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205132"},{"type":"electronic","value":"9783642205149"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20514-9_17","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T01:28:16Z","timestamp":1303867696000},"page":"219-234","source":"Crossref","is-referenced-by-count":3,"title":["The Agree Concept Lattice for Multidimensional Database Analysis"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Nedjar","sequence":"first","affiliation":[]},{"given":"Fabien","family":"Pesci","sequence":"additional","affiliation":[]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[]},{"given":"Rosine","family":"Cicchetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases, vol.\u00a08. Citeseer (1995)"},{"key":"17_CR2","first-page":"5","volume":"22","author":"M. Barbut","year":"1968","unstructured":"Barbut, M.: Partitions d\u2019un ensemble fini: leur treillis (cosimplexe) et leur repr\u00e9sentation g\u00e9om\u00e9trique. Math\u00e9matiques et Sciences Humaines\u00a022, 5\u201322 (1968)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"17_CR3","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., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2422.322414","volume":"31","author":"C. Beeri","year":"1984","unstructured":"Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM\u00a031(1), 30\u201346 (1984)","journal-title":"J. ACM"},{"key":"17_CR5","series-title":"AMS Colloquium Publications","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1970","unstructured":"Birkhoff, G.: Lattice Theory, 3rd (new) edn. AMS Colloquium Publications, vol.\u00a0XXV. American Mathematical Society, Providence (1970)","edition":"3"},{"key":"17_CR6","first-page":"421","volume-title":"ICDE","author":"S. B\u00f6rzs\u00f6nyi","year":"2001","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430. IEEE Computer Society, Los Alamitos (2001)"},{"key":"17_CR7","first-page":"69","volume-title":"KDD","author":"A. Casali","year":"2003","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Extracting semantics from data cubes using cube transversals and closures. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) KDD, pp. 69\u201378. ACM, New York (2003)"},{"issue":"1","key":"17_CR8","first-page":"145","volume":"3","author":"A. Casali","year":"2009","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Closed cube lattices. Annals of Information Systems\u00a03(1), 145\u2013164 (2009a); New Trends in Data Warehousing and Data Analysis","journal-title":"Annals of Information Systems"},{"issue":"1","key":"17_CR9","first-page":"18","volume":"5","author":"A. Casali","year":"2009","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L., Novelli, N.: Lossless reduction of datacubes using partitions. IJDWM\u00a05(1), 18\u201335 (2009)","journal-title":"IJDWM"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Diallo, T., Novelli, N., Petit, J.-M.: Discovering (frequent) constant conditional functional dependencies. The International Journal of Data Mining, Modelling and Management, IJDMMM (2011)","DOI":"10.1504\/IJDMMM.2012.048104"},{"key":"17_CR11","doi-asserted-by":"publisher","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)"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J. Gray","year":"1997","unstructured":"Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Min. Knowl. Discov.\u00a01(1), 29\u201353 (1997)","journal-title":"Data Min. Knowl. Discov."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H.T. Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM\u00a022(4), 469\u2013476 (1975)","journal-title":"J. ACM"},{"key":"17_CR14","first-page":"778","volume-title":"VLDB","author":"L.V.S. Lakshmanan","year":"2002","unstructured":"Lakshmanan, L.V.S., Pei, J., Han, J.: Quotient cube: How to summarize the semantics of a data cube. In: Lochovsky, F.H., Shan, W. (eds.) VLDB, pp. 778\u2013789. Morgan Kaufmann, San Francisco (2002)"},{"key":"17_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48050-1_28","volume-title":"Foundations of Intelligent Systems","author":"M. Laporte","year":"2002","unstructured":"Laporte, M., Novelli, N., Cicchetti, R., Lakhal, L.: Computing full and iceberg datacubes using partitions. In: Hacid, M.-S., Ra\u015b, Z.W., Zighed, D.A., Kodratoff, Y. (eds.) ISMIS 2002. LNCS (LNAI), vol.\u00a02366, pp. 244\u2013254. Springer, Heidelberg (2002)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46439-5_24","volume-title":"Advances in Database Technology - EDBT 2000","author":"S. Lopes","year":"2000","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 350\u2013364. Springer, Heidelberg (2000)"},{"issue":"2-3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/09528130210164143","volume":"14","author":"S. Lopes","year":"2002","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Functional and approximate dependency mining: database and fca points of view. J. Exp. Theor. Artif. Intell.\u00a014(2-3), 93\u2013114 (2002)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-11928-6_12","volume-title":"Formal Concept Analysis","author":"R. Medina","year":"2010","unstructured":"Medina, R., Nourine, L.: Conditional functional dependencies: An FCA point of view. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol.\u00a05986, pp. 161\u2013176. Springer, Heidelberg (2010)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Morfonios, K., Konakas, S., Ioannidis, Y.E., Kotsis, N.: Rolap implementations of the data cube. ACM Comput. Surv.\u00a039(4) (2007)","DOI":"10.1145\/1287620.1287623"},{"issue":"6","key":"17_CR20","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.is.2009.03.001","volume":"34","author":"S. Nedjar","year":"2009","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Emerging cubes: Borders, size estimations and lossless reductions. Information Systems\u00a034(6), 536\u2013550 (2009)","journal-title":"Information Systems"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-11928-6_13","volume-title":"Formal Concept Analysis","author":"S. Nedjar","year":"2010","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Constrained closed datacubes. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol.\u00a05986, pp. 177\u2013192. Springer, Heidelberg (2010a)"},{"issue":"1","key":"17_CR22","first-page":"268","volume":"5","author":"S. Nedjar","year":"2010","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Reduced representations of emerging cubes for olap database mining. IJBIDM\u00a05(1), 268\u2013300 (2010)","journal-title":"IJBIDM"},{"key":"17_CR23","series-title":"SCI","volume-title":"Constrained Closed and Quotient Cubes, ch. 5","author":"S. Nedjar","year":"2010","unstructured":"Nedjar, S., Cicchetti, R., Lakhal, L.: Constrained Closed and Quotient Cubes, ch. 5. SCI, vol.\u00a02. Springer, Heidelberg (2010)"},{"key":"17_CR24","volume-title":"EGC 2011 \u2013 Extraction et Gestion Des Connaissances","author":"S. Nedjar","year":"2011","unstructured":"Nedjar, S., Pesci, F., Cicchetti, R., Lakhal, L.: Treillis des concepts skylines: Analyse multidimensionnelle des skylines fond\u00e9e sur les ensembles en accord. In: EGC 2011 \u2013 Extraction et Gestion Des Connaissances, Revue des Nouvelles Technologies de l\u2019Information, C\u00e9padu\u00e8s-\u00c9ditions (2011)"},{"issue":"7","key":"17_CR25","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0306-4379(01)00032-1","volume":"26","author":"N. Novelli","year":"2001","unstructured":"Novelli, N., Cicchetti, R.: Functional and embedded dependency inference: a data mining point of view. Inf. Syst.\u00a026(7), 477\u2013506 (2001)","journal-title":"Inf. Syst."},{"issue":"1","key":"17_CR26","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(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. Intell. Inf. Syst.\u00a024(1), 29\u201360 (2005)","journal-title":"J. Intell. Inf. Syst."},{"key":"17_CR28","unstructured":"Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: A semantic approach based on decisive subspaces. In: VLDB, pp. 253\u2013264 (2005)"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1145\/1189769.1189774","volume":"31","author":"J. Pei","year":"2006","unstructured":"Pei, J., Yuan, Y., Lin, X., Jin, W., Ester, M., Liu, Q., Wang, W., Tao, Y., Yu, J.X., Zhang, Q.: Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst.\u00a031(4), 1335\u20131381 (2006)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"17_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/12047.22718","volume":"12","author":"N. Spyratos","year":"1987","unstructured":"Spyratos, N.: The partition model: A deductive database model. ACM Trans. Database Syst.\u00a012(1), 1\u201337 (1987)","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"42","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowl. Eng.\u00a042(2), 189\u2013222 (2002)","journal-title":"Data Knowl. Eng."},{"key":"17_CR32","unstructured":"Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB, pp. 241\u2013252 (2005)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: KDD, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"}],"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-642-20514-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:20:58Z","timestamp":1558574458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20514-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205132","9783642205149"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20514-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}