{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:32:05Z","timestamp":1754109125601,"version":"3.37.3"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61372187"],"award-info":[{"award-number":["61372187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific and Technological Project of Sichuan Province","award":["2019YFG0100"],"award-info":[{"award-number":["2019YFG0100"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2926735","type":"journal-article","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:03:23Z","timestamp":1562526203000},"page":"91518-91534","source":"Crossref","is-referenced-by-count":2,"title":["Selection of Satisfied Association Rules via Aggregation of Linguistic Satisfied Degrees"],"prefix":"10.1109","volume":"7","author":[{"given":"Fangling","family":"Ren","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5757-6607","authenticated-orcid":false,"given":"Zheng","family":"Pei","sequence":"additional","affiliation":[]},{"given":"Kehong","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2412037"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2415257"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2724769"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2766528"},{"key":"ref39","first-page":"283","article-title":"New algorithms for fast discovery of association rules","author":"zaki","year":"1997","journal-title":"Proc 3rd Int Conf Knowl Discovery Data Mining (KDD)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.06.059"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.05.042"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2011.07.002"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.08.014"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.039"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.09.137"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.059"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2016.2578341"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2006.876337"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2007.896353"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.025"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.09.032"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.125"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.10.016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.05.020"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488513500426"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.120"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2007.07.018"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0258-3"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/21.87068"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2685521"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132963"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2014.2359494"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.01.056"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.10.100"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.04.015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.01.007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.07.029"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2003.809896"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.03.008"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(97)00077-8"},{"journal-title":"The 2-Tuple Linguistic Model Computing with Words in Decision Making","year":"2015","author":"mart\u00ednez","key":"ref59"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/91.890332"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2013.2245136"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.08.012"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2170076"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(99)00024-X"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04711-9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.2991\/978-94-91216-28-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2017.07.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488511007039"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.09.013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.094"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.10.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.02.051"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.058"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.01.021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.02.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.08.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-7051(99)00019-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/69.824588"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/5254.889106"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(03)00072-3"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TSMCB.2012.2188283","article-title":"Adapting the right measures for pattern discovery: A unified view","volume":"42","author":"wu","year":"2012","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161582"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.02.027"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2002-6303"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5564(75)90047-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253327"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.fcij.2017.04.003"},{"key":"ref47","first-page":"23","article-title":"Association rules extraction using multi-objective feature of genetic algorithm","author":"gupta","year":"2013","journal-title":"Proc World Congr Eng Comput Sci (WCECS)"},{"key":"ref42","first-page":"41","article-title":"A measurement-theoretic foundation of rule interestingness evaluation","author":"yao","year":"2006","journal-title":"Foundations and Novel Approaches in Data Mining"},{"key":"ref41","first-page":"1","article-title":"LCM: An efficient algorithm for enumerating frequent closed item sets","volume":"90","author":"uno","year":"2003","journal-title":"Proc Workshop Frequent Item Set Mining Implementations"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48751-4_17"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08755825.pdf?arnumber=8755825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:02Z","timestamp":1628624402000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8755825\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2926735","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}