{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:37:21Z","timestamp":1760708241854},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/socialcom.2010.47","type":"proceedings-article","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T20:19:44Z","timestamp":1285964384000},"source":"Crossref","is-referenced-by-count":10,"title":["Mining Temporal Subgraph Patterns in Heterogeneous Information Networks"],"prefix":"10.1109","author":[{"given":"Hsun-Ping","family":"Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Te","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.15"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref4","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":"Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"ref6","first-page":"398","article-title":"Discovering frequent closed itemsets for association schemes","author":"pasquier","year":"1999","journal-title":"Proceedings of the 7th International Conference on Database Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1043"},{"key":"ref7","first-page":"215","article-title":"PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth","author":"pei","year":"2001","journal-title":"Proceedings of the 17th International Conference on Data Engineering"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association schemes","author":"agrawal","year":"1994","journal-title":"Proceedings of the International Conference on Very Large Data Bases"},{"key":"ref9","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proceedings of IEEE International Conference on Data Mining"}],"event":{"name":"2010 IEEE Second International Conference on Social Computing (SocialCom)","location":"Minneapolis, MN, USA","start":{"date-parts":[[2010,8,20]]},"end":{"date-parts":[[2010,8,22]]}},"container-title":["2010 IEEE Second International Conference on Social Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5590331\/5590391\/05591222.pdf?arnumber=5591222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:42:28Z","timestamp":1497883348000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5591222\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/socialcom.2010.47","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}