Dynamic Feature Selection for Clustering High Dimensional Data Streams. Fahy, C. & Yang, S. IEEE Access, 7:127128–127140, 2019. Conference Name: IEEE Accessdoi abstract bibtex Change in a data stream can occur at the concept level and at the feature level. Change at the feature level can occur if new, additional features appear in the stream or if the importance and relevance of a feature changes as the stream progresses. This type of change has not received as much attention as concept-level change. Furthermore, a lot of the methods proposed for clustering streams (density-based, graph-based, and grid-based) rely on some form of distance as a similarity metric and this is problematic in high-dimensional data where the curse of dimensionality renders distance measurements and any concept of “density” difficult. To address these two challenges we propose combining them and framing the problem as a feature selection problem, specifically a dynamic feature selection problem. We propose a dynamic feature mask for clustering high dimensional data streams. Redundant features are masked and clustering is performed along unmasked, relevant features. If a feature's perceived importance changes, the mask is updated accordingly; previously unimportant features are unmasked and features which lose relevance become masked. The proposed method is algorithm-independent and can be used with any of the existing density-based clustering algorithms which typically do not have a mechanism for dealing with feature drift and struggle with high-dimensional data. We evaluate the proposed method on four density-based clustering algorithms across four high-dimensional streams; two text streams and two image streams. In each case, the proposed dynamic feature mask improves clustering performance and reduces the processing time required by the underlying algorithm. Furthermore, change at the feature level can be observed and tracked.
@article{fahy_dynamic_2019,
title = {Dynamic {Feature} {Selection} for {Clustering} {High} {Dimensional} {Data} {Streams}},
volume = {7},
issn = {2169-3536},
doi = {10.1109/ACCESS.2019.2932308},
abstract = {Change in a data stream can occur at the concept level and at the feature level. Change at the feature level can occur if new, additional features appear in the stream or if the importance and relevance of a feature changes as the stream progresses. This type of change has not received as much attention as concept-level change. Furthermore, a lot of the methods proposed for clustering streams (density-based, graph-based, and grid-based) rely on some form of distance as a similarity metric and this is problematic in high-dimensional data where the curse of dimensionality renders distance measurements and any concept of “density” difficult. To address these two challenges we propose combining them and framing the problem as a feature selection problem, specifically a dynamic feature selection problem. We propose a dynamic feature mask for clustering high dimensional data streams. Redundant features are masked and clustering is performed along unmasked, relevant features. If a feature's perceived importance changes, the mask is updated accordingly; previously unimportant features are unmasked and features which lose relevance become masked. The proposed method is algorithm-independent and can be used with any of the existing density-based clustering algorithms which typically do not have a mechanism for dealing with feature drift and struggle with high-dimensional data. We evaluate the proposed method on four density-based clustering algorithms across four high-dimensional streams; two text streams and two image streams. In each case, the proposed dynamic feature mask improves clustering performance and reduces the processing time required by the underlying algorithm. Furthermore, change at the feature level can be observed and tracked.},
journal = {IEEE Access},
author = {Fahy, Conor and Yang, Shengxiang},
year = {2019},
note = {Conference Name: IEEE Access},
keywords = {Clustering algorithms, Correlation, Data stream clustering, Feature extraction, Heuristic algorithms, Measurement, Microsoft Windows, Streaming media, dynamic feature selection, feature drift, feature evolution, unsupervised feature selection},
pages = {127128--127140},
}
Downloads: 0
{"_id":"uqHGyT4LnawPKJepr","bibbaseid":"fahy-yang-dynamicfeatureselectionforclusteringhighdimensionaldatastreams-2019","author_short":["Fahy, C.","Yang, S."],"bibdata":{"bibtype":"article","type":"article","title":"Dynamic Feature Selection for Clustering High Dimensional Data Streams","volume":"7","issn":"2169-3536","doi":"10.1109/ACCESS.2019.2932308","abstract":"Change in a data stream can occur at the concept level and at the feature level. Change at the feature level can occur if new, additional features appear in the stream or if the importance and relevance of a feature changes as the stream progresses. This type of change has not received as much attention as concept-level change. Furthermore, a lot of the methods proposed for clustering streams (density-based, graph-based, and grid-based) rely on some form of distance as a similarity metric and this is problematic in high-dimensional data where the curse of dimensionality renders distance measurements and any concept of “density” difficult. To address these two challenges we propose combining them and framing the problem as a feature selection problem, specifically a dynamic feature selection problem. We propose a dynamic feature mask for clustering high dimensional data streams. Redundant features are masked and clustering is performed along unmasked, relevant features. If a feature's perceived importance changes, the mask is updated accordingly; previously unimportant features are unmasked and features which lose relevance become masked. The proposed method is algorithm-independent and can be used with any of the existing density-based clustering algorithms which typically do not have a mechanism for dealing with feature drift and struggle with high-dimensional data. We evaluate the proposed method on four density-based clustering algorithms across four high-dimensional streams; two text streams and two image streams. In each case, the proposed dynamic feature mask improves clustering performance and reduces the processing time required by the underlying algorithm. Furthermore, change at the feature level can be observed and tracked.","journal":"IEEE Access","author":[{"propositions":[],"lastnames":["Fahy"],"firstnames":["Conor"],"suffixes":[]},{"propositions":[],"lastnames":["Yang"],"firstnames":["Shengxiang"],"suffixes":[]}],"year":"2019","note":"Conference Name: IEEE Access","keywords":"Clustering algorithms, Correlation, Data stream clustering, Feature extraction, Heuristic algorithms, Measurement, Microsoft Windows, Streaming media, dynamic feature selection, feature drift, feature evolution, unsupervised feature selection","pages":"127128–127140","bibtex":"@article{fahy_dynamic_2019,\n\ttitle = {Dynamic {Feature} {Selection} for {Clustering} {High} {Dimensional} {Data} {Streams}},\n\tvolume = {7},\n\tissn = {2169-3536},\n\tdoi = {10.1109/ACCESS.2019.2932308},\n\tabstract = {Change in a data stream can occur at the concept level and at the feature level. Change at the feature level can occur if new, additional features appear in the stream or if the importance and relevance of a feature changes as the stream progresses. This type of change has not received as much attention as concept-level change. Furthermore, a lot of the methods proposed for clustering streams (density-based, graph-based, and grid-based) rely on some form of distance as a similarity metric and this is problematic in high-dimensional data where the curse of dimensionality renders distance measurements and any concept of “density” difficult. To address these two challenges we propose combining them and framing the problem as a feature selection problem, specifically a dynamic feature selection problem. We propose a dynamic feature mask for clustering high dimensional data streams. Redundant features are masked and clustering is performed along unmasked, relevant features. If a feature's perceived importance changes, the mask is updated accordingly; previously unimportant features are unmasked and features which lose relevance become masked. The proposed method is algorithm-independent and can be used with any of the existing density-based clustering algorithms which typically do not have a mechanism for dealing with feature drift and struggle with high-dimensional data. We evaluate the proposed method on four density-based clustering algorithms across four high-dimensional streams; two text streams and two image streams. In each case, the proposed dynamic feature mask improves clustering performance and reduces the processing time required by the underlying algorithm. Furthermore, change at the feature level can be observed and tracked.},\n\tjournal = {IEEE Access},\n\tauthor = {Fahy, Conor and Yang, Shengxiang},\n\tyear = {2019},\n\tnote = {Conference Name: IEEE Access},\n\tkeywords = {Clustering algorithms, Correlation, Data stream clustering, Feature extraction, Heuristic algorithms, Measurement, Microsoft Windows, Streaming media, dynamic feature selection, feature drift, feature evolution, unsupervised feature selection},\n\tpages = {127128--127140},\n}\n\n","author_short":["Fahy, C.","Yang, S."],"key":"fahy_dynamic_2019","id":"fahy_dynamic_2019","bibbaseid":"fahy-yang-dynamicfeatureselectionforclusteringhighdimensionaldatastreams-2019","role":"author","urls":{},"keyword":["Clustering algorithms","Correlation","Data stream clustering","Feature extraction","Heuristic algorithms","Measurement","Microsoft Windows","Streaming media","dynamic feature selection","feature drift","feature evolution","unsupervised feature selection"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["clustering algorithms","correlation","data stream clustering","feature extraction","heuristic algorithms","measurement","microsoft windows","streaming media","dynamic feature selection","feature drift","feature evolution","unsupervised feature selection"],"search_terms":["dynamic","feature","selection","clustering","high","dimensional","data","streams","fahy","yang"],"title":"Dynamic Feature Selection for Clustering High Dimensional Data Streams","year":2019}