{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:33:39Z","timestamp":1729643619067,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/aiccsa.2015.7507186","type":"proceedings-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T00:26:39Z","timestamp":1470961599000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["A survey of uncertainty handling in frequent subgraph mining algorithms"],"prefix":"10.1109","author":[{"given":"Mohamed","family":"Moussaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Montaceur","family":"Zaghdoud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalel","family":"Akaichi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","article-title":"Mining frequent subgraph patterns from uncertain graph data","volume":"22","author":"zou","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TKDE.2010.80","article-title":"Mining frequent subgraph patterns from uncertain graph data","volume":"22","author":"zou","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835885"},{"key":"ref30","first-page":"103","article-title":"Large graph mining: Recent developments, challenges and potential solutions","author":"skhiri","year":"2012","journal-title":"Business Intelligence - Second European Summer School eBISS 2012"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/1951365.1951408","article-title":"Efficient discovery of frequent sub graph patterns in uncertain graph databases","author":"papapetrou","year":"2011","journal-title":"Proceedings of the 14th International Conference on Extending Database Technology"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0268-8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ITAP.2011.6006415"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/int.20308"},{"key":"ref11","first-page":"1082","article-title":"Ring: An integrated method for frequent representative subgraph mining","author":"shijie","year":"2009","journal-title":"Data Mining 2009 ICDM '09 Ninth IEEE International Conference on"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.48"},{"key":"ref13","article-title":"Efficient algorithms for summarizing graph patterns","volume":"99","author":"jianzhong","year":"2010","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.133"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.35"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/sam.11153","article-title":"Effective graph classification based on topological and label attributes","volume":"5","author":"zaki","year":"2012","journal-title":"Statistical Analysis and Data Mining"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/sam.10084","article-title":"Discriminative frequent subgraph mining with optimality guarantees","volume":"3","author":"marisa","year":"2010","journal-title":"Statistical Analysis and Data Mining"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401961"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"ref28","first-page":"2468","article-title":"Problog: a probabilistic prolog and its application in link discovery","author":"raedt","year":"2007","journal-title":"Proceedings of the Joint International Conference for Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"linyua","year":"2011","journal-title":"Physica A Statistical Mechanics and its Applications"},{"key":"ref3","first-page":"13","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"inokuchi","year":"2000"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"ref29","first-page":"1095","article-title":"Local query mining in a probabilistic prolog","author":"kimmig","year":"2009","journal-title":"Proceedings of the 21st International Jont Conference on Artifical Intelligence"},{"key":"ref5","first-page":"82","article-title":"A fast frequent sub graph mining algorithm","author":"jia","year":"2008","journal-title":"Young Computer Scientists 2008 ICYCS 2008 the 9th International Conference for"},{"key":"ref8","first-page":"721","article-title":"gspan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proceedings of the 2002 IEEE International Conference on Data Mining"},{"key":"ref7","first-page":"231","article-title":"Substructure discovery using minimum description length and background knowledge","volume":"1","author":"cook","year":"1994","journal-title":"J Artif Int Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.12.039"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133908"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.2203804"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646027"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.79"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/sam.10004","article-title":"Origami: A novel and effective approach for mining representative orthogonal graph patterns","volume":"1","author":"zaki","year":"2008","journal-title":"Stat Anal Data Min"},{"key":"ref24","first-page":"1","article-title":"Mining frequent dense sub graphs based on extending vertices from unbalanced ppi networks","author":"wang","year":"2009","journal-title":"Bioinformatics and Biomedical Engineering 2009 ICBBE 2009 3rd International Conference on"},{"key":"ref23","article-title":"GTRACE-RS: efficient graph sequence mining using reverse search","volume":"abs 1110 3879","author":"inokuchi","year":"2011","journal-title":"CoRR"},{"key":"ref26","first-page":"2007","article-title":"Managing uncertainty in social networks","volume":"30","author":"adar","year":"2007","journal-title":"IEEE Data Engineering Bulletin"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033330"}],"event":{"name":"2015 IEEE\/ACS 12th International Conference of Computer Systems and Applications (AICCSA)","start":{"date-parts":[[2015,11,17]]},"location":"Marrakech, Morocco","end":{"date-parts":[[2015,11,20]]}},"container-title":["2015 IEEE\/ACS 12th International Conference of Computer Systems and Applications (AICCSA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7502233\/7507087\/07507186.pdf?arnumber=7507186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T20:59:00Z","timestamp":1657054740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7507186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/aiccsa.2015.7507186","relation":{},"subject":[],"published":{"date-parts":[[2015,11]]}}}