LINSCAN -- A Linearity Based Clustering Algorithm
<|reference_start|>LINSCAN -- A Linearity Based Clustering Algorithm: DBSCAN and OPTICS are powerful algorithms for identifying clusters of points in domains where few assumptions can be made about the structure of the data. In this paper, we leverage these strengths and introduce a new algorithm, LINSCAN, designed to seek lineated clusters that are difficult to find and isolate with existing methods. In particular, by embedding points as normal distributions approximating their local neighborhoods and leveraging a distance function derived from the Kullback Leibler Divergence, LINSCAN can detect and distinguish lineated clusters that are spatially close but have orthogonal covariances. We demonstrate how LINSCAN can be applied to seismic data to identify active faults, including intersecting faults, and determine their orientation. Finally, we discuss the properties a generalization of DBSCAN and OPTICS must have in order to retain the stability benefits of these algorithms.<|reference_end|>
@article{dennehy2024linscan,
    title={LINSCAN -- A Linearity Based Clustering Algorithm},
    author={Andrew Dennehy, Xiaoyu Zou, Shabnam J. Semnani, Yuri Fialko, Alexander
  Cloninger},
    journal={arXiv preprint arXiv:2406.17952},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.17952},
    primaryClass={cs.LG cs.CG}
}