{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:45Z","timestamp":1725516285022},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784876"},{"type":"electronic","value":"9783540784883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78488-3_2","type":"book-chapter","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T20:53:48Z","timestamp":1218660828000},"page":"31-48","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Mining Weighted Dense Maximal 1-Complete Regions"],"prefix":"10.1007","author":[{"given":"Haiyun","family":"Bian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raj","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1_1","first-page":"94","volume-title":"Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications, Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201998)","author":"R Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications, Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201998), ACM, New York, June 1998, 94\u2013105."},{"key":"2_CR2_1","volume-title":"Mining Association Rules Between Sets of Items in Large Databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of data (SIGMOD\u201993)","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of data (SIGMOD\u201993), ACM, New York, May 1993, 207\u2013216."},{"key":"2_CR3_1","first-page":"580","volume-title":"Fast Algorithms for Mining Association Rules","author":"R Agrawal","year":"1998","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules, Morgan Kaufmann, Los Altos, CA, 1998, 580\u2013592."},{"unstructured":"Blake, C., Merz, C.: UCI Repository of machine learning databases, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html , 1998.","key":"2_CR4_1"},{"doi-asserted-by":"crossref","unstructured":"Ganter, B., Kuznetsov, S.O.: Stepwise Construction of the Dedekind\u2013MacNeille Completion, Proceedings of Sixth International Conference on Conceptual Structures (ICCS\u201998), August 1998, 295\u2013302.","key":"2_CR5_1","DOI":"10.1007\/BFb0054922"},{"key":"2_CR6_1","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, Berlin Heidelberg New York, 1999."},{"key":"2_CR7_1","first-page":"398","volume-title":"Discovering Frequent Closed Itemsets for Association Rules, Proceeding of the Seventh International Conference on Database Theory (ICDT\u201999)","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules, Proceeding of the Seventh International Conference on Database Theory (ICDT\u201999), Springer, Berlin Heidelberg New York, January 1999, 398\u2013416."},{"key":"2_CR8_1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete, Discrete Applied Mathematics, 131, 2003, 651\u2013654.","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, May 2000, 21\u201330.","key":"2_CR9_1"},{"unstructured":"Roman, T., Natalie, F., et al.: The COG database: an updated version includes eukaryotes, BMC Bioinformatics, 4, September 2003.","key":"2_CR10_1"},{"key":"2_CR11_1","volume-title":"CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201903)","author":"J Wang","year":"2003","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201903), ACM, New York, 2003, 236\u2013245."},{"doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.J.: Charm: an Efficient Algorithm for Closed Itemset Mining, Proceedings of the Second SIAM International Conference on Data Mining (SDM\u201904), April 2002.","key":"2_CR12_1","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Studies in Computational Intelligence","Data Mining: Foundations and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78488-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:14:28Z","timestamp":1606166068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78488-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540784876","9783540784883"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78488-3_2","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}