{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:03:05Z","timestamp":1725541385991},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642105821"},{"type":"electronic","value":"9783642105838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10583-8_19","type":"book-chapter","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T14:38:51Z","timestamp":1259073531000},"page":"163-170","source":"Crossref","is-referenced-by-count":10,"title":["Soft Set Approach for Maximal Association Rules Mining"],"prefix":"10.1007","author":[{"given":"Tutut","family":"Herawan","sequence":"first","affiliation":[]},{"given":"Iwan Tri Riyadi","family":"Yanto","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"Mat Deris","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on the Management of Data, pp. 207\u2013216 (1993)","key":"19_CR1","DOI":"10.1145\/170036.170072"},{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)","key":"19_CR2"},{"unstructured":"Feldman, R., Aumann, Y., Amir, A., Zilberstein, A., Klosgen, W.: Maximal association rules: a new tool for mining for keywords cooccurrences in document collections. In: Proceedings of the KDD 1997, pp. 167\u2013170 (1997)","key":"19_CR3"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0094806","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"R. Feldman","year":"1998","unstructured":"Feldman, R., Fresko, M., Kinar, Y., Lindell, Y., Liphstat, O., Rajman, M., Schler, Y., Zamir, O.: Text mining at the term level. In: \u017bytkow, J.M. (ed.) PKDD 1998. LNCS, vol.\u00a01510, pp. 65\u201373. Springer, Heidelberg (1998)"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10844-005-0196-9","volume":"25","author":"A. Amir","year":"2005","unstructured":"Amir, A., Aumann, Y., Feldman, R., Fresco, M.: Maximal Association Rules: A Tool for Mining Associations in Text. Journal of Intelligent Information Systems\u00a025(3), 333\u2013345 (2005)","journal-title":"Journal of Intelligent Information Systems"},{"doi-asserted-by":"crossref","unstructured":"Guan, J.W., Bell, D.A., Liu, D.Y.: The Rough Set Approach to Association Rule Mining. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM 2003 (2003)","key":"19_CR6","DOI":"10.1109\/ICDM.2003.1250969"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0950-7051(03)00025-X","volume":"16","author":"Y. Bi","year":"2003","unstructured":"Bi, Y., Anderson, T., McClean, S.: A rough set model with ontologies for discovering maximal association rules in document collections. Knowledge-Based Systems\u00a016, 243\u2013251 (2003)","journal-title":"Knowledge-Based Systems"},{"key":"19_CR8","first-page":"163","volume-title":"Studies in Computational Intelligence","author":"J.W. Guan","year":"2005","unstructured":"Guan, J.W., Bell, D.A., Liu, D.Y.: Mining Association Rules with Rough Sets. In: Studies in Computational Intelligence, pp. 163\u2013184. Springer, Heidelberg (2005)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. International Journal of Computer and Information Science\u00a011, 341\u2013356 (1982)","journal-title":"International Journal of Computer and Information Science"},{"key":"19_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough sets: A theoretical aspect of reasoning about data","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough sets: A theoretical aspect of reasoning about data. Kluwer Academic Publisher, Dordrecht (1991)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","volume":"177","author":"Z. Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences\u00a0177(1), 3\u201327 (2007)","journal-title":"Information Sciences"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0898-1221(99)00056-5","volume":"37","author":"D. Molodtsov","year":"1999","unstructured":"Molodtsov, D.: Soft set theory-first results. Computers and Mathematics with Applications\u00a037, 19\u201331 (1999)","journal-title":"Computers and Mathematics with Applications"},{"doi-asserted-by":"crossref","unstructured":"Herawan, T., Mustafa, M.D.: A direct proof of every rough set is a soft set. In: Proceeding of International Conference AMS 2009 (2009)","key":"19_CR13","DOI":"10.1109\/AMS.2009.148"},{"unstructured":"Reuters-21578 (2002), \n                  \n                    http:\/\/www.research.att.com\/lewis\/reuters21578.html","key":"19_CR14"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/00207160500113330","volume":"83","author":"M. Mat Deris","year":"2006","unstructured":"Mat Deris, M., Nabila, N.F., Evans, D.J., Saman, M.Y., Mamat, A.: Association rules on significant rare data using second support. International Journal of Computer Mathematics\u00a083(1), 69\u201380 (2006)","journal-title":"International Journal of Computer Mathematics"}],"container-title":["Communications in Computer and Information Science","Database Theory and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10583-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:35:52Z","timestamp":1619782552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10583-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642105821","9783642105838"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10583-8_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}