{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:13Z","timestamp":1750221073445,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,19]],"date-time":"2018-11-19T00:00:00Z","timestamp":1542585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11,19]]},"DOI":"10.1145\/3282373.3282377","type":"proceedings-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T16:37:20Z","timestamp":1547743040000},"page":"156-163","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["C-AP"],"prefix":"10.1145","author":[{"given":"Tomohiro","family":"Matsushita","sequence":"first","affiliation":[{"name":"Graduate School of SIE, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Shiokawa","sequence":"additional","affiliation":[{"name":"Center for Computational Sciences, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[{"name":"Center for Computational Sciences, University of Tsukuba"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,11,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_2_1","volume-title":"Frey and Delbert Dueck","author":"Brendan","year":"2007","unstructured":"Brendan J. Frey and Delbert Dueck . 2007 . Clustering by Passing Messages Between Data Points. Science 315, 5814 (2007), 972--976. Brendan J. Frey and Delbert Dueck. 2007. Clustering by Passing Messages Between Data Points. Science 315, 5814 (2007), 972--976."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence. 1561--1567","author":"Fujiwara Yasuhiro","year":"2016","unstructured":"Yasuhiro Fujiwara , Yasutoshi Ida , Hiroaki Shiokawa and Sotetsu Iwamura . 2016 . Fast Lasso Algorithm via Selective Coordinate Descent . In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 1561--1567 . Yasuhiro Fujiwara, Yasutoshi Ida, Hiroaki Shiokawa and Sotetsu Iwamura. 2016. Fast Lasso Algorithm via Selective Coordinate Descent. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 1561--1567."},{"key":"e_1_3_2_1_4_1","first-page":"2238","article-title":"Fast Algorithm for Affinity Propagation","volume":"22","author":"Fujiwara Yasuhiro","year":"2011","unstructured":"Yasuhiro Fujiwara , Go Irie , and Tomoe Kitahara . 2011 . Fast Algorithm for Affinity Propagation . In Proc. IJCAI , Vol. 22. 2238 -- 2243 . Yasuhiro Fujiwara, Go Irie, and Tomoe Kitahara. 2011. Fast Algorithm for Affinity Propagation. In Proc. IJCAI, Vol. 22. 2238--2243.","journal-title":"Proc. IJCAI"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783280"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Li Gang Guo Lei and Liu Tianming. 2009. Grouping of Brain MR Images via Affinity Propagation. (2009) 2425--2428.  Li Gang Guo Lei and Liu Tianming. 2009. Grouping of Brain MR Images via Affinity Propagation. (2009) 2425--2428.","DOI":"10.1109\/ISCAS.2009.5118290"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.144"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459448"},{"key":"e_1_3_2_1_10_1","volume-title":"Rousseeuw","author":"Kaufman Leonard","year":"1987","unstructured":"Leonard Kaufman and Peter J . Rousseeuw . 1987 . Clustering by Means of Medoids ., 405--416 pages. Leonard Kaufman and Peter J. Rousseeuw. 1987. Clustering by Means of Medoids., 405--416 pages."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Partitioning Around Medoids (Program PAM). Finding groups in data: an introduction to cluster analysis","author":"Kaufman Leonard","year":"1990","unstructured":"Leonard Kaufman and Peter J Rousseeuw . 1990. Partitioning Around Medoids (Program PAM). Finding groups in data: an introduction to cluster analysis ( 1990 ), 68--125. Leonard Kaufman and Peter J Rousseeuw. 1990. Partitioning Around Medoids (Program PAM). Finding groups in data: an introduction to cluster analysis (1990), 68--125."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability","volume":"1","author":"MacQueen J. B.","year":"1967","unstructured":"J. B. MacQueen . 1967 . Some Methods for Classification and Analysis of MultiVariate Observations . In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability , Vol. 1 . University of California Press, 281--297. J. B. MacQueen. 1967. Some Methods for Classification and Analysis of MultiVariate Observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1. University of California Press, 281--297."},{"volume-title":"Introduction to Information Retrieval","author":"Manning Christopher D.","key":"e_1_3_2_1_15_1","unstructured":"Christopher D. Manning , Prabhakar Raghavan , and Hinrich Sch\u00fctze . 2008. Introduction to Information Retrieval . Cambridge University Press , New York, NY, USA . Christopher D. Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cvi.2009.0034"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186950"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 27th AAAI Conference on Artificial Intelligence. 1170--1176","author":"Shiokawa Hiroaki","year":"2013","unstructured":"Hiroaki Shiokawa , Yasuhiro Fujiwara , and Makoto Onizuka . 2013 . Fast Algorithm for Modularity-based Graph Clustering . In Proceedings of the 27th AAAI Conference on Artificial Intelligence. 1170--1176 . Hiroaki Shiokawa, Yasuhiro Fujiwara, and Makoto Onizuka. 2013. Fast Algorithm for Modularity-based Graph Clustering. In Proceedings of the 27th AAAI Conference on Artificial Intelligence. 1170--1176."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809980"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98809-2_2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068943.3068949"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062762"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. AAAI. 1486--1491","author":"Zhou Tom Chao","year":"2010","unstructured":"Tom Chao Zhou , Hao Ma , Michael R. Lyu , and Irwin King . 2010 . UserRec: A User Recommendation Framework in Social Tagging Systems . In Proc. AAAI. 1486--1491 . Tom Chao Zhou, Hao Ma, Michael R. Lyu, and Irwin King. 2010. UserRec: A User Recommendation Framework in Social Tagging Systems. In Proc. AAAI. 1486--1491."}],"event":{"name":"iiWAS2018: 20th International Conference on Information Integration and Web-based Applications & Services","sponsor":["Johannes Kepler University, Linz, Austria","@WAS International Organization of Information Integration and Web-based Applications and Services","Johannes Kepler University"],"location":"Yogyakarta Indonesia","acronym":"iiWAS2018"},"container-title":["Proceedings of the 20th International Conference on Information Integration and Web-based Applications & Services"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3282373.3282377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3282373.3282377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:28Z","timestamp":1750208248000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3282373.3282377"}},"subtitle":["Cell-based Algorithm for Efficient Affinity Propagation"],"short-title":[],"issued":{"date-parts":[[2018,11,19]]},"references-count":22,"alternative-id":["10.1145\/3282373.3282377","10.1145\/3282373"],"URL":"https:\/\/doi.org\/10.1145\/3282373.3282377","relation":{},"subject":[],"published":{"date-parts":[[2018,11,19]]},"assertion":[{"value":"2018-11-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}