{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:06Z","timestamp":1750307706877,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T00:00:00Z","timestamp":1231459200000},"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":[],"published-print":{"date-parts":[[2009,1,9]]},"DOI":"10.1145\/1517303.1517314","type":"proceedings-article","created":{"date-parts":[[2009,4,6]],"date-time":"2009-04-06T16:34:53Z","timestamp":1239035693000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["An interactive method for generalized association rule mining using FP-tree"],"prefix":"10.1145","author":[{"given":"Manisha","family":"Agarwal","sequence":"first","affiliation":[{"name":"Banasthali University, Rajasthan, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manisha","family":"Jailia","sequence":"additional","affiliation":[{"name":"Banasthali University, Rajasthan, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_2_1","first-page":"487","volume-title":"Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94)","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal , R. Srikant . Fast algorithm for mining association rules . In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94) , pages 487 -- 499 , Santiago, Chile , Sept. 1994 . R. Agrawal, R. Srikant. Fast algorithm for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB'94), pages 487--499, Santiago, Chile, Sept. 1994."},{"key":"e_1_3_2_1_3_1","volume-title":"Of the VLDB'95","author":"Han J.","year":"1995","unstructured":"J. Han , Y. Fu. \"Discovery of Multiple Level Association Rules from very large databases\".IN Proc . Of the VLDB'95 , 1995 , ZURICH, Switzerland. J. Han, Y. Fu. \"Discovery of Multiple Level Association Rules from very large databases\".IN Proc. Of the VLDB'95, 1995, ZURICH, Switzerland."},{"key":"e_1_3_2_1_4_1","volume-title":"IN Proc. Of the VLDB'95","author":"Srikant R.","year":"1995","unstructured":"R. Srikant , R. Agrawal. \"Mining Generalized Association Rules\". IN Proc. Of the VLDB'95 , 1995 , ZURICH, Switzerland. R. Srikant, R. Agrawal. \"Mining Generalized Association Rules\". IN Proc. Of the VLDB'95, 1995, ZURICH, Switzerland."},{"key":"e_1_3_2_1_5_1","volume-title":"IN Proc. Of the VLDB'95","author":"Savasasere A.","year":"1995","unstructured":"A. Savasasere , E. Omielinski , and S. Navathe .\" An efficient algorithm for Mining association rules in large databases \". IN Proc. Of the VLDB'95 , 1995 , ZURICH, Switzerland. A. Savasasere, E. Omielinski, and S. Navathe.\" An efficient algorithm for Mining association rules in large databases\". IN Proc. Of the VLDB'95, 1995, ZURICH, Switzerland."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"},{"key":"e_1_3_2_1_7_1","volume-title":"IN Proc. Of the 3rd INT. Conf. on KDD and Data mining (KDD'97)","author":"Zaki M. J","year":"1997","unstructured":"M. J Zaki , S. Parthsarthy , M. Ogihara and W. Li .\" New algorithms for fast discovering of association rules \". IN Proc. Of the 3rd INT. Conf. on KDD and Data mining (KDD'97) , California , August 1997 . M. J Zaki, S. Parthsarthy, M. Ogihara and W. Li.\" New algorithms for fast discovering of association rules\". IN Proc. Of the 3rd INT. Conf. on KDD and Data mining (KDD'97), California, August 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645802.669199"},{"key":"e_1_3_2_1_9_1","unstructured":"K. Sriphaew T. Theeramunkong \" A new method for finding Generalized frequent itemsets in Generalized Association Rule Mining\".  K. Sriphaew T. Theeramunkong \" A new method for finding Generalized frequent itemsets in Generalized Association Rule Mining\"."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381002"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_12_1","unstructured":"K. Ong Wee. Ng EE. Peng LIM \" Mining Multilevel Rules with recurrent items using FP-tree\" K. Ong Wee. Ng EE. Peng LIM \" Mining Multilevel Rules with recurrent items using FP-tree\""}],"event":{"name":"Compute '09: ACM Bangalore Chapter Compute 2009","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Bangalore India","acronym":"Compute '09"},"container-title":["Proceedings of the 2nd Bangalore Annual Compute Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1517303.1517314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1517303.1517314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1517303.1517314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,9]]},"references-count":12,"alternative-id":["10.1145\/1517303.1517314","10.1145\/1517303"],"URL":"https:\/\/doi.org\/10.1145\/1517303.1517314","relation":{},"subject":[],"published":{"date-parts":[[2009,1,9]]},"assertion":[{"value":"2009-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}