{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:55:22Z","timestamp":1783518922621,"version":"3.55.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673331"],"award-info":[{"award-number":["61673331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012234","name":"Shenzhen Peacock Plan","doi-asserted-by":"crossref","award":["KQTD2016112514355531"],"award-info":[{"award-number":["KQTD2016112514355531"]}],"id":[{"id":"10.13039\/501100012234","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2932308","type":"journal-article","created":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T19:54:36Z","timestamp":1564602876000},"page":"127128-127140","source":"Crossref","is-referenced-by-count":27,"title":["Dynamic Feature Selection for Clustering High Dimensional Data Streams"],"prefix":"10.1109","volume":"7","author":[{"given":"Conor","family":"Fahy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7222-4917","authenticated-orcid":false,"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2844399"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2879361"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11573036_32"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0271(71)90051-9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806521"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3136625"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.08.006"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.71"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020555"},{"key":"ref28","first-page":"507","article-title":"Laplacian score for feature selection","author":"he","year":"2005","journal-title":"Proc 18th Int Conf Neural Inf Process Syst"},{"key":"ref27","article-title":"Correlation-based feature selection for machine learning","author":"hall","year":"1999"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2005.09.024"},{"key":"ref2","first-page":"110","article-title":"Feature selection for clustering: A review","volume":"29","author":"alelyani","year":"2013","journal-title":"Algorithms for clustering data"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2922969"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0242-x"},{"key":"ref21","first-page":"19","article-title":"NIST’s 1998 topic detection and tracking evaluation (TDT2)","author":"fiscus","year":"1999","journal-title":"Proc DARPA Broadcast News Workshop"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5642-8"},{"key":"ref23","first-page":"1612","article-title":"A short introduction to boosting","volume":"14","author":"freund","year":"1999","journal-title":"J Jpn Soc Artif Intell"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892124"},{"key":"ref25","first-page":"266","article-title":"Generalized Fisher score for feature selection","author":"gu","year":"2011","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0659-1"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-540-75175-5_30","article-title":"Feature selection for high-dimensional data—A pearson redundancy based filter","author":"biesiada","year":"2007","journal-title":"Proc Comput Recognit Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.61"},{"key":"ref12","first-page":"249","article-title":"Adaptive learning from evolving data streams","author":"bifet","year":"2009","journal-title":"Proc Int Symp Intell Data Anal"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835848"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.29"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150466"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.11.024"},{"key":"ref17","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref18","author":"fahim","year":"2006","journal-title":"Density Clustering Based on Radius of Data (DCBRD)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2822552"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2016.07.005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-014-1416-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.031"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2016.06.007"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-319-46227-1_9","article-title":"On dynamic feature weighting for feature drifting data streams","author":"barddal","year":"2016","journal-title":"Proc Eur Conf Mach Learn Knowl Discovery Databases"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2771947"},{"key":"ref9","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","author":"belkin","year":"2001","journal-title":"Proc 14th Int Conf Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2016.056"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1552303.1552305"},{"key":"ref48","author":"wilcoxon","year":"1964","journal-title":"Some Rapid Approximate Statistical Procedures"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1552303.1552307"},{"key":"ref42","first-page":"1","article-title":"Heterogeneous ensemble for feature drifts in data streams","author":"nguyen","year":"2012","journal-title":"Proc Pacific–Asia Conf Knowl Discovery Data Mining"},{"key":"ref41","article-title":"Columbia object image library (coil-20)","author":"nene","year":"1996"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.478"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08782608.pdf?arnumber=8782608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T17:49:08Z","timestamp":1643305748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8782608\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2932308","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}