{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:24:28Z","timestamp":1725668668086},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642284892"},{"type":"electronic","value":"9783642284908"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28490-8_38","type":"book-chapter","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T06:05:53Z","timestamp":1331705153000},"page":"361-370","source":"Crossref","is-referenced-by-count":7,"title":["Structures of Association Rule Set"],"prefix":"10.1007","author":[{"given":"Anh","family":"Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tin","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, N.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOID, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"38_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 478\u2013499 (1994)"},{"key":"38_CR3","unstructured":"Bao, H.T.: An approach to concept formation based on formal concept analysis. IEICE Trans. Information and Systems\u00a0E78-D(5) (1995)"},{"issue":"95","key":"38_CR4","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"Duquenne, V., Guigues, J.-L.: Famille minimale d\u2019implications informatives re\u2019sultant d\u2019un tableau de donn\u00e9es binaires. Math. Sci. Hum.\u00a024(95), 5\u201318 (1986)","journal-title":"Math. Sci. Hum."},{"key":"38_CR5","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1950","unstructured":"Feller, W.: An introduction to probability theory and its applications, vol.\u00a0I. John Wiley & Sons. Inc., Chapman & Hall. Ltd., New York, London (1950)"},{"issue":"113","key":"38_CR6","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"Luxenburger, M.: Implications partielles dans un contexte. Math. Inf. Sci. Hum.\u00a029(113), 35\u201355 (1991)","journal-title":"Math. Inf. Sci. Hum."},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. of Intelligent Information Systems\u00a024(1), 29\u201360 (2005)","journal-title":"J. of Intelligent Information Systems"},{"key":"38_CR8","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proceedings of the DMKD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"38_CR9","series-title":"SCI","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12090-9_19","volume-title":"Advances in Intelligent Information and Database Systems","author":"T. Tin","year":"2010","unstructured":"Tin, T., Anh, T.: Structure of Set of Association Rules Based on Concept Lattice. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol.\u00a0283, pp. 217\u2013227. Springer, Heidelberg (2010)"},{"key":"38_CR10","unstructured":"Tin, T., Anh, T., Thong, T.: Structure of association rule set based on min-min basic rules. In: Proceedings of the 2010 IEEE-RIVF International Conference on Computing and Communication Technologies, pp. 83\u201388 (2010)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery\u00a0(9), 223\u2013248 (2004)","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"},{"issue":"4","key":"38_CR12","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"38_CR13","unstructured":"Frequent Itemset Mining Dataset Repository (2009), \n                    \n                      http:\/\/fimi.cs.helsinki.fi\/data\/"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28490-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T17:05:50Z","timestamp":1556471150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28490-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284892","9783642284908"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28490-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}