{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T04:01:58Z","timestamp":1742529718116,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258374"},{"type":"electronic","value":"9783642258381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25838-1_1","type":"book-chapter","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T11:44:19Z","timestamp":1328787859000},"page":"3-26","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Closed and Quotient Cubes"],"prefix":"10.1007","author":[{"given":"Rosine","family":"Cicchetti","sequence":"first","affiliation":[]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Nedjar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,10]]},"reference":[{"key":"1_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., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. In: CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 972\u2013986. Springer, Heidelberg (2000)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Delis, A., Faloutsos, C., Ghandeharizadeh, S. (eds.) SIGMOD Conference, pp. 359\u2013370. ACM Press (1999)","DOI":"10.1145\/304181.304214"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Morik, K., Rastogi, R. (eds.) ICDM, pp. 35\u201342. IEEE Computer Society (2004)","DOI":"10.1109\/ICDM.2004.10093"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-540-30076-2_39","volume-title":"Data Warehousing and Knowledge Discovery","author":"A. Casali","year":"2004","unstructured":"Casali, A.: Mining Borders of the Difference of Two Datacubes. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2004. LNCS, vol.\u00a03181, pp. 391\u2013400. Springer, Heidelberg (2004)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., Lakhal, L.: Cube lattices: A framework for multidimensional data mining. In: Barbar\u00e1, D., Kamath, C. (eds.) SDM. SIAM (2003a)","DOI":"10.1137\/1.9781611972733.35"},{"key":"1_CR6","doi-asserted-by":"crossref","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 (2003b)","DOI":"10.1145\/956750.956762"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74469-6_56","volume-title":"Database and Expert Systems Applications","author":"A. Casali","year":"2007","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Convex Cube: Towards a Unified Structure for Multidimensional Databases. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol.\u00a04653, pp. 572\u2013581. Springer, Heidelberg (2007)"},{"issue":"1","key":"1_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":"1_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 (2009b)","journal-title":"IJDWM"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10115-004-0178-1","volume":"8","author":"G. Dong","year":"2005","unstructured":"Dong, G., Li, J.: Mining border descriptions of emerging patterns from dataset pairs. Knowl. Inf. Syst.\u00a08(2), 178\u2013202 (2005)","journal-title":"Knowl. Inf. Syst."},{"key":"1_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":"1_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."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: Jagadish, H.V., Mumick, I.S. (eds.) SIGMOD Conference, pp. 205\u2013216. ACM Press (1996)","DOI":"10.1145\/235968.233333"},{"key":"1_CR14","doi-asserted-by":"crossref","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 (2002)","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"1_CR15","unstructured":"Morfonios, K., Ioannidis, Y.E.: Cure for cubes: Cubing using a rolap engine. In: Dayal, U., Whang, K.-Y., Lomet, D.B., Alonso, G., Lohman, G.M., Kersten, M.L., Cha, S.K., Kim, Y.-K. (eds.) VLDB, pp. 379\u2013390. ACM (2006)"},{"key":"1_CR16","unstructured":"Nedjar, S.: Cubes \u00c9mergents pour l\u2019analyse des renversements de tendances dans les bases de donn\u00e9es multidimensionnelles. PhD thesis. Universit\u00e9 de M\u00e9diterran\u00e9e (2009)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-74553-2_13","volume-title":"Data Warehousing and Knowledge Discovery","author":"S. Nedjar","year":"2007","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Emerging Cubes for Trends Analysis in olap\u00a0Databases. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol.\u00a04654, pp. 135\u2013144. Springer, Heidelberg (2007)"},{"issue":"6","key":"1_CR18","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":"1_CR19","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)"},{"key":"1_CR20","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Cubes ferm\u00e9s \/ quotients \u00e9mergents. In: EGC 2010 \u2013 Extraction et Gestion des Connaissances. Revue des Nouvelles Technologies de l\u2019Information, vol.\u00a0RNTI-E-19, pp. 285\u2013296. C\u00e9padu\u00e8s-\u00c9ditions (2010b)"},{"issue":"1","key":"1_CR21","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":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov.\u00a08(3), 227\u2013252 (2004)","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"1_CR23","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."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TKDE.2007.250589","volume":"19","author":"D. Xin","year":"2007","unstructured":"Xin, D., Han, J., Li, X., Shao, Z., Wah, B.W.: Computing iceberg cubes by top-down and bottom-up integration: The starcubing approach. IEEE Trans. Knowl. Data Eng.\u00a019(1), 111\u2013126 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Xin, D., Shao, Z., Han, J., Liu, H.: C-cubing: Efficient computation of closed cubes by aggregation-based checking. In: Liu, L., Reuter, A., Whang, K.-Y., Zhang, J. (eds.) ICDE, p. 4. IEEE Computer Society (2006)","DOI":"10.1109\/ICDE.2006.31"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: KDD, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"issue":"7","key":"1_CR27","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/TKDE.2007.1053","volume":"19","author":"X. Zhang","year":"2007","unstructured":"Zhang, X., Chou, P.L., Dong, G.: Efficient computation of iceberg cubes by bounding aggregate functions. IEEE Trans. Knowl. Data Eng.\u00a019(7), 903\u2013918 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Studies in Computational Intelligence","Advances in Knowledge Discovery and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25838-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T03:28:45Z","timestamp":1742441325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25838-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258374","9783642258381"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25838-1_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2012]]}}}