{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:46:49Z","timestamp":1726066009812},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811527661"},{"type":"electronic","value":"9789811527678"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-2767-8_25","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:02:35Z","timestamp":1579964555000},"page":"275-286","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Constrained Clustering with Side Information"],"prefix":"10.1007","author":[{"given":"Zhendong","family":"Hao","sequence":"first","affiliation":[]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Pei","family":"Yao","sequence":"additional","affiliation":[]},{"given":"Peihuang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Huihong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,26]]},"reference":[{"key":"25_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"issue":"7","key":"25_CR2","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., Vassilvitskii, S.: Scalable k-means++. Proc. VLDB Endow. 5(7), 622\u2013633 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"25_CR3","doi-asserted-by":"publisher","first-page":"4381","DOI":"10.1109\/TIP.2015.2463223","volume":"24","author":"X Cao","year":"2015","unstructured":"Cao, X., Zhang, C., Zhou, C., Huazhu, F., Foroosh, H.: Constrained multi-view video face clustering. IEEE Trans. Image Process. 24(11), 4381\u20134393 (2015)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s12524-016-0621-2","volume":"45","author":"A Chehreghan","year":"2017","unstructured":"Chehreghan, A., Abbaspour, R.A.: An improvement on the clustering of high-resolution satellite images using a hybrid algorithm. J. Indian Soc. Remote Sens. 45(4), 579\u2013590 (2017)","journal-title":"J. Indian Soc. Remote Sens."},{"key":"25_CR5","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier (2011)"},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10044-017-0673-0","volume":"22","author":"R Jothi","year":"2019","unstructured":"Jothi, R., Mohanty, S.K., Ojha, A.: Dk-means: a deterministic k-means clustering algorithm for gene expression analysis. Pattern Anal. Appl. 22(2), 649\u2013667 (2019)","journal-title":"Pattern Anal. Appl."},{"issue":"10","key":"25_CR7","first-page":"147","volume":"44","author":"Y Lai","year":"2008","unstructured":"Lai, Y., Liu, J.: Optimization study on initial center of k-means algorithm. Comput. Eng. Appl. 44(10), 147\u2013149 (2008)","journal-title":"Comput. Eng. Appl."},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TKDE.2018.2843342","volume":"31","author":"H Liu","year":"2018","unstructured":"Liu, H., Shao, M., Ding, Z., Yun, F.: Structure-preserved unsupervised domain adaptation. IEEE Trans. Knowl. Data Eng. 31(4), 799\u2013812 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR9","unstructured":"MacQueen, J. et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281\u2013297 (1967)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Marroquin, J.L., Girosi, F.: Some extensions of the k-means algorithm for image segmentation and pattern classification. Technical report, MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB (1993)","DOI":"10.21236\/ADA271691"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10559-019-00124-9","volume":"55","author":"SV Mashtalir","year":"2019","unstructured":"Mashtalir, S.V., Stolbovyi, M.I., Yakovlev, S.V.: Clustering video sequences by the method of harmonic k-means. Cybern. Syst. Anal. 55(2), 200\u2013206 (2019)","journal-title":"Cybern. Syst. Anal."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00180-018-0821-z","volume":"34","author":"V Melnykov","year":"2019","unstructured":"Melnykov, V., Zhu, X.: An extension of the k-means algorithm to clustering skewed data. Comput. Stat. 34(1), 373\u2013394 (2019)","journal-title":"Comput. Stat."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/2956185","volume":"49","author":"J Tang","year":"2016","unstructured":"Tang, J., Chang, Y., Aggarwal, C., Liu, H.: A survey of signed network mining in social media. ACM Comput. Surv. (CSUR) 49(3), 42 (2016)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"25_CR14","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: AAAI\/IAAI, vol. 1097, pp. 577\u2013584 (2000)"},{"key":"25_CR15","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S., et al.: Constrained k-means clustering with background knowledge. In: Icml, vol. 1, pp. 577\u2013584 (2001)"},{"issue":"7","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1109\/LCOMM.2019.2915304","volume":"23","author":"L Zhang","year":"2019","unstructured":"Zhang, L., Jin, M.: A constrained clustering-based blind detector for spatial modulation. IEEE Commun. Lett. 23(7), 1170\u20131173 (2019)","journal-title":"IEEE Commun. Lett."}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2767-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T15:06:59Z","timestamp":1579964819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2767-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811527661","9789811527678"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2767-8_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sdcs.sysu.edu.cn\/paap2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}