Abstract
A two-step algorithm, clustering algorithm based on sparse feature vector for interval-scaled variables (CABOSFV_I), is proposed for high dimensional sparse data clustering in this paper. It decomposes a high dimensional problem into several low dimensional ones in first step and then gets the final clusters by second clustering. Because the irrelevant attributes are removed from each cluster in first step, it diminishes the dimensions effectively. Furthermore, the algorithm compresses data effectively by using 'Sparse Feature Vector'. Data scale is reduced enormously, but clustering quality is not affected. Because of the effective dimension deduction and data compression, the algorithm finds clusters in high dimensional large datasets effectively and efficiently.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
