{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:43:58Z","timestamp":1730198638135,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T00:00:00Z","timestamp":1668038400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T00:00:00Z","timestamp":1668038400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,10]]},"DOI":"10.1109\/asonam55673.2022.10068598","type":"proceedings-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T17:38:09Z","timestamp":1679593089000},"page":"117-124","source":"Crossref","is-referenced-by-count":0,"title":["Multi-relational Affinity Propagation"],"prefix":"10.1109","author":[{"given":"Hossam","family":"Sharara","sequence":"first","affiliation":[{"name":"The American University in Cairo,Computer Science and Engineering Department,Cairo,Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lise","family":"Getoor","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz,Computer Science Department,Santa Cruz,CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"49","article-title":"Analyzing clique overlap connections","volume":"21","author":"Everett","year":"1998","journal-title":"Connections"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"journal-title":"AAAI,2006","article-title":"Learning systems of concepts with an infinite relational model","author":"Kemp","key":"ref5"},{"key":"ref6","article-title":"Infinite hidden relational models","author":"Xu","year":"2006","journal-title":"UAI"},{"key":"ref7","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"JMLR"},{"key":"ref8","article-title":"Probabilistic classification and clustering in relational data","author":"Taskar","year":"2001","journal-title":"IJCAI"},{"article-title":"Clustering relational data using attribute and link information","volume-title":"Text Mining and Link Analysis Workshop","author":"Neville","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102357"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143918"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.14"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0027330"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/wise.2002.1181653"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281244"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_30"},{"key":"ref18","article-title":"Modelling relational data using Bayesian clustered tensor factorization","author":"Sutskever","year":"2009","journal-title":"NIPS"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935905"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273551"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00644-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2009.05-08-785"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7566-5"},{"issue":"2","key":"ref24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A clustering separation measure","volume":"1","author":"Davies","year":"1979","journal-title":"IEEE PAMI Trans."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"ref26","article-title":"Cluster ensembles - a knowledge reuse framework for combining partitionings","author":"Strehl","year":"2002","journal-title":"AAAI"}],"event":{"name":"2022 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","start":{"date-parts":[[2022,11,10]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2022,11,13]]}},"container-title":["2022 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10068562\/10068565\/10068598.pdf?arnumber=10068598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T05:06:38Z","timestamp":1709442398000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10068598\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/asonam55673.2022.10068598","relation":{},"subject":[],"published":{"date-parts":[[2022,11,10]]}}}