{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:50:11Z","timestamp":1725573011409},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408079_17","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"175-187","source":"Crossref","is-referenced-by-count":20,"title":["Mining Succinct Systems of Minimal Generators of Formal Concepts"],"prefix":"10.1007","author":[{"given":"Guozhu","family":"Dong","sequence":"first","affiliation":[]},{"given":"Chunyu","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[]},{"given":"Jinyan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Limsoon","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Mining association rules between sets of items in large databases. In: SIGMOD 1993 (1993)","DOI":"10.1145\/170035.170072"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","volume":"96","author":"U. Alon","year":"1999","unstructured":"Alon, U., et al.: Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proc.\u00a0 Nat.\u00a0Academy of Sciences of the United States of American\u00a096, 6745\u2013675 (1999)","journal-title":"Proc. Nat. Academy of Sciences of the United States of American"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"Boulicaut, J.-F., et al.: Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mininig and Knowledge Discovery\u00a07(1), 5\u201322 (2003)","journal-title":"Data Mininig and Knowledge Discovery"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Burdick, D., et al.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: ICDE 2001 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: PKDD 2002 (2002)","DOI":"10.1007\/3-540-45681-3_7"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient mining of emerging patterns: Discovering trends and differences. In: KDD 1999 (1999)","DOI":"10.1145\/312129.312191"},{"key":"17_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hereth, J., et al.: Conceptual knowledge discovery and data analysis. In: Int.\u00a0Conf.\u00a0on Conceptual Structures, pp. 421\u2013437 (2000)","DOI":"10.1007\/10722280_29"},{"key":"17_CR9","series-title":"LNCS","volume-title":"Proc.\u00a0Int.\u00a0Conf.\u00a0on Conceptual Structures","year":"2000","unstructured":"Mineau, G., Ganter, B. (eds.): Proc.\u00a0Int.\u00a0Conf.\u00a0on Conceptual Structures. LNCS, vol.\u00a01867. Springer, Heidelberg (2000)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Pasquier, N., et al.: Discovering frequent closed itemsets for association rules. In: ICDT 1999 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"17_CR11","unstructured":"Pei, J., et al.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD DMKD 2000 (2000)"},{"key":"17_CR12","unstructured":"Pfaltz, J.L., Taylor, C.M.: Closed set mining of biological data. In: BIOKDD 2002 (2002)"},{"key":"17_CR13","unstructured":"Rymon, R.: Search through systematic set enumeration. In: Proc. of Int\u2019l Conf. on Principles of Knowledge Representation and Reasoning, Cambridge MA, pp. 539\u2013550 (1992)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Wang, J., et al.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: KDD 2003 (2003)","DOI":"10.1145\/956755.956779"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.: CHARM: An efficient algorithm for closed itemset mining. In: SDM 2002 (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: KDD 2000 (2000)","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:20Z","timestamp":1605642680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11408079_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}