{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:20:55Z","timestamp":1725553255157},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540344780"},{"type":"electronic","value":"9783540344797"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11760146_18","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T15:29:38Z","timestamp":1147188578000},"page":"201-212","source":"Crossref","is-referenced-by-count":9,"title":["Finding Hidden Group Structure in a Stream of Communications"],"prefix":"10.1007","author":[{"given":"J.","family":"Baumes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Hayvanovych","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Magdon-Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Theories of Communication Networks","author":"P. Monge","year":"2002","unstructured":"Monge, P., Contractor, N.: Theories of Communication Networks. Oxford University Press, Oxford (2002)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-540-25952-7_28","volume-title":"Intelligence and Security Informatics","author":"J. Baumes","year":"2004","unstructured":"Baumes, J., Goldberg, M., Magdon-Ismail, M., Wallace, W.A.: Discovering hidden groups in communication networks. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds.) ISI 2004. LNCS, vol.\u00a03073, pp. 378\u2013389. Springer, Heidelberg (2004)"},{"key":"18_CR3","unstructured":"Baumes, J., Goldberg, M., Magdon-Ismail, M., Wallace, W.: On hidden groups in communication networks. Technical report, TR 05-15, CS Dept., RPI (2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Capocci, A., Servedio, V.D.P., Caldarelli, G., Colaiori, F.: Detecting communities in large networks. In: Workshop on Algorithms and Models for the Web-Graph (WAW), pp. 181\u2013188 (2004)","DOI":"10.1007\/978-3-540-30216-2_15"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. In: Proc. Natl. Acad. Sci., vol.\u00a099, pp. 7821\u20137826 (2002)","DOI":"10.1073\/pnas.122653799"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44853-5_10","volume-title":"Intelligence and Security Informatics","author":"M. Magdon-Ismail","year":"2003","unstructured":"Magdon-Ismail, M., Goldberg, M., Wallace, W.A., Siebecker, D.: Locating hidden groups in communication networks using hidden markov models. In: Chen, H., Miranda, R., Zeng, D.D., Demchak, C.C., Schroeder, J., Madhusudan, T. (eds.) ISI 2003. LNCS, vol.\u00a02665, pp. 126\u2013137. Springer, Heidelberg (2003)"},{"key":"18_CR8","unstructured":"Baumes, J., Goldberg, M., Krishnamoorthy, M., Magdon-Ismail, M., Preston, N.: Finding comminities by clustering a graph into overlapping subgraphs. In: Proceedings of IADIS Applied Computing, pp. 97\u2013104 (2005)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11427995_3","volume-title":"Intelligence and Security Informatics","author":"J. Baumes","year":"2005","unstructured":"Baumes, J., Goldberg, M., Magdon-Ismail, M.: Efficient identification of overlapping communities. In: Kantor, P., Muresan, G., Roberts, F., Zeng, D.D., Wang, F.-Y., Chen, H., Merkle, R.C. (eds.) ISI 2005. LNCS, vol.\u00a03495, pp. 27\u201336. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11760146_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:08:04Z","timestamp":1619507284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11760146_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540344780","9783540344797"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11760146_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}