{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:38:09Z","timestamp":1743086289247,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_21","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T13:44:30Z","timestamp":1294235070000},"page":"239-250","source":"Crossref","is-referenced-by-count":2,"title":["Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres"],"prefix":"10.1007","author":[{"given":"Maitreya","family":"Natu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaishali","family":"Sadaphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangameshwar","family":"Patil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Zuefle, A.: Probabilistic frequent itemset mining in uncertain databases. In: KDD (2009)","key":"21_CR1","DOI":"10.1145\/1557019.1557039"},{"key":"21_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"445","volume-title":"Advances in Data Mining. Theoretical Aspects and Applications","author":"C. Chen","year":"2007","unstructured":"Chen, C., Yanz, X., Zhuy, F., Hany, J.: gapprox: Mining frequent approximate patterns from a massive network. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol.\u00a04597, pp. 445\u2013450. Springer, Heidelberg (2007)"},{"unstructured":"Christos Faloutsos and Jimeng Sun. Incremental pattern discovery on streams, graphs and tensors. Technical report at CMU (2007)","key":"21_CR3"},{"key":"21_CR4","volume-title":"AAAI Workshop on KDD","author":"H. Mannila","year":"1994","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.: Efficient algorithms for discovering association rules. In: AAAI Workshop on KDD (1994)"},{"unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs. In: Mining Graph Data, Machine Learning (2003)","key":"21_CR5"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Transactions on Knowledge and Data Engineering (2004)","key":"21_CR6","DOI":"10.21236\/ADA439484"},{"key":"21_CR7","first-page":"137","volume-title":"Studies in Computational Intelligence","author":"G. Valiente","year":"2007","unstructured":"Valiente, G.: Efficient Algorithms on Trees and Graphs with Unique Node Labels. In: Studies in Computational Intelligence, vol.\u00a052, pp. 137\u2013149. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:38:01Z","timestamp":1558294681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}