{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:40Z","timestamp":1758273880155},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642018145"},{"type":"electronic","value":"9783642018152"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-01815-2_5","type":"book-chapter","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T11:25:03Z","timestamp":1242041103000},"page":"58-65","source":"Crossref","is-referenced-by-count":1,"title":["What Can Formal Concept Analysis Do for Data Warehouses?"],"prefix":"10.1007","author":[{"given":"Rokia","family":"Missaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e9onard","family":"Kwuida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"232","volume-title":"ICDE 1997: Proceedings of the Thirteenth International Conference on Data Engineering","author":"R. Agrawal","year":"1997","unstructured":"Agrawal, R., Gupta, A., Sarawagi, S.: Modeling multidimensional databases. In: ICDE 1997: Proceedings of the Thirteenth International Conference on Data Engineering, Washington, DC, USA, 1997, pp. 232\u2013243. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"5_CR2","first-page":"539","volume-title":"SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data","author":"B. Babcock","year":"2003","unstructured":"Babcock, B., Chaudhuri, S., Das, G.: Dynamic sample selection for approximate query processing. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 539\u2013550. ACM Press, New York (2003)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-45151-X_30","volume-title":"Web-Age Information Management","author":"D. Barbar\u00e1","year":"2000","unstructured":"Barbar\u00e1, D., Wu, X.: Using loglinear models to compress datacubes. In: Lu, H., Zhou, A. (eds.) WAIM 2000. LNCS, vol.\u00a01846, pp. 311\u2013323. Springer, Heidelberg (2000)"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1011224019249","volume":"16","author":"D. Barbara","year":"2001","unstructured":"Barbara, D., Wu, X.: Loglinear-based quasi cubes. J. Intell. Inf. Syst.\u00a016(3), 255\u2013276 (2001)","journal-title":"J. Intell. Inf. Syst."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.5626\/JCSE.2007.1.2.177","volume":"1","author":"L. Bellatreche","year":"2007","unstructured":"Bellatreche, L., Missaoui, R., Necir, H., Drias, H.: A data mining approach for selecting bitmap join indices. Journal of Computing Science and Engineering\u00a01(2), 177\u2013194 (2007)","journal-title":"Journal of Computing Science and Engineering"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787181_11","volume-title":"Conceptual Structures: Inspiration and Application","author":"J. Besson","year":"2006","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F.: Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In: Sch\u00e4rfe, H., Hitzler, P., \u00d8hrstr\u00f8m, P. (eds.) ICCS 2006. LNCS, vol.\u00a04068, pp. 144\u2013157. Springer, Heidelberg (2006)"},{"key":"5_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)"},{"key":"5_CR8","series-title":"Annals of Information Systems","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-0-387-87431-9_7","volume-title":"New Trends in Data Warehousing and Data Analysis","author":"A. Casali","year":"2009","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Closed Cube Lattices. In: New Trends in Data Warehousing and Data Analysis. Annals of Information Systems, vol.\u00a03, pp. 1\u201320. Springer, Heidelberg (2009)"},{"key":"5_CR9","first-page":"37","volume-title":"SDM","author":"L. Cerf","year":"2008","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.-F.: Data peeler: Constraint-based closed pattern mining in n-ary relations. In: SDM, pp. 37\u201348. SIAM, Philadelphia (2008)"},{"issue":"2-3","key":"5_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s007780100049","volume":"10","author":"K. Chakrabarti","year":"2001","unstructured":"Chakrabarti, K., Garofalakis, M.N., Rastogi, R., Shim, K.: Approximate query processing using wavelets. VLDB J.\u00a010(2-3), 199\u2013223 (2001)","journal-title":"VLDB J."},{"issue":"11","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1109\/TKDE.2004.75","volume":"16","author":"S. Chaudhuri","year":"2004","unstructured":"Chaudhuri, S., Datar, M., Narasayya, V.: Index selection for databases: A hardness study and a principled heuristic solution. IEEE Transactions on Knowledge and Data Engineering\u00a016(11), 1313\u20131323 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/248603.248616","volume":"26","author":"S. Chaudhuri","year":"1997","unstructured":"Chaudhuri, S., Dayal, U.: An overview of data warehousing and olap technology. SIGMOD Rec.\u00a026(1), 65\u201374 (1997)","journal-title":"SIGMOD Rec."},{"key":"5_CR13","first-page":"321","volume-title":"VLDB 2001: Proceedings of the 27th International Conference on Very Large Data Bases","author":"G. Dong","year":"2001","unstructured":"Dong, G., Han, J., Lam, J.M.W., Pei, J., Wang, K.: Mining multi-dimensional constrained gradients in data cubes. In: VLDB 2001: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 321\u2013330. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"5_CR14","first-page":"85","volume-title":"Visualization of Categorical Data","author":"S. Gabler","year":"1998","unstructured":"Gabler, S., Wolff, K.E.: Comparison of visualizations in formal concept analysis and correspondence analysis. In: Greenacre, M., Blasius, J. (eds.) Visualization of Categorical Data, pp. 85\u201397. Academic Press, San Diego (1998)"},{"key":"5_CR15","volume-title":"Data mining: concepts and techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data mining: concepts and techniques. Morgan Kaufmann Publishers Inc., San Francisco (2000)"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/233269.233333","volume-title":"SIGMOD 1996: Proceedings of the 1996 ACM SIGMOD international conference on Management of data","author":"V. Harinarayan","year":"1996","unstructured":"Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: SIGMOD 1996: Proceedings of the 1996 ACM SIGMOD international conference on Management of data, pp. 205\u2013216. ACM Press, New York (1996)"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1015417610840","volume":"6","author":"T. Imielinski","year":"2002","unstructured":"Imielinski, T., Khachiyan, L., Abdulghani, A.: Cubegrades: Generalizing association rules. Data Min. Knowl. Discov.\u00a06(3), 219\u2013257 (2002)","journal-title":"Data Min. Knowl. Discov."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/ICDM.2006.162","volume-title":"Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006)","author":"R. Jaeschke","year":"2006","unstructured":"Jaeschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias - an algorithm for mining iceberg tri-lattices. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), Hong Kong, December 2006, pp. 907\u2013911. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"5_CR19","unstructured":"Ji, L., Tan, K.-L., Tung, A.K.H.: Mining frequent closed cubes in 3d datasets. In: VLDB 2006: Proceedings of the 32nd international conference on Very large data bases, pp. 811\u2013822. VLDB Endowment (2006)"},{"key":"5_CR20","first-page":"207","volume-title":"Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997)","author":"M. Kamber","year":"1997","unstructured":"Kamber, M., Han, J., Chiang, J.: Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997), Newport Beach, CA, USA, August 1997, pp. 207\u2013210. The AAAI Press, Menlo Park (1997)"},{"issue":"3-4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s007780050006","volume":"8","author":"E.M. Knorr","year":"2000","unstructured":"Knorr, E.M., Ng, R.T., Tucakov, V.: Distance-based outliers: algorithms and applications. The VLDB Journal\u00a08(3-4), 237\u2013253 (2000)","journal-title":"The VLDB Journal"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Pei, J., Zhao, Y.: Quotient cube: How to summarize the semantics of a data cube. In: Proceedings of the 28th International Conference on Very Large Databases, VLDB, pp. 778\u2013789 (2002)","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-60161-9_27","volume-title":"Conceptual Structures: Applications, Implementation and Theory","author":"F. Lehmann","year":"1995","unstructured":"Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. LNCS, vol.\u00a0954, pp. 32\u201343. Springer, Heidelberg (1995)"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF02944900","volume":"19","author":"C.-P. Li","year":"2004","unstructured":"Li, C.-P., Tung, K.-H., Wang, S.: Incremental maintenance of quotient cube based on galois lattice. J. Comput. Sci. Technol.\u00a019(3), 302\u2013308 (2004)","journal-title":"J. Comput. Sci. Technol."},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/358108.358114","volume":"18","author":"H. Lu","year":"2000","unstructured":"Lu, H., Feng, L., Han, J.: Beyond intratransaction association analysis: mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst.\u00a018(4), 423\u2013454 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"key":"5_CR26","first-page":"65","volume-title":"DOLAP 2004: Proceedings of the 7th ACM international workshop on Data warehousing and OLAP","author":"R.B. Messaoud","year":"2004","unstructured":"Messaoud, R.B., Boussaid, O., Rabas\u00e9da, S.: A new olap aggregation based on the ahc technique. In: DOLAP 2004: Proceedings of the 7th ACM international workshop on Data warehousing and OLAP, pp. 65\u201372. ACM Press, New York (2004)"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1317331.1317338","volume-title":"DOLAP 2007: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP","author":"R. Missaoui","year":"2007","unstructured":"Missaoui, R., Goutte, C., Choupo, A.K., Boujenoui, A.: A probabilistic model for data cube compression and query approximation. In: DOLAP 2007: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP, pp. 33\u201340. ACM Press, New York (2007)"},{"issue":"11","key":"5_CR28","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1109\/TKDE.2005.187","volume":"17","author":"T. Palpanas","year":"2005","unstructured":"Palpanas, T., Koudas, N., Mendelzon, A.: Using datacube aggregates for approximate querying and deviation detection. IEEE Transactions on Knowledge and Data Engineering\u00a017(11), 1465\u20131477 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BFb0100984","volume-title":"Advances in Database Technology - EDBT \u201998","author":"S. Sarawagi","year":"1998","unstructured":"Sarawagi, S., Agrawal, R., Megiddo, N.: Discovery-driven exploration of olap data cubes. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 168\u2013182. Springer, Heidelberg (1998)"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/312129.312231","volume-title":"KDD \u201999: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"J. Shanmugasundaram","year":"1999","unstructured":"Shanmugasundaram, J., Fayyad, U., Bradley, P.S.: Compressed data cubes for olap aggregate query approximation on continuous dimensions. In: KDD 1999: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 223\u2013232. ACM Press, New York (1999)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Stumme, G.: Conceptual on-line analytical processing. In: Information organization and databases: foundations of data organization, pp. 191\u2013203 (2000)","DOI":"10.1007\/978-1-4615-1379-7_14"},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"28","DOI":"10.4018\/jdwm.2005070103","volume":"1","author":"H.C. Tjioe","year":"2005","unstructured":"Tjioe, H.C., Taniar, D.: Mining association rules in data warehouses. International Journal of Data Warehousing and Mining\u00a01(3), 28\u201362 (2005)","journal-title":"International Journal of Data Warehousing and Mining"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-32262-7_21","volume-title":"Formal Concept Analysis","author":"V. Ventos","year":"2005","unstructured":"Ventos, V., Soldano, H.: Alpha galois lattices: an overview. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS, vol.\u00a03403, pp. 298\u2013313. Springer, Heidelberg (2005)"},{"issue":"3","key":"5_CR34","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G. Voutsadakis","year":"2002","unstructured":"Voutsadakis, G.: Polyadic concept analysis. Order\u00a019(3), 295\u2013304 (2002)","journal-title":"Order"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0378-8733(95)00273-1","volume":"18","author":"D.R. White","year":"1996","unstructured":"White, D.R.: Statistical entailments and the galois lattice. Social Networks\u00a018, 201\u2013215 (1996)","journal-title":"Social Networks"},{"key":"5_CR36","unstructured":"Wolff, K.E.: Comparison of graphical data analysis methods. In: Faulbaum, F., Bandilla, W. (eds.) SoftStat 1995. Advances in Statistical Software, vol.\u00a05, Lucius&Lucius, Stuttgart, pp. 139\u2013151 (1996)"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Li, X., Wah, B.W.: Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50049-5"},{"issue":"5","key":"5_CR38","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF02948830","volume":"17","author":"F. Yu","year":"2002","unstructured":"Yu, F., Shan, W.: Compressed data cube for approximate olap query processing. J. Comput. Sci. Technol.\u00a017(5), 625\u2013635 (2002)","journal-title":"J. Comput. Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01815-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T22:13:12Z","timestamp":1589753592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01815-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642018145","9783642018152"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01815-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}