Subspace Clustering of High-Dimensional Data: An Evolutionary Approach

Suguna, M., & Palaniammal, S. (2014). A New Approach for Subspace Clustering of High Dimensional Data. International Journal of Computer Science and Application, 3(2), 74-78. https://doi.org/10.14355/ijcsa.2014.0302.02
Dai, B. R., & Chen, M. S. (2007). Constrained Clustering for the Evolving Data Stream. 電腦學刊, 17(4), 37-51. https://www.airitilibrary.com/Article/Detail?DocID=19911599-200701-17-4-37-51-a
吳祖寧（2019）。The possibilistic C-means clustering of processing directional data〔碩士論文，中原大學〕。華藝線上圖書館。https://doi.org/10.6840/cycu201900605
Hsu, C. M. (2008). On the Processing and Measurement of High Dimensional Data [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.03043
Martinovič, J., Slaninová, K., Vojacek, L., Drázdilová, P., Dvorský, J., & Vondrák, I. (2013). EFFECTIVE CLUSTERING ALGORITHM FOR HIGH-DIMENSIONAL SPARSE DATA BASED ON SOM. Neural Network World, 23(2), 131-147. https://doi.org/10.14311/NNW.2013.23.010