{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:06:39Z","timestamp":1754107599690,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811528095"},{"type":"electronic","value":"9789811528101"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-2810-1_18","type":"book-chapter","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T18:03:11Z","timestamp":1580580191000},"page":"178-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fuzzy Association Rule Mining Algorithm Based on Load Classifier"],"prefix":"10.1007","author":[{"given":"Jing","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hui","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhenjiang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Huawei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Sinthuja, M., Puviarasan, N., Aruna, P.: Mining frequent itemsets using proposed top-down approach based on linear prefix tree (TD-LP-Growth). In: Smys, S., Bestak, R., Chen, J.Z., Kotuliak, I. (eds.) International Conference on Computer Networks and Communication Technologies. Lecture Notes on Data Engineering and Communications Technologies, vol. 15, pp. 23\u201332. Springer, Singapore (2019). \nhttps:\/\/doi.org\/10.1007\/978-981-10-8681-6_4","DOI":"10.1007\/978-981-10-8681-6_4"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Imielienskin, T., Swami, A., Agrawal, R.: Mining association rules between set of items in large databases. ACM Sigmod Rec. 22(2), 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/335191.335372"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Zheng, H., He, J., Zhang, Y.C., Shi, Y.: A fuzzy decision tree approach based on data distribution construction. In: Proceedings of the Australasian Computer Science Week Multiconference. ACM (2017). \nhttps:\/\/doi.org\/10.1145\/3014812.3014817","DOI":"10.1145\/3014812.3014817"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"El-Hajj, M., Za\u00efane, O.R.: COFI approach for mining frequent itemsets revisited. In: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2004), pp. 70\u201375. ACM, New York (2004)","DOI":"10.1145\/1008694.1008706"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Yang, X., Nogales-Cadenas, R., Carmona-Saez, P., Pascual-Montano, A.: Finding closed frequent item sets by intersecting transactions. In: Proceedings of the 14th International Conference on Extending Database Technology (EDBT\/ICDT 2011), pp. 367\u2013376. ACM, New York (2011)","DOI":"10.1145\/1951365.1951410"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Kim, M.-S., Kim, S.-W., Shin, M.: Optimization of subsequence matching under time warping in time-series databases. In: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC 2005), pp. 581\u2013586. ACM, New York (2005)","DOI":"10.1145\/1066677.1066814"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Thanh Lam, H., Calders, T.: Mining top-k frequent items in a data stream with flexible sliding windows. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pp. 283\u2013292. ACM, New York (2010)","DOI":"10.1145\/1835804.1835842"},{"key":"18_CR9","unstructured":"Giannella, C., Han, J., Pei, J., et al.: Mining frequent patterns in data streams at multiple time granularities. Next Gener. Data Min. 212, 191\u2013212 (2003)"},{"issue":"03","key":"18_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1142\/S0219622014500138","volume":"13","author":"T Ramkumar","year":"2014","unstructured":"Ramkumar, T., Srinivasan, R., Hariharan, S.: Synthesizing global association rules from different data sources based on desired interestingness metrics. Int. J. Inf. Technol. Decis. Making 13(03), 473\u2013495 (2014)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Carmichael, C.L., Hao, B.: Efficient mining of frequent patterns from uncertain data. In: IEEE ICDM Workshops, pp. 489\u2013494 (2007)","DOI":"10.1109\/ICDMW.2007.84"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CK-S Leung","year":"2008","unstructured":"Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653\u2013661. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68125-0_61"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: PFP: parallel fp-growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems (RecSys 2008), pp. 107\u2013114. ACM, New York (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Delgado, M., Marin, N., Sanchez, D., Vila, M.: Fuzzy association rules: general model and applications. IEEE Trans. Fuzzy Syst. 11(2), 214\u2013225 (2003)","DOI":"10.1109\/TFUZZ.2003.809896"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Koh, Y.S.: Rare association rule mining and knowledge discovery: Technologies for infrequent and critical event detection: volume 3 (2009)","DOI":"10.4018\/978-1-60566-754-6"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Padillo, F., Luna, J.M., Ventura, S.: An evolutionary algorithm for mining rare association rules: a big data approach. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2007\u20132014 (2017)","DOI":"10.1109\/CEC.2017.7969547"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Shakeri, O., Pedram, M.M., Kelarestaghi, M.: A fuzzy constrained stream sequential pattern mining algorithm. In: 7th International Symposium on Telecommunications, pp. 20\u201324 (2014)","DOI":"10.1109\/ISTEL.2014.7000663"},{"issue":"06","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1142\/S0219622015500297","volume":"14","author":"C Chen","year":"2015","unstructured":"Chen, C., et al.: Finding active membership functions for genetic-fuzzy data mining. Int. J. Inf. Technol. Decis. Making 14(06), 1215\u20131242 (2015)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"key":"18_CR19","unstructured":"Grahne, G., Zhu, J.: Mining frequent itemsets from secondary memory. In: Fourth IEEE International Conference on Data Mining (ICDM 2004), Brighton, UK, pp. 91\u201398 (2004)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, L., Zhong, Z., Chang, J., et al.: Balanced parallel FP-growth with MapReduce. In: 2010 IEEE Youth Conference on Information, Computing and Telecommunications, Beijing, pp. 243\u2013246 (2010)","DOI":"10.1109\/YCICT.2010.5713090"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Lin, J.C.W., Zhang, Y., Fournier-Viger, P., Hong, T.P.: Efficiently updating the discovered multiple fuzzy frequent itemsets with transaction insertion. Int. J. Fuzzy Syst. 20(8), 2440\u20132457 (2018)","DOI":"10.1007\/s40815-018-0520-5"},{"issue":"06","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1142\/S0219622017500341","volume":"16","author":"JC Lin","year":"2017","unstructured":"Lin, J.C., et al.: Mining weighted frequent itemsets without candidate generation in uncertain databases. Int. J. Inf. Technol. Decis. Making 16(06), 1549\u20131579 (2017)","journal-title":"Int. J. Inf. Technol. Decis. Making"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2810-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T10:04:20Z","timestamp":1587809060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2810-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811528095","9789811528101"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2810-1_18","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Service","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icds2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vcrab.com.au\/ICDS2019\/home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}