{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:00:38Z","timestamp":1725674438901},"publisher-location":"New Delhi","reference-count":22,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132204909"},{"type":"electronic","value":"9788132204916"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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-81-322-0491-6_48","type":"book-chapter","created":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T08:55:10Z","timestamp":1334220910000},"page":"527-539","source":"Crossref","is-referenced-by-count":3,"title":["Discovering Rare Association Rules Using Probability Apriori in Grid Environments"],"prefix":"10.1007","author":[{"given":"Sandeep Singh","family":"Rawat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshmi","family":"Rajamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"Agrawal, R., Srikant, R.: T algorithms for mining association rules. In: Proceedings of 20th VLDB Conference, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"key":"48_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-47887-6_13","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Jaroszewicz","year":"2002","unstructured":"Jaroszewicz, S., Simovici, D.A.: Pruning Redundant Association Rules using Maximum Entropy Principle. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 135\u2013142. Springer, Heidelberg (2002)"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-30075-5_45","volume-title":"Database and Expert Systems Applications","author":"M.Z. Ashrafi","year":"2004","unstructured":"Ashrafi, M.Z., Taniar, D., Smith, K.: A new approach of eliminating redundant association rules. In: Galindo, F., Takizawa, M., Traunm\u00fcller, R. (eds.) DEXA 2004. LNCS, vol.\u00a03180, pp. 465\u2013474. Springer, Heidelberg (2004)"},{"key":"48_CR4","unstructured":"Craus, M., Aflori, C.: Association Rules Discovery using Grid Services. In: SETIT, pp. 1\u20135 (2005)"},{"issue":"1","key":"48_CR5","first-page":"71","volume":"32","author":"S. Kotsiantis","year":"2006","unstructured":"Kotsiantis, S., Kanellopoulos, D.: Association Rules Mining: A Recent Overview. International Transactions on Computer Science and Engineering\u00a032(1), 71\u201382 (2006)","journal-title":"International Transactions on Computer Science and Engineering"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Wojciechowski, M., Galecki, K., Gawronek, K.: Three Strategies for Concurrent Processing of Frequent Itemset Queries Using FP-Growth. In: KDID, pp. 240\u2013258 (2006)","DOI":"10.1007\/978-3-540-75549-4_15"},{"key":"48_CR7","first-page":"1","volume-title":"Workshop Open Source Data Mining Software (OSDM 2005)","author":"C. Borgelt","year":"2005","unstructured":"Borgelt, C.: An Implementation of the FP-growth Algorithm. In: Workshop Open Source Data Mining Software (OSDM 2005), Chicago, IL, pp. 1\u20135. ACM Press, New York (2005)"},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:DAMI.0000005257.93780.3b","volume":"8","author":"F. Coenen","year":"2003","unstructured":"Coenen, F., Goulbourne, G., Leng, P.: Tree Structures for Mining association Rules. Journal of Data Mining and Knowledge Discovery\u00a08(1), 25\u201351 (2003)","journal-title":"Journal of Data Mining and Knowledge Discovery"},{"key":"48_CR9","unstructured":"Han, Kamber: Data Mining concepts and techniques, pp. 230\u2013300. Pearson Education (2008)"},{"key":"48_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-24768-5_51","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"K. Techapichetvanich","year":"2004","unstructured":"Techapichetvanich, K., Datta, A.: Visual mining of market basket association rules. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03046, pp. 479\u2013488. Springer, Heidelberg (2004)"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: ACM Special Interest Group on Knowledge Discovery and Data Mining Explorations, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"key":"48_CR12","unstructured":"Liu, G., Lu, H., Yu, J.X., Wang, W., Xiao, X.: AFOPT: An Efficient Implementation of Pattern Growth Approach. Hong Kong University of Science & Technology Hong Kong, China (2004)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Uday Kiran, R., Krishna Reddy, P.: Mining Rare Association Rules in the Datasets in Which Items\u2019 Frequencies Vary Widely, at Center for Data Engineering, International Institute of Information Technology-Hyderabad (2010)","DOI":"10.1007\/978-3-642-12026-8_6"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Uday Kiran, R., Krishna Reddy, P.: An Improved Multiple Minimum Support Based Approach to Mine Rare Association Rules. In: IEEE Symposium on Computational Intelligence and Data Mining (IEEE CIDM), pp. 340\u2013347 (2009)","DOI":"10.1109\/CIDM.2009.4938669"},{"issue":"2","key":"48_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10618-005-0026-2","volume":"13","author":"Michael Hahsler","year":"2006","unstructured":"Hashler, M.: A Model-Based Frequency Constraint for Mining Associations from Transaction Data. at Springer Science & Business Media, LLC. Manufactured in the United States, Data Mining and Knowledge Discovery 13, 137\u2013166 (2006)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Hipp, J., Gontzer, U., Gholamreza: Algorithms for Association Rule Mining - A General Survey and Comparison. In: ACM SIGKDD (2000)","DOI":"10.1145\/360402.360421"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yau, S.: Association Rule and Quantitative Association Rule Mining among Infrequent Items. In: ACM SIGKDD 2007 (2007)","DOI":"10.1145\/1341920.1341929"},{"key":"48_CR18","unstructured":"Frequent Itemset MIning Repository, \n                  \n                    http:\/\/fimi.cs.helsinki.fi\/data\/"},{"issue":"3","key":"48_CR19","first-page":"691","volume":"11","author":"M.C. Fernandez","year":"2001","unstructured":"Fernandez, M.C., Menasalvas, E., Millan, S.: Minimal Decision Rules Based on the APRIORI Algorithm. Int. J. Appl. Math. Computer Science\u00a011(3), 691\u2013704 (2001)","journal-title":"Int. J. Appl. Math. Computer Science"},{"key":"48_CR20","unstructured":"Li, P., Chen, J., Bian, F.: A developed algorithm of apriori based on association analysis. State Key Laboratory of information Engineering in Surveying Mapping & Remote Sensing WuHan University\u00a05(3) (2007)"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"Li, P., Chen, J., Bian, F.: A Developed Algorithm of Apriori Based on Association Analysis. Geo-spatial Information Science (Quarterly)\u00a07(2) (June 2004)","DOI":"10.1007\/BF02826646"},{"key":"48_CR22","volume-title":"Third Conference on Data Mining and Optimization, DMO 2011","author":"S.S. Rawat","year":"2011","unstructured":"Rawat, S.S., Rajamani, L.: Probability Apriori based Approach to Mine Rare Association Rules. In: Third Conference on Data Mining and Optimization, DMO 2011, IEEE Malaysia Section and IEEE Computer Society, Malaysia (June 2011) ISSN: 2155-6938"}],"container-title":["Advances in Intelligent and Soft Computing","Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-0491-6_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T04:12:49Z","timestamp":1556683969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-81-322-0491-6_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9788132204909","9788132204916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-0491-6_48","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2012]]}}}