{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:08:31Z","timestamp":1725556111671},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136719"},{"type":"electronic","value":"9783642136726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_17","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"168-177","source":"Crossref","is-referenced-by-count":5,"title":["Fast Discovery of Reliable k-terminal Subgraphs"],"prefix":"10.1007","author":[{"given":"Melissa","family":"Kasari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannu","family":"Toivonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Hintsanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P. Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS (LNBI), vol.\u00a04075, pp. 35\u201349. Springer, Heidelberg (2006)"},{"key":"17_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-74976-9_48","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"P. Hintsanen","year":"2007","unstructured":"Hintsanen, P.: The most reliable subgraph problem. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol.\u00a04702, pp. 471\u2013478. Springer, Heidelberg (2007)"},{"key":"17_CR3","unstructured":"Hintsanen, P., Toivonen, H., Sevon, P.: Link discovery by reliable subgraphs (submitted 2010)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P. Hintsanen","year":"2008","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery\u00a017, 3\u201323 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR5","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1109\/TR.2007.895303","volume":"56","author":"D.P. Kroese","year":"2007","unstructured":"Kroese, D.P., Hui, K.P., Nariai, S.: Network reliability optimization via the cross-entropy method. IEEE Transactions on Reliability\u00a056, 275\u2013287 (2007)","journal-title":"IEEE Transactions on Reliability"},{"key":"17_CR8","unstructured":"Raedt, L.D., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic prolog and its application in link discovery. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp. 2468\u20132473 (2007)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10994-007-5030-x","volume":"70","author":"L.D. Raedt","year":"2008","unstructured":"Raedt, L.D., Kersting, K., Kimmig, A., Revoredo, K., Toivonen, H.: Compressing probabilistic Prolog programs. Machine Learning\u00a070, 151\u2013168 (2008)","journal-title":"Machine Learning"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 118\u2013127 (2004)","DOI":"10.1145\/1014052.1014068"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 404\u2013413 (2006)","DOI":"10.1145\/1150402.1150448"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity graphs in networks. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 245\u2013255 (2006)","DOI":"10.1145\/1150402.1150432"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:10:19Z","timestamp":1619784619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}