{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T20:09:34Z","timestamp":1710274174218},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T00:00:00Z","timestamp":1344556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10115-012-0528-3","type":"journal-article","created":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T01:17:34Z","timestamp":1344475054000},"page":"491-522","source":"Crossref","is-referenced-by-count":10,"title":["Graph mining for discovering infrastructure patterns in configuration management databases"],"prefix":"10.1007","volume":"33","author":[{"given":"Pranay","family":"Anchuri","sequence":"first","affiliation":[]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[]},{"given":"Omer","family":"Barkol","sequence":"additional","affiliation":[]},{"given":"Ruth","family":"Bergman","sequence":"additional","affiliation":[]},{"given":"Yifat","family":"Felder","sequence":"additional","affiliation":[]},{"given":"Shahar","family":"Golan","sequence":"additional","affiliation":[]},{"given":"Arik","family":"Sityon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,10]]},"reference":[{"key":"528_CR1","doi-asserted-by":"crossref","unstructured":"Al Hasan M, Zaki MJ (2009) Output space sampling for graph patterns. In: Proceedings of the 35th international conference on very large data bases, VLDB endowment, vol 2, no. 1, pp 730\u2013741","DOI":"10.14778\/1687627.1687710"},{"key":"528_CR2","doi-asserted-by":"crossref","unstructured":"Almeida H, Guedes D, Meira W Jr, Zaki MJ (2011) Is there a best quality metric for graph clusters? In: 15th European conference on principles and practice of knowledge discovery in databases","DOI":"10.1007\/978-3-642-23780-5_13"},{"key":"528_CR3","unstructured":"Besemann C, Denton A (2007) Mining edge-disjoint patterns in graph-relational data. In: Proceedings of the workshop on data mining for biomedical informatics at SDM-07, Citeseer, Minneapolis"},{"key":"528_CR4","doi-asserted-by":"crossref","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the seventh international conference on, world wide web 7, WWW7, pp 107\u2013117","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"528_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: 12th Pacific-Asia conference on knowledge discovery and data mining","DOI":"10.1007\/978-3-540-68125-0_84"},{"issue":"3\u20134","key":"528_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recognit Lett 19(3\u20134):255\u2013259","journal-title":"Pattern Recognit Lett"},{"key":"528_CR7","doi-asserted-by":"crossref","unstructured":"Calders T, Ramon J, Van Dyck D (2011) All normalized anti-monotonic overlap graph measures are bounded. Data Min Knowl Discov. doi: 10.1007\/s10618-011-0217-y (online first)","DOI":"10.1007\/s10618-011-0217-y"},{"issue":"2","key":"528_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/sam.10004","volume":"1","author":"V Chaoji","year":"2008","unstructured":"Chaoji V, Al Hasan M, Salem S, Besson J, Zaki MJ (2008) ORIGAMI: a novel and effective approach for mining representative orthogonal graph patterns. Stat Anal Data Min 1(2):67\u201384","journal-title":"Stat Anal Data Min"},{"issue":"3","key":"528_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10618-008-0098-x","volume":"17","author":"V Chaoji","year":"2008","unstructured":"Chaoji V, Al Hasan M, Salem S, Zaki MJ (2008) An integrated, generic approach to pattern mining: data mining template library. Data Min Knowl Discov 17(3):457\u2013495","journal-title":"Data Min Knowl Discov"},{"key":"528_CR10","doi-asserted-by":"crossref","unstructured":"Chen C, Lin CX, Yan X, Han J (2008) On effective presentation of graph patterns: a structural representative approach. In: Proceeding of the 17th ACM conference on information and knowledge management, ACM, pp 299\u2013308","DOI":"10.1145\/1458082.1458124"},{"key":"528_CR11","doi-asserted-by":"crossref","unstructured":"Chen C, Yan X, Zhu F, Han J (2007) Gapprox: mining frequent approximate patterns from a massive network. In: Proceedings of the 2007 seventh IEEE international conference on data mining, ICDM \u201907, pp 445\u2013450","DOI":"10.1109\/ICDM.2007.36"},{"issue":"3","key":"528_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvtal","year":"1979","unstructured":"Chvtal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233\u2013235","journal-title":"Math Oper Res"},{"issue":"10","key":"528_CR13","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"528_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspaces of graphs","author":"DM Cvetkovic","year":"1997","unstructured":"Cvetkovic DM, Rowlinson P, Simic S, Biggs N (1997) Eigenspaces of graphs. Cambridge University Press, Cambridge"},{"key":"528_CR15","doi-asserted-by":"crossref","unstructured":"Dinitz Y (2006) Dinitzalgorithm: the original version and evens version. Theor Comput Sci :218\u2013240","DOI":"10.1007\/11685654_10"},{"key":"528_CR16","unstructured":"Fiedler M, Borgelt C (2007) Support computation for mining frequent subgraphs in a single graph. In: 5th international workshop on mining and learning with graphs"},{"issue":"3","key":"528_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1142\/S0218001404003216","volume":"18","author":"D Hidovic","year":"2004","unstructured":"Hidovic D, Pelillo M (2004) Metrics for attributed graphs based on the maximal similarity common subgraph. Int J Pattern Recog Arti Intell 18(3):299\u2013313","journal-title":"Int J Pattern Recog Arti Intell"},{"key":"528_CR18","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: ICDM Proceedings, IEEE","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"3","key":"528_CR19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: mining graph data. Mach Learn 50(3):321\u2013354","journal-title":"Mach Learn"},{"key":"528_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A Itai","year":"1982","unstructured":"Itai A, Perl Y, Shiloach Y (1982) The complexity of finding maximum disjoint paths with length constraints. Networks 12:277\u2013286","journal-title":"Networks"},{"key":"528_CR21","doi-asserted-by":"crossref","unstructured":"Kannan R, Vempala S, Veta A (2000) On clusterings-good, bad and spectral. In: Proceedings of the 41st annual symposium on foundations of computer science, FOCS \u201900, p 367","DOI":"10.1109\/SFCS.2000.892125"},{"key":"528_CR22","volume-title":"Kernel methods in computational biology","author":"R Kondor","year":"2004","unstructured":"Kondor R, Vert J-P (2004) Diffusion kernels. In: Scholkopf B, Tsuda K, Vert J-P (eds) Kernel methods in computational biology. The MIT Press, Cambridge"},{"key":"528_CR23","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: 1st IEEE international conference on data mining","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"528_CR24","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph. Data Min Knowl Disc 11(3):243\u2013271","journal-title":"Data Min Knowl Disc"},{"key":"528_CR25","doi-asserted-by":"crossref","unstructured":"Li S, Zhang S, Yang J (2010) Dessin: mining dense subgraph patterns in a single graph. Sci Stat Database Manag 178\u2013195","DOI":"10.1007\/978-3-642-13818-8_15"},{"key":"528_CR26","doi-asserted-by":"crossref","unstructured":"Li J, Liu Y, Gao H (2011) Summarizing graph patterns. IEEE Trans Knowl Data Eng. (99): 1. doi: 10.1109\/TKDE.2010.48 (online early access)","DOI":"10.1109\/TKDE.2010.48"},{"key":"528_CR27","doi-asserted-by":"crossref","unstructured":"Melnik S, Garcia-Molina H, Rahm E (2002) Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: Proceedings of the 18th international conference on data engineering, ICDE \u201902, p 117","DOI":"10.1109\/ICDE.2002.994702"},{"key":"528_CR28","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Riesen K, Bunke H (2006) Fast suboptimal algorithms for the computation of graph edit distance. Struct Syntactic Stat Pattern Recogn 163\u2013172","DOI":"10.1007\/11815921_17"},{"issue":"1","key":"528_CR29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Comput Sci Rev"},{"issue":"8","key":"528_CR30","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"528_CR31","doi-asserted-by":"crossref","unstructured":"Van Dongen S (2004) Graph clustering via a discrete uncoupling process. SIAM J Matrix Anal Appl 30(1):121\u2013141","DOI":"10.1137\/040608635"},{"issue":"2","key":"528_CR32","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N Vanetik","year":"2006","unstructured":"Vanetik N, Shimony SE, Gudes E (2006) Support measures for graph data. Data Min Knowl Discov 13(2):243\u2013260","journal-title":"Data Min Knowl Discov"},{"key":"528_CR33","unstructured":"Yan X, Han J (2002) Gspan: graph-based substructure pattern mining. In: IEEE international conference on data mining"},{"key":"528_CR34","doi-asserted-by":"crossref","unstructured":"Zhang S, Yang J, Li S (2009) Ring: an integrated method for frequent representative subgraph mining. In: 2009 ninth IEEE international conference on data mining, IEEE, pp 1082\u20131087","DOI":"10.1109\/ICDM.2009.96"},{"issue":"1","key":"528_CR35","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. Proc VLDB Endow 2(1):718\u2013729","journal-title":"Proc VLDB Endow"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0528-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0528-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0528-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:27Z","timestamp":1559124627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0528-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,10]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["528"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0528-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,10]]}}}