{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:46:23Z","timestamp":1767858383278,"version":"3.49.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGKDD Explor. Newsl."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p>\n            Traditionally,\n            <jats:italic>support<\/jats:italic>\n            is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called\n            <jats:italic>togetherness<\/jats:italic>\n            where dissociation among items is also considered as a parameter in the frequent itemset generation process. Results of performance analysis show that association against dissociation is a more pragmatic approach and discovers truly associated candidate itemsets. Second part of the paper extends this\n            <jats:italic>togetherness<\/jats:italic>\n            measure to the domain of variable threshold. Here, like variable minimum\n            <jats:italic>support<\/jats:italic>\n            , a variable minimum\n            <jats:italic>togetherness<\/jats:italic>\n            has been proposed where this minimum value decreases as the itemset size increases. A simple and pragmatic process has been described, which can be easily implemented. It also provides ample control facilities in the hand of the users. Necessary change and extension of the existing algorithms have been made to establish the concepts. Here as well, results of performance analysis justify the approach.\n          <\/jats:p>","DOI":"10.1145\/1117454.1117479","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"151-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Association against dissociation"],"prefix":"10.1145","volume":"7","author":[{"given":"Sukomal","family":"Pal","sequence":"first","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]},{"given":"Aditya","family":"Bagchi","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]}],"member":"320","published-online":{"date-parts":[[2005,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of 20th VLDB Conference","author":"Agrawal R.","year":"1994"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/846219.847313"},{"key":"e_1_2_1_4_1","unstructured":"Pal S. Discovery of Association Rule against Dissociation M. Tech. Dissertation Report Indian Statistical Institute July 2005.  Pal S. Discovery of Association Rule against Dissociation M. Tech. Dissertation Report Indian Statistical Institute July 2005."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198396"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009773317876"}],"container-title":["ACM SIGKDD Explorations Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117454.1117479","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1117454.1117479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:45Z","timestamp":1750263525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117454.1117479"}},"subtitle":["some pragmatic considerations for frequent itemset generation under fixed and variable thresholds"],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1145\/1117454.1117479"],"URL":"https:\/\/doi.org\/10.1145\/1117454.1117479","relation":{},"ISSN":["1931-0145","1931-0153"],"issn-type":[{"value":"1931-0145","type":"print"},{"value":"1931-0153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]},"assertion":[{"value":"2005-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}