{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:28Z","timestamp":1760596228756},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T00:00:00Z","timestamp":1343779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst., Man, Cybern. B"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tsmcb.2012.2188283","type":"journal-article","created":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T20:26:28Z","timestamp":1331324788000},"page":"1203-1214","source":"Crossref","is-referenced-by-count":4,"title":["Adapting the Right Measures for Pattern Discovery: A Unified View"],"prefix":"10.1109","volume":"42","author":[{"family":"Junjie Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shiwei Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hui Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jian Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jianming Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"han","year":"2005","journal-title":"Data Mining Concepts and Techniques"},{"key":"ref11","author":"hastie","year":"2001","journal-title":"The Elements of Statistical Learning Data Mining Inference and Prediction"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3283-2"},{"key":"ref13","first-page":"433","article-title":"Mining frequent itemsets with convertible constraints","author":"lakshmanan","year":"2001","journal-title":"Proc Int Conf Data Eng"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.54"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250982"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.059"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888905000408"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161582"},{"key":"ref19","first-page":"174","article-title":"Notes of AAAI'91 workshop knowledge discovery in databases","author":"piatetsky-shapiro","year":"1991","journal-title":"Proc AAAI-93 Workshop Knowledge Discovery in Databases"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.08.004"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253327"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0043-9"},{"key":"ref3","article-title":"Recursion pruning for the apriori algorithm","author":"borgelt","year":"2003","journal-title":"Proc of the FOMI Workshop"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.927730"},{"key":"ref29","author":"zhu","year":"2008","journal-title":"Encyclopedia of Database Systems"},{"key":"ref5","first-page":"447","article-title":"Finding maximal cliques in massive networks by <ref_formula><tex Notation=\"TeX\">${\\rm h}^{\\ast}$<\/tex> <\/ref_formula>-graph","author":"cheng","year":"2010","journal-title":"Proc SIGMOD"},{"key":"ref8","first-page":"230","article-title":"Direct mining of discriminative and essential frequent patterns via model-based search tree","author":"fan","year":"2007","journal-title":"Proc ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502526"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.149"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref20","first-page":"268","article-title":"Search through systematic set enumeration","author":"rymon","year":"1992","journal-title":"Proc 2nd Int Conf Princ Knowl Represent and Reason"},{"key":"ref22","author":"stanley","year":"1981","journal-title":"A Course in Universal Algebra"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/69.553165"},{"key":"ref24","author":"tan","year":"2005","journal-title":"Introduction to Data Mining"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775053"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014090"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74976-9_66"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3477\/6238441\/06166904.pdf?arnumber=6166904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:54Z","timestamp":1633910034000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6166904\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":29,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tsmcb.2012.2188283","relation":{},"ISSN":["1083-4419","1941-0492"],"issn-type":[{"value":"1083-4419","type":"print"},{"value":"1941-0492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}