{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:40:08Z","timestamp":1746362408982,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448502"},{"type":"electronic","value":"9783662448519"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44851-9_37","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T13:00:58Z","timestamp":1409576458000},"page":"581-596","source":"Crossref","is-referenced-by-count":1,"title":["A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Poesia","sequence":"first","affiliation":[]},{"given":"Lo\u00efc","family":"Cerf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAMiner: Optimized level-wise frequent pattern mining with monotone constraints. In: ICDM 2003: Proceedings of the 3rd International Conference on Data Mining, pp. 11\u201318. IEEE Computer Society (2003)","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"37_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-39804-2_8","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"F. Bonchi","year":"2003","unstructured":"Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated data reduction in constrained pattern mining. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol.\u00a02838, pp. 59\u201370. Springer, Heidelberg (2003)"},{"key":"37_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-24775-3_19","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Bonchi","year":"2004","unstructured":"Bonchi, F., Goethals, B.: FP-Bonsai: the art of growing and pruning small FP-trees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 155\u2013160. Springer, Heidelberg (2004)"},{"key":"37_CR5","unstructured":"Boulicaut, J.F., Jeudy, B.: Using constraints during set mining: should we prune or not? In: BDA 2000: Actes des 16\u00e8me Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es, pp. 221\u2013237 (2000)"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.M.: DualMiner: a dual-pruning algorithm for itemsets with constraints. In: KDD 2002: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 42\u201351. ACM Press (2002)","DOI":"10.1145\/775047.775054"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L. Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., Boulicaut, J.F.: Closed patterns meet n-ary relations. ACM Transactions on Knowledge Discovery from Data\u00a03(1), 1\u201336 (2009)","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"37_CR8","unstructured":"Gallo, A., Mammone, A., Bie, T.D., Turchi, M., Cristianini, N.: From frequent itemsets to informative patterns. Tech. Rep. 123936, University of Bristol, Senate House, Tyndall Avenue, Bristol BS8 1TH, UK (December 2009)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Grahne, G., Lakshmanan, L.V.S., Wang, X.: Efficient mining of constrained correlated sets. In: ICDE 2000: Proceedings of the 16th International Conference on Data Engineering, pp. 512\u2013521. IEEE Computer Society (2000)","DOI":"10.1109\/ICDE.2000.839450"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Jaschke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: Trias\u2013an algorithm for mining iceberg tri-lattices. In: ICDM 2006: Proceedings of the 6th IEEE International Conference on Data Mining, pp. 907\u2013911. IEEE Computer Society (2006)","DOI":"10.1109\/ICDM.2006.162"},{"key":"37_CR11","unstructured":"Ji, L., Tan, K.L., Tung, A.K.H.: Mining frequent closed cubes in 3D data sets. In: VLDB\u201906: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 811\u2013822. VLDB Endowment (2006)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: WWW 2010: Proceedings of the 19th International World Wide Web Conferences, pp. 591\u2013600. ACM Press (2010)","DOI":"10.1145\/1772690.1772751"},{"issue":"9","key":"37_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.5120\/210-353","volume":"1","author":"R.V. Nataraj","year":"2010","unstructured":"Nataraj, R.V., Selvan, S.: Closed pattern mining from n-ary relations. International Journal of Computer Applications\u00a01(9), 9\u201313 (2010)","journal-title":"International Journal of Computer Applications"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-30220-6_20","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Trabelsi","year":"2012","unstructured":"Trabelsi, C., Jelassi, N., Ben Yahia, S.: Scalable mining of frequent tri-concepts from Folksonomies. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol.\u00a07302, pp. 231\u2013242. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44851-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:23:06Z","timestamp":1746361386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44851-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448502","9783662448519"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44851-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}