{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:21Z","timestamp":1725544761650},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_40","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"423-434","source":"Crossref","is-referenced-by-count":1,"title":["Finding All Minimal Infrequent Multi-dimensional Intervals"],"prefix":"10.1007","author":[{"given":"Khaled M.","family":"Elbassioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in massive databases. In: Proc. the 1993 ACM-SIGMOD Int. Conf. Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"40_CR2","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"40_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. 20th Int. Conf. Very Large Data Bases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/3-540-45061-0_44","volume-title":"Automata, Languages and Programming","author":"E. Boros","year":"2003","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L., Makino, K.: An Intersection Inequality for Discrete Distributions and Related Generation Problems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 543\u2013555. Springer, Heidelberg (2003)"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45841-7_10","volume-title":"STACS 2002","author":"E. Boros","year":"2002","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 133\u2013141. Springer, Heidelberg (2002)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market basket: Generalizing association rules to correlations. In: Proc. the 1997 ACM-SIGMOD Int. Conf. Management of Data, pp. 265\u2013276 (1997)","DOI":"10.1145\/253262.253327"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J.C. Bioch","year":"1995","unstructured":"Bioch, J.C., Ibaraki, T.: Complexity of identification and dualization of positive Boolean functions. Information and Computation\u00a0123, 50\u201363 (1995)","journal-title":"Information and Computation"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/3-540-45749-6_39","volume-title":"Algorithms - ESA 2002","author":"K. Elbassioni","year":"2002","unstructured":"Elbassioni, K.: An algorithm for dualization in products of lattices and its applications. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 424\u2013435. Springer, Heidelberg (2002)"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-44503-X_12","volume-title":"Database Theory - ICDT 2001","author":"J. Edmonds","year":"2000","unstructured":"Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty rectangles in large data sets. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 174\u2013188. Springer, Heidelberg (2000)"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"M.L. Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms\u00a021, 618\u2013628 (1996)","journal-title":"Journal of Algorithms"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(99)00099-2","volume":"96","author":"V. Gurvich","year":"1999","unstructured":"Gurvich, V., Khachiyan, L.: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Applied Mathematics\u00a096-97, 363\u2013373 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals and machine learning. In: Proc. 16th ACM PODS, pp. 12\u201315 (1997)","DOI":"10.1145\/263661.263684"},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/69.204089","volume":"5","author":"J. Han","year":"1993","unstructured":"Han, J., Cai, Y., Cercone, N.: Data driven discovery of quantitative rules in relational databases. IEEE Trans. Knowledge and Data Engineering\u00a05(1), 29\u201340 (1993)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"40_CR14","unstructured":"Han, J., Fu, Y.: Discovery of multiple-level association rules from large databases. In: Proc. 21st Int. Conf. Very Large Data Bases (VLDB 1995), pp. 420\u2013431 (1995)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Lin, J.-L.: Mining maximal frequent intervals. In: Proc. 18th Annual ACM Symp. Applied Computing, Melbourne, FL, September 2003, pp. 426\u2013431 (2003)","DOI":"10.1145\/952532.952617"},{"key":"40_CR16","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining, pp. 189\u2013194 (1996)"},{"issue":"3","key":"40_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery\u00a01(3), 241\u2013258 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"40_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery\u00a01(3), 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"40_CR19","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. In: Proc. 21st Int. Conf. Very Large Data Bases (VLDB 1995), pp. 407\u2013419 (1995)"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining quantitative association rules in large relational tables. In: Proc. the 1996 ACM-SIGMOD Int. Conf. Management of Data, pp. 1\u201312 (1996)","DOI":"10.1145\/233269.233311"},{"key":"40_CR21","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proc. 21st Int. Conf. Very Large Data Bases (VLDB 1995), pp. 432\u2013444 (1995)"},{"key":"40_CR22","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proc. 22nd Int. Conf. Very Large Data Bases (VLDB 1996), pp. 134\u2013145 (1996)"},{"key":"40_CR23","unstructured":"Yu, H.-C.: Efficient data mining for frequent intervals, Master thesis, Department of Information Management, National Taiwan University, Taiwan (July 2002)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:51Z","timestamp":1555445931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11682462_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}