{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:45:33Z","timestamp":1729629933673,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/bigdata.2016.7841007","type":"proceedings-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T21:46:59Z","timestamp":1486504019000},"page":"3450-3456","source":"Crossref","is-referenced-by-count":0,"title":["Interactive personalized interesting pattern discovery"],"prefix":"10.1109","author":[{"given":"Mansurul A","family":"Bhuiyan","sequence":"first","affiliation":[]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Lcm ver. 2: Efficient mining algorithms for closed itemsets","author":"uno","year":"2004","journal-title":"ICDM'04 Workshop FIMI'04"},{"key":"ref11","article-title":"One click mining-interactive local pattern discovery through implicit preference and performance learning","author":"boley","year":"2013","journal-title":"workshop on IDEAS"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/2020408.2020499"},{"key":"ref13","article-title":"Maximum entropy models and subjective interestingness: an application to tiles in binary databases","author":"bie","year":"0","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/2020408.2020529"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/2339530.2339776"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-3-642-41398-8_14"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/2806416.2806519"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1150402.1150502"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/s10618-010-0202-x"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.14778\/1687627.1687710"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2396761.2396777"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","year":"1985","journal-title":"Theor Comp Science"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/IJCNN.2010.5596815"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2382577.2382580"},{"year":"2014","author":"zaki","journal-title":"Data Mining and Analysis Fundamental Concepts and Algorithms","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1214\/aos\/1013203451"}],"event":{"name":"2016 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2016,12,5]]},"location":"Washington DC,USA","end":{"date-parts":[[2016,12,8]]}},"container-title":["2016 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7818133\/7840573\/07841007.pdf?arnumber=7841007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:01:54Z","timestamp":1498384914000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7841007\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2016.7841007","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}