{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:54Z","timestamp":1759205334728,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T00:00:00Z","timestamp":1297123200000},"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":[[2011,2,8]]},"DOI":"10.1145\/1940761.1940913","type":"proceedings-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T18:31:03Z","timestamp":1297794663000},"page":"804-805","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Sentiment community detection in social networks"],"prefix":"10.1145","author":[{"given":"Kaiquan","family":"Xu","sequence":"first","affiliation":[{"name":"City University of Hong Kong, Hong Kong"}]},{"given":"Jiexun","family":"Li","sequence":"additional","affiliation":[{"name":"Drexel University, Philadelphia, PA"}]},{"given":"Stephen Shaoyi","family":"Liao","sequence":"additional","affiliation":[{"name":"City University of Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2011,2,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000011"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361685"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Swamy S.","year":"2004","unstructured":"Swamy , S. 2004 . Correlation Clustering: maximizing agreements via semidefinite programming . In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms , New Orleans, Louisiana. Swamy, S. 2004. Correlation Clustering: maximizing agreements via semidefinite programming. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, New Orleans, Louisiana."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775227"}],"event":{"name":"iConference '11: iConference 2011","acronym":"iConference '11","location":"Seattle Washington USA"},"container-title":["Proceedings of the 2011 iConference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940761.1940913","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1940761.1940913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:43Z","timestamp":1750244383000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1940761.1940913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,8]]},"references-count":5,"alternative-id":["10.1145\/1940761.1940913","10.1145\/1940761"],"URL":"https:\/\/doi.org\/10.1145\/1940761.1940913","relation":{},"subject":[],"published":{"date-parts":[[2011,2,8]]},"assertion":[{"value":"2011-02-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}