{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:12:31Z","timestamp":1761401551166},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"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. A"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/tsmca.2010.2096808","type":"journal-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T20:53:49Z","timestamp":1294692829000},"page":"1013-1025","source":"Crossref","is-referenced-by-count":15,"title":["OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered Trees"],"prefix":"10.1109","volume":"41","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Haghir Chehreghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caro","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Rahgozar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2005040104"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2008.923034"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5832-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.125"},{"key":"ref35","first-page":"33","article-title":"Efficiently mining frequent embedded unordered trees","volume":"66","author":"zaki","year":"2005","journal-title":"Fundam Inf"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/775056.775058"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"inokuchi","year":"2000","journal-title":"Proc Conf Principles Knowledge Discovery Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791218202"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref13","author":"luccio","year":"2001","journal-title":"Exact rooted subtree matching in sublinear time"},{"key":"ref14","author":"luccio","year":"2004","journal-title":"Bottomup subtree isomorphism for unordered labeled trees"},{"key":"ref15","first-page":"47","article-title":"Discovery of frequent tree structured patterns in semistructured Web documents","author":"miyahara","year":"2001","journal-title":"Proc PAKDD"},{"key":"ref16","first-page":"133","article-title":"Discovery of maximally frequent tag tree patterns with contractible variables from semistructured documents","author":"miyahara","year":"2004","journal-title":"Proc PAKDD"},{"key":"ref17","first-page":"55","article-title":"Efficient discovery of frequent unordered trees","author":"nijssen","year":"2003","journal-title":"Proc 1st Int Workshop Mining Graphs Trees Sequences"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2002.1029709"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/69.846290","article-title":"Discovering structural association of semistructured data","volume":"12","author":"wang","year":"2000","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916734"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290982"},{"key":"ref3","first-page":"47","article-title":"Discovering frequent substructures in large unordered trees","author":"asai","year":"2003","journal-title":"Proc 6th Int Conf Discovery Sci"},{"key":"ref6","first-page":"11","article-title":"HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms","author":"chi","year":"2004","journal-title":"Proc 16th Int Conf Sci Stat Database Manage"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2006.886377"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"ref8","first-page":"66","article-title":"Mining XML-enabled association rule with templates","author":"feng","year":"2004","journal-title":"Proc KDID"},{"key":"ref7","first-page":"63","article-title":"CMTreeMiner: Mining both closed and maximal frequent subtrees","author":"chi","year":"2004","journal-title":"Proc PAKDD"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972726.10"},{"key":"ref9","first-page":"88","article-title":"An XML-enabled association rule framework","author":"feng","year":"2003","journal-title":"Proc DEXA"},{"key":"ref1","author":"aho","year":"1974","journal-title":"The Design and Analysis of Computer Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1320039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1376815.1376818"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/WIRI.2005.40"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183680"},{"key":"ref26","first-page":"271","article-title":"Schema discovery for semistructured data","author":"wang","year":"1997","journal-title":"Proc 3rd Int Conf Knowl Discovery Data Mining (SIGKDD)"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-540-24775-3_54","article-title":"Efficient pattern-growth methods for frequent tree pattern mining","author":"wang","year":"2004","journal-title":"Proc Pacific Asia Conf Knowledge Discovery and Data Mining"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3468\/5986826\/05682417.pdf?arnumber=5682417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:46:16Z","timestamp":1633909576000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5682417\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":37,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsmca.2010.2096808","relation":{},"ISSN":["1083-4427","1558-2426"],"issn-type":[{"value":"1083-4427","type":"print"},{"value":"1558-2426","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}