{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:36:24Z","timestamp":1725507384533},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540731320"},{"type":"electronic","value":"9783540731337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73133-7_16","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T11:06:50Z","timestamp":1207912010000},"page":"182-185","source":"Crossref","is-referenced-by-count":1,"title":["Learning Approximate MRFs from Large Transactional Data"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Wang, C., Parthasarathy, S.: Learning approximate MRFs from large transactional data. Technical Report: OSU-CISRC-5\/06\u2013TR59, The Ohio State University (2006)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1117454.1117460","volume":"7","author":"M.J. Rattigan","year":"2005","unstructured":"Rattigan, M.J., Jensen, D.: The case for anomalous link discovery. ACM SIGKDD Explorations Newsletter\u00a07, 41\u201347 (2005)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1109\/TKDE.2003.1245281","volume":"15","author":"D. Pavlov","year":"2003","unstructured":"Pavlov, D., Mannila, H., Smyth, P.: Beyond independence: probabilistic models for query approximation on binary transaction data. IEEE Transactions on Knowledge and Data Engineering\u00a015, 1409\u20131421 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Goldenberg, A., Moore, A.: Tractable learning of large Bayes net structures from sparse data. In: Proceedings of the twenty-first international conference on Machine learning (2004)","DOI":"10.1145\/1015330.1015406"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput.\u00a048, 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Statistical Network Analysis: Models, Issues, and New Directions"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73133-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:03:32Z","timestamp":1619503412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73133-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540731320","9783540731337"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73133-7_16","relation":{},"subject":[]}}