- 期刊
- OpenAccess
Clustering Non-Ordered Discrete Data
並列摘要
Clustering in continuous vector data spaces is a well-studied problem. In recent years there has been a significant amount of research work in clustering categorical data. However, most of these works deal with market-basket type transaction data and are not specifically optimized for high-dimensional vectors. Our focus in this paper is to efficiently cluster high-dimensional vectors in non-ordered discrete data spaces (NDDS). We have defined several necessary geometrical concepts in NDDS which form the basis of our clustering algorithm. Several new heuristics have been employed exploiting the characteristics of vectors in NDDS. Experimental results on large synthetic datasets demonstrate that the proposed approach is effective, in terms of cluster quality, robustness and running time. We have also applied our clustering algorithm to real datasets with promising results.
延伸閱讀
- Dai, B. R. (2006). Constrained Data Clustering [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2006.01143
- Ning, L. Y. (2022). Unsupervised Clustering Based on Alpha-Divergence [master's thesis, National Taiwan Normal University]. Airiti Library. https://doi.org/10.6345/NTNU202200195
- Syu, J. W. (2014). Center-based clustering with the string data [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-0412201511575021
- Mbarki, J., Jaara, E. M., Eljasouli, S. Y., Mbarki, J., & Jaara, E. (2016). A New Clustering Algorithm of Data Mining. Research Journal of Applied Sciences, Engineering and Technology, 13(6), 427-431. https://doi.org/10.19026/rjaset.13.3002
- Yang, J., Xiao, Y., Wang, J., Ma, Q., & Shen, Y. (2015). A Fast Clustering Algorithm for Data with a Few Labeled Instances. Computational Intelligence and Neuroscience, 2015(), 181-190. https://doi.org/10.1155/2015/196098