{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:33:00Z","timestamp":1743006780001,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819754946"},{"type":"electronic","value":"9789819754953"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-5495-3_21","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:02:27Z","timestamp":1721901747000},"page":"280-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uncertain k-Center Clustering, Revisited: Point Assignment"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3626-8960","authenticated-orcid":false,"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7702-3094","authenticated-orcid":false,"given":"Emran","family":"Shahbazi Gholiabad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1099-0499","authenticated-orcid":false,"given":"Mohammad","family":"Amin Raeisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2008). https:\/\/doi.org\/10.1145\/1376916.1376944","DOI":"10.1145\/1376916.1376944"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-31750-2_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Gao, L., Yu, H.: Constraint based subspace clustering for high dimensional uncertain data. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9652, pp. 271\u2013282. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31750-2_22"},{"key":"21_CR3","series-title":"Interdisciplinary Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54339-0","volume-title":"Uncertainty Quantification","author":"C Soize","year":"2017","unstructured":"Soize, C.: Uncertainty Quantification. IAM, vol. 47. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54339-0"},{"key":"21_CR4","unstructured":"Duchi, J.: Optimization with uncertain data, Notes for EE364b, Technical report (2018)"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182\u2013196 (1984). https:\/\/doi.org\/10.1137\/0213014","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the euclidean one-centre problem. SIAM J. Comput. 15(3), 725\u2013738 (1986). https:\/\/doi.org\/10.1137\/0215052","journal-title":"SIAM J. Comput."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R3 and related problems. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982) (1982). https:\/\/doi.org\/10.1109\/sfcs.1982.24","DOI":"10.1109\/SFCS.1982.24"},{"issue":"1\u20133","key":"21_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01585739","volume":"46","author":"R Chandrasekaran","year":"1990","unstructured":"Chandrasekaran, R., Tamir, A.: Algebraic optimization: the Fermat-Weber location problem. Math. Program. 46(1\u20133), 219\u2013224 (1990). https:\/\/doi.org\/10.1007\/BF01585739","journal-title":"Math. Program."},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N Megiddo","year":"1981","unstructured":"Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An $$O(n\\log ^2 n)$$ Algorithm for the kth longest path in a tree with applications to location problems. SIAM J. Comput. 10(2), 328\u2013337 (1981). https:\/\/doi.org\/10.1137\/0210023","journal-title":"SIAM J. Comput."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90224-5","journal-title":"Theor. Comput. Sci."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing - STOC \u201988, pp. 434\u2013444 (1988). https:\/\/doi.org\/10.1145\/62212.62255","DOI":"10.1145\/62212.62255"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica 33(2), 201\u2013226 (2002). https:\/\/doi.org\/10.1007\/s00453-001-0110-y","journal-title":"Algorithmica"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Pfeifle, M.: Density-based clustering of uncertain data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (2005). https:\/\/doi.org\/10.1145\/1081870.1081955","DOI":"10.1145\/1081870.1081955"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Kriegel, H., Pfeifle, M.: Hierarchical density-based clustering of uncertain data. In: Fifth IEEE International Conference on Data Mining (ICDM\u201905) (2005). https:\/\/doi.org\/10.1109\/icdm.2005.75","DOI":"10.1145\/1081870.1081955"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Xu, H., Li, G.: Density-based probabilistic clustering of uncertain data. In: 2008 International Conference on Computer Science and Software Engineering (2008). https:\/\/doi.org\/10.1109\/csse.2008.968","DOI":"10.1109\/CSSE.2008.968"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Ram, A., et al.: A density based algorithm for discovering density varied clusters in large spatial databases. In: Int. J. Comput. Appl. 3(6), 1\u20134 (2010). https:\/\/doi.org\/10.5120\/739-1038","DOI":"10.5120\/739-1038"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. In: IEEE Trans. Knowl. Data Eng. 21(5), 609\u201323 (2009). https:\/\/doi.org\/10.1109\/tkde.2008.190","DOI":"10.1109\/TKDE.2008.190"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Guha, S., Munagala, K.: Exceeding expectations and clustering uncertain data. In: Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2009). https:\/\/doi.org\/10.1145\/1559795.1559836","DOI":"10.1145\/1559795.1559836"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Munteanu, A., et al.: Smallest enclosing ball for probabilistic data. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry (2014). https:\/\/doi.org\/10.1145\/2582112.2582114","DOI":"10.1145\/2582112.2582114"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhang, J.: One-dimensional k-center on uncertain data. Theor. Comput. Sci. 602, 114\u201324 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.08.017","DOI":"10.1016\/j.tcs.2015.08.017"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Williams, R.: Faster online matrix-vector multiplication. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (2017). https:\/\/doi.org\/10.1137\/1.9781611974782","DOI":"10.1137\/1.9781611974782.142"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Alipour, S., Jafari, A.: Improvements on the k-center problem for uncertain data. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (2018). https:\/\/doi.org\/10.1145\/3196959.3196969","DOI":"10.1145\/3196959.3196969"},{"issue":"10","key":"21_CR23","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1007\/s10115-021-01601-4","volume":"63","author":"S Alipour","year":"2021","unstructured":"Alipour, S.: Improvements on approximation algorithms for clustering probabilistic data. Knowl. Inform. Syst. 63(10), 2719\u20132740 (2021). https:\/\/doi.org\/10.1007\/s10115-021-01601-4","journal-title":"Knowl. Inform. Syst."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5495-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:08:28Z","timestamp":1721902108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5495-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819754946","9789819754953"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5495-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai-edge.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}