{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:28:58Z","timestamp":1743125338599,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389604"},{"type":"electronic","value":"9783030389611"}],"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-3-030-38961-1_19","type":"book-chapter","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T01:34:32Z","timestamp":1579656872000},"page":"215-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Clustering for Outlier Identification in High-Dimensional Data"],"prefix":"10.1007","author":[{"given":"Srikanth","family":"Thudumu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Branch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jugdutt Jack","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00778-004-0125-5","volume":"14","author":"CC Aggarwal","year":"2005","unstructured":"Aggarwal, C.C., Philip, S.Y.: An effective and efficient algorithm for high-dimensional outlier detection. VLDB J. 14(2), 211\u2013221 (2005)","journal-title":"VLDB J."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications, vol. 27. ACM (1998)","DOI":"10.1145\/276305.276314"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1175\/JCLI-D-17-0197.1","volume":"31","author":"B Christiansen","year":"2018","unstructured":"Christiansen, B.: Ensemble averaging and the curse of dimensionality. J. Clim. 31(4), 1587\u20131596 (2018)","journal-title":"J. Clim."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2790\u20132797. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206547"},{"issue":"11","key":"19_CR5","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ert\u00f6z, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proceedings of the 2003 SIAM International Conference on Data Mining, pp. 47\u201358. SIAM (2003)","DOI":"10.1137\/1.9781611972733.5"},{"issue":"11","key":"19_CR7","doi-asserted-by":"publisher","first-page":"3703","DOI":"10.1016\/j.patcog.2015.05.016","volume":"48","author":"G Gan","year":"2015","unstructured":"Gan, G., Ng, M.K.P.: Subspace clustering with automatic feature grouping. Pattern Recogn. 48(11), 3703\u20133713 (2015)","journal-title":"Pattern Recogn."},{"key":"19_CR8","unstructured":"Gartner, I.: Big data definition. https:\/\/www.gartner.com\/it-glossary\/big-data\/. Accessed 6 Sept 2019"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2007.1048","volume":"8","author":"L Jing","year":"2007","unstructured":"Jing, L., Ng, M.K., Huang, J.Z.: An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans. Knowl. Data Eng. 8, 1026\u20131041 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/11430919_94","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"L Jing","year":"2005","unstructured":"Jing, L., Ng, M.K., Xu, J., Huang, J.Z.: Subspace clustering of text documents with feature weighting K-means algorithm. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 802\u2013812. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11430919_94"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/(SICI)1097-0266(199606)17:6<441::AID-SMJ819>3.0.CO;2-G","volume":"17","author":"DJ Ketchen","year":"1996","unstructured":"Ketchen, D.J., Shook, C.L.: The application of cluster analysis in strategic management research: an analysis and critique. Strateg. Manag. J. 17(6), 441\u2013458 (1996)","journal-title":"Strateg. Manag. J."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Li, T., Ma, S., Ogihara, M.: Document clustering via adaptive subspace iteration. In: Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 218\u2013225. ACM (2004)","DOI":"10.1145\/1008992.1009031"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2012","unstructured":"Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., Ma, Y.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171\u2013184 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR14","unstructured":"Mucha, H.J., Sofyan, H.: Nonhierarchical clustering (2011)"},{"issue":"12","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1976","DOI":"10.14778\/2824032.2824115","volume":"8","author":"E Schubert","year":"2015","unstructured":"Schubert, E., Koos, A., Emrich, T., Z\u00fcfle, A., Schmid, K.A., Zimek, A.: A framework for clustering uncertain data. Proc. VLDB Endow. 8(12), 1976\u20131979 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Thudumu, S., Branch, P., Jin, J., Singh, J.J.: Elicitation of candidate subspaces in high-dimensional data. In: 2019 IEEE 21st International Conference on High Performance Computing and Communications. IEEE (2019, in press)","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2019.00275"},{"issue":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/TKDE.2013.25","volume":"26","author":"N Tomasev","year":"2014","unstructured":"Tomasev, N., Radovanovic, M., Mladenic, D., Ivanovic, M.: The role of hubness in clustering high-dimensional data. IEEE Trans. Knowl. Data Eng. 26(3), 739\u2013751 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-09259-1_11","volume-title":"Partitional Clustering Algorithms","author":"N Toma\u0161ev","year":"2015","unstructured":"Toma\u0161ev, N., Radovanovi\u0107, M., Mladeni\u0107, D., Ivanovi\u0107, M.: Hubness-based clustering of high-dimensional data. In: Celebi, M.E. (ed.) Partitional Clustering Algorithms, pp. 353\u2013386. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-09259-1_11"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Zhai, Y., Ong, Y.S., Tsang, I.W.: The emerging \u201cbig dimensionality\u201d (2014)","DOI":"10.1109\/MCI.2014.2326099"},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/sam.11161","volume":"5","author":"A Zimek","year":"2012","unstructured":"Zimek, A., Schubert, E., Kriegel, H.P.: A survey on unsupervised outlier detection in high-dimensional numerical data. Stat. Anal. Data Min.: ASA Data Sci. J. 5(5), 363\u2013387 (2012)","journal-title":"Stat. Anal. Data Min.: ASA Data Sci. J."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38961-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T08:06:36Z","timestamp":1657872396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-38961-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389604","9783030389611"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38961-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2019\/","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":"251","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":"73","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":"29","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":"29% - 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":"2.4","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":"5.8","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)"}}]}}