{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T03:40:01Z","timestamp":1654141201982},"reference-count":46,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log\u00adical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addressing the discovery of constrained multidimen\u00adsional patterns. In this paper, the authors propose a foundation for various multidimensional database mining problems by introducing a new algebraic struc\u00adture called cube lattice, which characterizes the search space to be explored. This paper takes into consideration monotone and\/or anti-monotone constraints en\u00adforced when mining multidimensional patterns. The authors propose condensed representations of the constrained cube lattice, which is a convex space, and present a generalized levelwise algorithm for computing them. Additionally, the authors consider the formalization of existing data cubes, and the discovery of frequent multidimensional patterns, while introducing a perfect concise representation from which any solution provided with its conjunction, disjunction and negation frequencies. Fi\u00adnally, emphasis on advantages of the cube lattice when compared to the power set lattice of binary attributes in multidimensional database mining are placed.<\/p>","DOI":"10.4018\/jdwm.2010070104","type":"journal-article","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T12:21:49Z","timestamp":1277986909000},"page":"43-72","source":"Crossref","is-referenced-by-count":2,"title":["Constrained Cube Lattices for Multidimensional Database Mining"],"prefix":"10.4018","volume":"6","author":[{"given":"Alain","family":"Casali","sequence":"first","affiliation":[{"name":"Aix-Marseille Universit\u00e9, France"}]},{"given":"S\u00e9bastien","family":"Nedjar","sequence":"additional","affiliation":[{"name":"Aix-Marseille Universit\u00e9, France"}]},{"given":"Rosine","family":"Cicchetti","sequence":"additional","affiliation":[{"name":"Aix-Marseille Universit\u00e9, France"}]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[{"name":"Aix-Marseille Universit\u00e9, France"}]}],"member":"2432","reference":[{"key":"jdwm.2010070104-0","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., & Verkamo, A. I. (1996). Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining (pp. 307-328)."},{"key":"jdwm.2010070104-1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381017"},{"key":"jdwm.2010070104-2","doi-asserted-by":"crossref","unstructured":"Bayardo, R. (1998). Efficiently mining long patterns from databases. In Proceedings of the international conference on management of data (sigmod) (pp. 85-93).","DOI":"10.1145\/276305.276313"},{"key":"jdwm.2010070104-3","doi-asserted-by":"crossref","unstructured":"Bayardo, R., & Agrawal, R. (1999). Mining the Most Interesting Rules. In Proceedings of the 5th international conference on knowledge discovery and data mining (kdd) (pp. 145-154).","DOI":"10.1145\/312129.312219"},{"key":"jdwm.2010070104-4","doi-asserted-by":"crossref","unstructured":"Beyer, K., & Ramakrishnan, R. (1999). Bottom-Up Computation of Sparse and Iceberg CUBEs. In Proceedings of the international conference on management of data (sigmod) (pp. 359-370).","DOI":"10.1145\/304181.304214"},{"key":"jdwm.2010070104-5","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., & Silverstein, C. (1997). Beyond market baskets: generalizing association rules to correlations. In Proceedings of the international conference on management of data (sigmod) (pp. 265-276).","DOI":"10.1145\/253262.253327"},{"key":"jdwm.2010070104-6","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0054-6"},{"key":"jdwm.2010070104-7","doi-asserted-by":"crossref","unstructured":"Calders, T., Ng, R. T., & Wijsen, R. (2002). Searching for Dependencies at Multiple Abstraction Levels. In Proceedings of the Acm transactions on database systems (acm tods) (Vol. 27, No. 3, pp. 229-260).","DOI":"10.1145\/581751.581752"},{"key":"jdwm.2010070104-8","doi-asserted-by":"crossref","unstructured":"Casali, A. (2004). Mining borders of the difference of two datacubes. In Proceedings of the 6th international conference on data warehousing and knowledge discovery (dawak) (pp. 391-400).","DOI":"10.1007\/978-3-540-30076-2_39"},{"key":"jdwm.2010070104-9","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., & Lakhal, L. (2003a). Cube lattices: a framework for multidimensional data mining. In Proceedings of the 3rd siam international conference on data mining (sdm) (pp. 304-308).","DOI":"10.1137\/1.9781611972733.35"},{"key":"jdwm.2010070104-10","doi-asserted-by":"crossref","unstructured":"Casali, A., Cicchetti, R., & Lakhal, L. (2003b). Extracting semantics from datacubes using cube transversals and closures. In Proceedings of the 9th acm sigkdd international conference on knowledge discovery and data mining (kdd) (pp. 69-78).","DOI":"10.1145\/956750.956762"},{"key":"jdwm.2010070104-11","first-page":"428","article-title":"Essential patterns: A perfect cover of frequent patterns","volume":"Vol. 3589","author":"A.Casali","year":"2005","journal-title":"Dawak"},{"key":"jdwm.2010070104-12","first-page":"145","article-title":"Closed cubes lattices.","volume":"3","author":"A.Casali","year":"2009","journal-title":"Annals of Information Systems"},{"key":"jdwm.2010070104-13","doi-asserted-by":"crossref","unstructured":"Casali, A., Nedjar, S., Cicchetti, R., & Lakhal, L. (2009b). Emerging cubes: Borders, size estima\u00adtions and lossless reductions. International Journal of Information Systems, Their Creation, Management and Utilization.","DOI":"10.1016\/j.is.2009.03.001"},{"key":"jdwm.2010070104-14","doi-asserted-by":"crossref","unstructured":"Casali, A., Nejar, S., Cicchetti, R., & Lakhal, L. (2007). Convex cube: Towards a unified structure for multidimensional databases. In Proceedings of the 18th international conference on database and expert systems applications (dexa) (pp. 572-581).","DOI":"10.1007\/978-3-540-74469-6_56"},{"key":"jdwm.2010070104-15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009863704807"},{"key":"jdwm.2010070104-16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.28"},{"key":"jdwm.2010070104-17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","author":"B.Ganter","year":"1999","journal-title":"Formal Concept Analysis: Mathematical Foundations"},{"key":"jdwm.2010070104-18","doi-asserted-by":"crossref","unstructured":"Geerts, F., Goethals, B., & Bussche, J. (2001). A Tight Upper Bound on the Number of Candidate Patterns. In Proceedings of the 1st IEEE international conference on data mining (icdm) (pp. 155-162).","DOI":"10.1109\/ICDM.2001.989513"},{"key":"jdwm.2010070104-19","doi-asserted-by":"crossref","unstructured":"Grahne, G., Lakshmanan, L., & Wang, X. (2000). Efficient Mining of Constrained Correlated Sets. In Proceedings of the 16th international conference on data engineering (icde) (pp. 512-524).","DOI":"10.1109\/ICDE.2000.839450"},{"key":"jdwm.2010070104-20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726021843"},{"key":"jdwm.2010070104-21","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997). Data mining, hypergraph transversals, and machine learning. In Proceedings of the 16th symposium on principles of database systems (pods) (pp. 209-216).","DOI":"10.1145\/263661.263684"},{"key":"jdwm.2010070104-22","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Dong, G., & Wang, K. (2001). Efficient Computation of Iceberg Cubes with Complex Measures. In Proceedings of the international conference on management of data (sigmod) (pp. 441-448).","DOI":"10.1145\/375663.375664"},{"key":"jdwm.2010070104-23","unstructured":"Hirsh, H. (1991). Theoretical Underpinnings of Version Spaces. In Proceedings of the 12th international joint conference on artificial intelligence (ijcai) (pp. 665-670)."},{"key":"jdwm.2010070104-24","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L., Pei, J., & Han, J. (2002). 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-789).","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"jdwm.2010070104-25","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-005-0367-8"},{"key":"jdwm.2010070104-26","unstructured":"Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules. In Proceedings of the 1st international conference on data mining (icdm) (pp. 369-376)."},{"key":"jdwm.2010070104-27","unstructured":"Liu, B., Hsu, W., & Ma, Y. (1998). Integrating Classification and Association Rule Mining. In Proceedings of the 4th international conference on knowledge discovery and data mining (kdd) (pp. 80-86)."},{"key":"jdwm.2010070104-28","doi-asserted-by":"crossref","unstructured":"Lu, H., Feng, L., & Han, J. (2000). Beyond intratransaction association analysis: mining multidi\u00admensional intertransaction association rules. Acm tois, 18(4), 423-454.","DOI":"10.1145\/358108.358114"},{"key":"jdwm.2010070104-29","unstructured":"Mannila, H., & Toivonen, H. (1996). Multiple Uses of Frequent Sets and Condensed Representations: Extended Abstract. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD) (pp. 189-194)."},{"key":"jdwm.2010070104-30","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"jdwm.2010070104-31","author":"T. M.Mitchell","year":"1997","journal-title":"Machine learning"},{"key":"jdwm.2010070104-32","doi-asserted-by":"crossref","unstructured":"Nedjar, S., Casali, A., Cicchetti, R., & Lakhal, L. (2007). Emerging cubes for trends analysis in Olap databases. In Proceedings of the 9th international conference on data warehousing and knowledge discovery (dawak) (pp. 135-144).","DOI":"10.1007\/978-3-540-74553-2_13"},{"key":"jdwm.2010070104-33","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of the 7th international conference on database theory (icdt) (pp. 398-416).","DOI":"10.1007\/3-540-49257-7_25"},{"key":"jdwm.2010070104-34","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000023674.74932.4c"},{"key":"jdwm.2010070104-35","unstructured":"Pei, J., Han, J., & Mao, R. (2000). CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In Proceedings of the Workshop on research issues in data mining and knowledge discovery (dmkd) (pp. 21-30)."},{"key":"jdwm.2010070104-36","doi-asserted-by":"crossref","unstructured":"Raedt, L., Jaeger, M., Lee, S., & Mannila, H. (2002). A theory of inductive query answering. In Proceedings of the 2002 ieee international conference on data mining (icdm) (pp. 123-130).","DOI":"10.1109\/ICDM.2002.1183894"},{"key":"jdwm.2010070104-37","doi-asserted-by":"crossref","unstructured":"Raedt, L. D., & Zimmermann, A. (2007). Constraint-based pattern set mining. In Proceedings of the 7th siam international conference on data mining.","DOI":"10.1137\/1.9781611972771.22"},{"key":"jdwm.2010070104-38","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00011-X"},{"key":"jdwm.2010070104-39","doi-asserted-by":"crossref","unstructured":"Srikant, R., & Agrawal, R. (1996). Mining quantitative association rules in large relational tables. In Proceedings of the international conference on management of data (sigmod) (pp. 1-12).","DOI":"10.1145\/235968.233311"},{"key":"jdwm.2010070104-40","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(02)00057-5"},{"key":"jdwm.2010070104-41","author":"M.Vel","year":"1993","journal-title":"Theory of Convex Structures"},{"key":"jdwm.2010070104-42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.88"},{"key":"jdwm.2010070104-43","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Li, X., & Wah, B. W. (2003). Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In Proceedings of the 29th international conference on very large data bases (vldb) (pp. 476-487).","DOI":"10.1016\/B978-012722442-8\/50049-5"},{"key":"jdwm.2010070104-44","first-page":"4","author":"D.Xin","year":"2006","journal-title":"C-cubing: Efficient computation of closed cubes by aggregation-based checking"},{"key":"jdwm.2010070104-45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=44958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T03:05:40Z","timestamp":1654139140000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jdwm.2010070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jdwm.2010070104","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}