1. 온라인 데이터 스트림에서의 동적 부분 공간 클러스터링 기법.
- Author
-
박남훈
- Subjects
DATA distribution ,DATA mining ,MEMORY ,FINITE, The ,ALGORITHMS ,GRID computing - Abstract
Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the k th level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF