{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T23:16:50Z","timestamp":1715037410091},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T00:00:00Z","timestamp":1345507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10618-012-0284-8","type":"journal-article","created":{"date-parts":[[2012,8,20]],"date-time":"2012-08-20T05:18:24Z","timestamp":1345439904000},"page":"574-619","source":"Crossref","is-referenced-by-count":25,"title":["Closed and noise-tolerant patterns in n-ary relations"],"prefix":"10.1007","volume":"26","author":[{"given":"Lo\u00efc","family":"Cerf","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00e9my","family":"Besson","sequence":"additional","affiliation":[]},{"given":"Kim-Ngan T.","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,21]]},"reference":[{"issue":"1\u20133","key":"284_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis D, Fukuda K (1996) Reverse search for enumeration. Discret Appl Math 65(1\u20133): 21\u201346","journal-title":"Discret Appl Math"},{"key":"284_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo RJ, Goethals B, Zaki MJ (eds) (2004) In: FIMI \u201904, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004, CEUR Workshop Proceedings, vol 126, CEUR-WS.org","DOI":"10.1145\/1007730.1007744"},{"issue":"1","key":"284_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/IDA-2005-9105","volume":"9","author":"J Besson","year":"2005","unstructured":"Besson J, Robardet C, Boulicaut JF, Rome S (2005) Constraint-based formal concept mining and its application to microarray data analysis. Intell Data Anal 9(1): 59\u201382","journal-title":"Intell Data Anal"},{"key":"284_CR4","doi-asserted-by":"crossref","unstructured":"Besson J, Robardet C, Boulicaut JF (2006) Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In: ICCS \u201906: Proceedings of the 14th International Conference on Conceptual Structures, Springer, pp 144\u2013157","DOI":"10.1007\/11787181_11"},{"key":"284_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi F, Lucchese C (2004) On closed constrained frequent pattern mining. In: ICDM \u201904: Proceedings of the 4th IEEE International Conference on Data Mining, IEEE Computer Society, pp 35\u201342","DOI":"10.1109\/ICDM.2004.10093"},{"key":"284_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi F, Lucchese C (2005) Pushing tougher constraints in frequent pattern mining. In: PAKDD 05 Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, pp 114\u2013124","DOI":"10.1007\/11430919_15"},{"key":"284_CR7","unstructured":"Boulicaut JF, Bykowski A (2000) Frequent closures as a concise representation for binary data mining. In: PAKDD \u201800: Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer, pp 62\u201373"},{"key":"284_CR8","unstructured":"Calders T, Rigotti C, Boulicaut JF (2005) A survey on condensed representations for frequent sets. In: Constraint-Based Mining and Inductive Databases, Springer, Lecture Notes in Computer Science, vol 3848, pp 64\u201380"},{"issue":"1","key":"284_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009a) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1): 1\u201336","journal-title":"ACM Trans Knowl Discov Data"},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"Cerf L, Mougel PN, Boulicaut JF (2009b) Agglomerating local patterns hierarchically with ALPHA. In: CIKM \u201809: Proceedings of the 18th International Conference on Information and Knowledge Management, ACM Press, pp 1753\u20131756","DOI":"10.1145\/1645953.1646222"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Cerf L, Nguyen TBN, Boulicaut JF (2009c) Discovering relevant cross-graph cliques in dynamic networks. In: ISMIS \u201809: Proceedings of the 18th International Symposium on Methodologies for Intelligent Systems, Springer, pp 513\u2013522","DOI":"10.1007\/978-3-642-04125-9_54"},{"key":"284_CR12","doi-asserted-by":"crossref","unstructured":"Cerf L, Nguyen TBN, Boulicaut JF (2010) Mining constrained cross-graph cliques in dynamic networks. Inductive databases and constraint-based data mining, Springer, pp 199\u2013228","DOI":"10.1007\/978-1-4419-7738-0_9"},{"key":"284_CR13","doi-asserted-by":"crossref","unstructured":"Cheng H, Yu PS, Han J (2008) Approximate frequent itemset mining in the presence of random noise. In: Maimon O, Rokach L (eds) Soft computing for knowledge discovery and data mining. Springer, , pp 363\u2013389","DOI":"10.1007\/978-0-387-69935-6_15"},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Gallo A, Bie TD, Cristianini N (2007) MINI: Mining informative non-redundant itemsets. In: PKDD \u201807: Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Springer, pp 438\u2013445","DOI":"10.1007\/978-3-540-74976-9_44"},{"key":"284_CR15","unstructured":"Gallo A, Mammone A, Bie TD, Turchi M, Cristianini N (2009) From frequent itemsets to informative patterns. Tech. Rep. 123936, University of Bristol, UK"},{"key":"284_CR16","volume-title":"Formal concept analysis, foundations and applications, lecture notes in computer science","year":"2005","unstructured":"Ganter, B, Stumme, G, Wille, R (eds) (2005) Formal concept analysis, foundations and applications, lecture notes in computer science. Springer, Berlin"},{"key":"284_CR17","doi-asserted-by":"crossref","unstructured":"Ganti V, Gehrke J, Ramakrishnan R (1999) CACTUS: clustering categorical data using summaries. In: KDD \u201899: Proceedings of the 5th SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, pp 73\u201383","DOI":"10.1145\/312129.312201"},{"key":"284_CR18","first-page":"559","volume":"9","author":"GC Garriga","year":"2008","unstructured":"Garriga GC, Kralj P, Lavrac N (2008) Closed sets for labeled data. J Mach Learn Res 9: 559\u2013580","journal-title":"J Mach Learn Res"},{"key":"284_CR19","doi-asserted-by":"crossref","unstructured":"Georgii E, Tsuda K, Sch\u00f6lkopf B (2009) Multi-way set enumeration in real-valued tensors. In: DMMT \u201909: Proceedings of the 2nd ACM SIGKDD Workshop on Data Mining using Matrices and Tensors, ACM Press, pp 32\u201341","DOI":"10.1145\/1581114.1581118"},{"issue":"2","key":"284_CR20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10994-010-5210-y","volume":"82","author":"E Georgii","year":"2011","unstructured":"Georgii E, Tsuda K, Sch\u00f6lkopf B (2011) Multi-way set enumeration in weight tensors. Mach Learn 82(2): 123\u2013155","journal-title":"Mach Learn"},{"key":"284_CR21","first-page":"321","volume-title":"Data mining and knowledge discovery handbook","author":"B Goethals","year":"2010","unstructured":"Goethals B (2010) Frequent set mining. In: Maimon O, Rokach L (eds) Data mining and knowledge discovery handbook. Springer, Berlin, pp 321\u2013338"},{"key":"284_CR22","doi-asserted-by":"crossref","unstructured":"Gupta R, Fang G, Field B, Steinbach M, Kumar V (2008) Quantitative evaluation of approximate frequent pattern mining algorithms. In: KDD \u201908: Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, pp 301\u2013309","DOI":"10.1145\/1401890.1401930"},{"key":"284_CR23","doi-asserted-by":"crossref","unstructured":"Jaschke R, Hotho A, Schmitz C, Ganter B, Stumme G (2006) Trias: an algorithm for mining iceberg tri-lattices. In: ICDM \u201906: Proceedings of the 6th IEEE International Conference on Data Mining, IEEE Computer Society, pp 907\u2013911","DOI":"10.1109\/ICDM.2006.162"},{"key":"284_CR24","unstructured":"Ji L, Tan KL, Tung AKH (2006) Mining frequent closed cubes in 3D data sets. In: VLDB \u201806: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB Endowment, pp 811\u2013822"},{"issue":"4","key":"284_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D Jiang","year":"2009","unstructured":"Jiang D, Pei J (2009) Mining frequent cross-graph quasi-cliques. ACM Trans Knowl Discov Data 2(4): 1\u201342","journal-title":"ACM Trans Knowl Discov Data"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Koh JL, Yo PW (2005) An efficient approach for mining fault-tolerant frequent patterns based on bit vector representations. In: DASFAA \u201805: Proceedings of the 10th International Conference on Database Systems for Advanced Applications, Springer, pp 568\u2013575","DOI":"10.1007\/11408079_51"},{"key":"284_CR27","doi-asserted-by":"crossref","unstructured":"Liu J, Paulsen S, Sun X, Wang W, Nobel AB, Prins J (2006) Mining approximate frequent itemsets in the presence of noise: algorithm and analysis. In: SDM \u201806: Proceedings of the 6th SIAM International Conference on Data Mining, SIAM, pp 405\u2013416","DOI":"10.1137\/1.9781611972764.36"},{"key":"284_CR28","doi-asserted-by":"crossref","unstructured":"Pan F, Cong G, Tung AK, Yang J, Zaki MJ (2003) CARPENTER: finding closed patterns in long biological datasets. In: KDD \u201803: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, pp 637\u2013642","DOI":"10.1145\/956750.956832"},{"issue":"1","key":"284_CR29","doi-asserted-by":"crossref","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1): 25\u201346","journal-title":"Inf Syst"},{"key":"284_CR30","unstructured":"Pei J, Tung AKH, Han J (2001) Fault-tolerant frequent pattern mining: problems and challenges. In: DMKD \u201801: Proceedings of the 6th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, ACM Press"},{"key":"284_CR31","unstructured":"Poernomo AK, Gopalkrishnan V (2007) Mining statistical information of frequent fault-tolerant patterns in transactional databases. In: ICDM \u201807: Proceedings of the 7th IEEE International Conference on Data Mining, IEEE Computer Society, pp 272\u2013281"},{"key":"284_CR32","doi-asserted-by":"crossref","unstructured":"Poernomo AK, Gopalkrishnan V (2009a) Efficient computation of partial-support for mining interesting itemsets. In: SDM \u201909: Proceedings of the 9th SIAM International Conference on Data Mining, SIAM, pp 1014\u20131025","DOI":"10.1137\/1.9781611972795.87"},{"key":"284_CR33","doi-asserted-by":"crossref","unstructured":"Poernomo AK, Gopalkrishnan V (2009b) Towards efficient mining of proportional fault-tolerant frequent itemsets. In: KDD \u201909: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, pp 697\u2013706","DOI":"10.1145\/1557019.1557097"},{"key":"284_CR34","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen JK, Mannila H (2004) Dense itemsets. In: KDD \u201904: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, pp 683\u2013688","DOI":"10.1145\/1014052.1014140"},{"key":"284_CR35","doi-asserted-by":"crossref","unstructured":"Sim K, Liu G, Gopalkrishnan V, Li J (2011) A case study of financial ratios via cross-graph quasi-cliques. Inf Sci 181:201\u2013216","DOI":"10.1016\/j.ins.2010.08.035"},{"issue":"2","key":"284_CR36","doi-asserted-by":"crossref","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 (2002) Computing iceberg concept lattices with titanic. Data Knowl Eng 42(2): 189\u2013222","journal-title":"Data Knowl Eng"},{"key":"284_CR37","doi-asserted-by":"crossref","unstructured":"Uno T (2007) An efficient algorithm for enumerating pseudo cliques. In: ISAAC \u201807: Proceedings of the 18th International Symposium on Algorithms and Computation, Springer, pp 402\u2013414","DOI":"10.1007\/978-3-540-77120-3_36"},{"key":"284_CR38","unstructured":"Yang C, Fayyad U, Bradley PS (2000) Efficient discovery of error-tolerant frequent itemsets in high dimensions. Tech. Rep. 2000-20, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052"},{"issue":"3","key":"284_CR39","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Discov 9(3): 223\u2013248","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"284_CR40","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.datak.2006.01.005","volume":"60","author":"MJ Zaki","year":"2007","unstructured":"Zaki MJ, Peters M, Assent I, Seidl T (2007) Clicks: an effective algorithm for mining subspace clusters in categorical datasets. Data Knowl Eng 60(1): 51\u201370","journal-title":"Data Knowl Eng"},{"issue":"2","key":"284_CR41","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1242524.1242530","volume":"32","author":"Z Zeng","year":"2007","unstructured":"Zeng Z, Wang J, Zhou L, Karypis G (2007) Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans Database Syst 32(2): 13\u201342","journal-title":"ACM Trans Database Syst"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-012-0284-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0284-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T19:57:20Z","timestamp":1562097440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0284-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,21]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0284-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,21]]}}}