{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:07Z","timestamp":1725529807560},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006715"},{"type":"electronic","value":"9783642006722"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00672-2_32","type":"book-chapter","created":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T17:04:48Z","timestamp":1237655088000},"page":"357-368","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Algorithm for Mining Non-Redundant Interacting Feature Subsets"],"prefix":"10.1007","author":[{"given":"Chaofeng","family":"Sha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between sets of items in large databases. In: Buneman, P. (ed.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"32_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: Proceedings of 1997 ACM-SIGMOD International Conference on Management of Data (SIGMOD 1997) (1997)","DOI":"10.1145\/253260.253327"},{"key":"32_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"32_CR5","series-title":"Wiley Series in Telecommunications","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley Series in Telecommunications. Wiley Interscience, Hoboken (1991)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0019-9958(78)90275-9","volume":"36","author":"T.S. Han","year":"1978","unstructured":"Han, T.S.: Nonnegative entropy measures of multivariate symmetric correlations. Inform. Contr.\u00a036, 133\u2013156 (1978)","journal-title":"Inform. Contr."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Heikinheimo, H., Hinkkanen, E., Mannila, H., Mielikainen, T., Seppanen, J.: Finding low-Entropy sets and trees from binary data. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007)","DOI":"10.1145\/1281192.1281232"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/1150402.1150430","volume-title":"Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Y. Ke","year":"2006","unstructured":"Ke, Y., Cheng, J., Ng, W.: Mining Quantitative Correlated Patterns Using an Information-Theoretic Approach. In: Eliassi-Rad, T. (ed.) Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 227\u2013236. ACM, Philadelphia (2006)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Knobbe, A., Ho, E.: Maximally informative k-itemsets and their efficient discovery. In: KDD 2006, pp. 237\u2013244 (2006)","DOI":"10.1145\/1150402.1150431"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E.R. Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative Interest Measures for Mining Associations in Databases. IEEE Transactions on Data Engineering\u00a015(1), 57\u201369 (2003)","journal-title":"IEEE Transactions on Data Engineering"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Pan, F., Roberts, A., McMillan, L., de Villena, F., Threadgill, D., Wang, W.: Sample selection for maximal diversity. In: Proceedings of the 5th IEEE International Conference on Data Mining (2007)","DOI":"10.1109\/ICDM.2007.16"},{"key":"32_CR12","unstructured":"Pan, F., Wang, W., Tung, A.K.H., Yang, J.: Finding representative set from massive data. In: ICDM 2005, pp. 338\u2013345 (2005)"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H. Xiong","year":"2006","unstructured":"Xiong, H., Tan, P., Kumar, V.: Hyperclique Pattern Discovery. Data Mining and Knowledge Discovery Journal\u00a013(2), 219\u2013242 (2006)","journal-title":"Data Mining and Knowledge Discovery Journal"},{"key":"32_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8608-5","volume-title":"A first course in information theory","author":"R.W. Yeung","year":"2002","unstructured":"Yeung, R.W.: A first course in information theory. Springer, Heidelberg (2002)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, X., Pan, F., Wang, W., Nobel, A.: Mining non-redundant high order correlation in binary data. In: Proceedings of the 34th International Conference on Very Large Data Bases, Vienna, Austria, Auckland, New Zealand (2008)","DOI":"10.14778\/1453856.1453981"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00672-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T05:59:11Z","timestamp":1551938351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00672-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006715","9783642006722"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00672-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}