2024/10/03 by Akanksha Das, Das, Akanksha, Malay Bhattacharyya +1
Computer Science · #Advanced Clustering Algorithms Research #FOS: Computer and information sciences #Machine Learning (cs.LG)
paper · pdf · doi:10.48550/arxiv.2410.02290
openalex publication_date 2024/10/03 · openalex created_date 2024/10/30 · openalex updated_date 2026/07/28
Density based spatial clustering of points in ℝn has a myriad of applications in a variety of industries. We generalise this problem to the density based clustering of lines in high-dimensional spaces, keeping in mind there exists no valid distance measure that follows the triangle inequality for lines. In this paper, we design a clustering algorithm that generates a customised neighbourhood for a line of a fixed volume (given as a parameter), based on an optional parameter as a continuous probability density function. This algorithm is not sensitive to the outliers and can effectively identify the noise in the data using a cardinality parameter. One of the pivotal applications of this algorithm is clustering data points in ℝn with missing entries, while utilising the domain knowledge of the respective data. In particular, the proposed algorithm is able to cluster n-dimensional data points that contain at least (n-1)-dimensional information. We illustrate the neighbourhoods for the standard probability distributions with continuous probability density functions and demonstrate the effectiveness of our algorithm on various synthetic and real-world datasets (e.g., rail and road networks). The experimental results also highlight its application in clustering incomplete data.