Dynamic Sparse Subspace Clustering for Evolving High-Dimensional Data Streams. Sui, J., Liu, Z., Liu, L., Jung, A., & Li, X. IEEE Transactions on Cybernetics, 52(6):4173–4186, June, 2022. Conference Name: IEEE Transactions on Cyberneticsdoi abstract bibtex In an era of ubiquitous large-scale evolving data streams, data stream clustering (DSC) has received lots of attention because the scale of the data streams far exceeds the ability of expert human analysts. It has been observed that high-dimensional data are usually distributed in a union of low-dimensional subspaces. In this article, we propose a novel sparse representation-based DSC algorithm, called evolutionary dynamic sparse subspace clustering (EDSSC). It can cope with the time-varying nature of subspaces underlying the evolving data streams, such as subspace emergence, disappearance, and recurrence. The proposed EDSSC consists of two phases: 1) static learning and 2) online clustering. During the first phase, a data structure for storing the statistic summary of data streams, called EDSSC summary, is proposed which can better address the dilemma between the two conflicting goals: 1) saving more points for accuracy of subspace clustering (SC) and 2) discarding more points for the efficiency of DSC. By further proposing an algorithm to estimate the subspace number, the proposed EDSSC does not need to know the number of subspaces. In the second phase, a more suitable index, called the average sparsity concentration index (ASCI), is proposed, which dramatically promotes the clustering accuracy compared to the conventionally utilized SCI index. In addition, the subspace evolution detection model based on the Page-Hinkley test is proposed where the appearing, disappearing, and recurring subspaces can be detected and adapted. Extinct experiments on real-world data streams show that the EDSSC outperforms the state-of-the-art online SC approaches.
@article{sui_dynamic_2022,
title = {Dynamic {Sparse} {Subspace} {Clustering} for {Evolving} {High}-{Dimensional} {Data} {Streams}},
volume = {52},
issn = {2168-2275},
doi = {10.1109/TCYB.2020.3023973},
abstract = {In an era of ubiquitous large-scale evolving data streams, data stream clustering (DSC) has received lots of attention because the scale of the data streams far exceeds the ability of expert human analysts. It has been observed that high-dimensional data are usually distributed in a union of low-dimensional subspaces. In this article, we propose a novel sparse representation-based DSC algorithm, called evolutionary dynamic sparse subspace clustering (EDSSC). It can cope with the time-varying nature of subspaces underlying the evolving data streams, such as subspace emergence, disappearance, and recurrence. The proposed EDSSC consists of two phases: 1) static learning and 2) online clustering. During the first phase, a data structure for storing the statistic summary of data streams, called EDSSC summary, is proposed which can better address the dilemma between the two conflicting goals: 1) saving more points for accuracy of subspace clustering (SC) and 2) discarding more points for the efficiency of DSC. By further proposing an algorithm to estimate the subspace number, the proposed EDSSC does not need to know the number of subspaces. In the second phase, a more suitable index, called the average sparsity concentration index (ASCI), is proposed, which dramatically promotes the clustering accuracy compared to the conventionally utilized SCI index. In addition, the subspace evolution detection model based on the Page-Hinkley test is proposed where the appearing, disappearing, and recurring subspaces can be detected and adapted. Extinct experiments on real-world data streams show that the EDSSC outperforms the state-of-the-art online SC approaches.},
number = {6},
journal = {IEEE Transactions on Cybernetics},
author = {Sui, Jinping and Liu, Zhen and Liu, Li and Jung, Alexander and Li, Xiang},
month = jun,
year = {2022},
note = {Conference Name: IEEE Transactions on Cybernetics},
keywords = {Adaptation models, Clustering algorithms, Data models, Data stream clustering (DSC), Data structures, Heuristic algorithms, Indexes, Task analysis, high-dimensional data stream, sparse representation, subspace clustering (SC)},
pages = {4173--4186},
}
Downloads: 0
{"_id":"DPseDPDKLDyq4broY","bibbaseid":"sui-liu-liu-jung-li-dynamicsparsesubspaceclusteringforevolvinghighdimensionaldatastreams-2022","author_short":["Sui, J.","Liu, Z.","Liu, L.","Jung, A.","Li, X."],"bibdata":{"bibtype":"article","type":"article","title":"Dynamic Sparse Subspace Clustering for Evolving High-Dimensional Data Streams","volume":"52","issn":"2168-2275","doi":"10.1109/TCYB.2020.3023973","abstract":"In an era of ubiquitous large-scale evolving data streams, data stream clustering (DSC) has received lots of attention because the scale of the data streams far exceeds the ability of expert human analysts. It has been observed that high-dimensional data are usually distributed in a union of low-dimensional subspaces. In this article, we propose a novel sparse representation-based DSC algorithm, called evolutionary dynamic sparse subspace clustering (EDSSC). It can cope with the time-varying nature of subspaces underlying the evolving data streams, such as subspace emergence, disappearance, and recurrence. The proposed EDSSC consists of two phases: 1) static learning and 2) online clustering. During the first phase, a data structure for storing the statistic summary of data streams, called EDSSC summary, is proposed which can better address the dilemma between the two conflicting goals: 1) saving more points for accuracy of subspace clustering (SC) and 2) discarding more points for the efficiency of DSC. By further proposing an algorithm to estimate the subspace number, the proposed EDSSC does not need to know the number of subspaces. In the second phase, a more suitable index, called the average sparsity concentration index (ASCI), is proposed, which dramatically promotes the clustering accuracy compared to the conventionally utilized SCI index. In addition, the subspace evolution detection model based on the Page-Hinkley test is proposed where the appearing, disappearing, and recurring subspaces can be detected and adapted. Extinct experiments on real-world data streams show that the EDSSC outperforms the state-of-the-art online SC approaches.","number":"6","journal":"IEEE Transactions on Cybernetics","author":[{"propositions":[],"lastnames":["Sui"],"firstnames":["Jinping"],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["Zhen"],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["Li"],"suffixes":[]},{"propositions":[],"lastnames":["Jung"],"firstnames":["Alexander"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Xiang"],"suffixes":[]}],"month":"June","year":"2022","note":"Conference Name: IEEE Transactions on Cybernetics","keywords":"Adaptation models, Clustering algorithms, Data models, Data stream clustering (DSC), Data structures, Heuristic algorithms, Indexes, Task analysis, high-dimensional data stream, sparse representation, subspace clustering (SC)","pages":"4173–4186","bibtex":"@article{sui_dynamic_2022,\n\ttitle = {Dynamic {Sparse} {Subspace} {Clustering} for {Evolving} {High}-{Dimensional} {Data} {Streams}},\n\tvolume = {52},\n\tissn = {2168-2275},\n\tdoi = {10.1109/TCYB.2020.3023973},\n\tabstract = {In an era of ubiquitous large-scale evolving data streams, data stream clustering (DSC) has received lots of attention because the scale of the data streams far exceeds the ability of expert human analysts. It has been observed that high-dimensional data are usually distributed in a union of low-dimensional subspaces. In this article, we propose a novel sparse representation-based DSC algorithm, called evolutionary dynamic sparse subspace clustering (EDSSC). It can cope with the time-varying nature of subspaces underlying the evolving data streams, such as subspace emergence, disappearance, and recurrence. The proposed EDSSC consists of two phases: 1) static learning and 2) online clustering. During the first phase, a data structure for storing the statistic summary of data streams, called EDSSC summary, is proposed which can better address the dilemma between the two conflicting goals: 1) saving more points for accuracy of subspace clustering (SC) and 2) discarding more points for the efficiency of DSC. By further proposing an algorithm to estimate the subspace number, the proposed EDSSC does not need to know the number of subspaces. In the second phase, a more suitable index, called the average sparsity concentration index (ASCI), is proposed, which dramatically promotes the clustering accuracy compared to the conventionally utilized SCI index. In addition, the subspace evolution detection model based on the Page-Hinkley test is proposed where the appearing, disappearing, and recurring subspaces can be detected and adapted. Extinct experiments on real-world data streams show that the EDSSC outperforms the state-of-the-art online SC approaches.},\n\tnumber = {6},\n\tjournal = {IEEE Transactions on Cybernetics},\n\tauthor = {Sui, Jinping and Liu, Zhen and Liu, Li and Jung, Alexander and Li, Xiang},\n\tmonth = jun,\n\tyear = {2022},\n\tnote = {Conference Name: IEEE Transactions on Cybernetics},\n\tkeywords = {Adaptation models, Clustering algorithms, Data models, Data stream clustering (DSC), Data structures, Heuristic algorithms, Indexes, Task analysis, high-dimensional data stream, sparse representation, subspace clustering (SC)},\n\tpages = {4173--4186},\n}\n\n\n\n","author_short":["Sui, J.","Liu, Z.","Liu, L.","Jung, A.","Li, X."],"key":"sui_dynamic_2022","id":"sui_dynamic_2022","bibbaseid":"sui-liu-liu-jung-li-dynamicsparsesubspaceclusteringforevolvinghighdimensionaldatastreams-2022","role":"author","urls":{},"keyword":["Adaptation models","Clustering algorithms","Data models","Data stream clustering (DSC)","Data structures","Heuristic algorithms","Indexes","Task analysis","high-dimensional data stream","sparse representation","subspace clustering (SC)"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["adaptation models","clustering algorithms","data models","data stream clustering (dsc)","data structures","heuristic algorithms","indexes","task analysis","high-dimensional data stream","sparse representation","subspace clustering (sc)"],"search_terms":["dynamic","sparse","subspace","clustering","evolving","high","dimensional","data","streams","sui","liu","liu","jung","li"],"title":"Dynamic Sparse Subspace Clustering for Evolving High-Dimensional Data Streams","year":2022}