Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
Rock mass discontinuities are an excellent information set for reflecting the geometric, spatial, and physical properties of the rock mass. Using clustering algorithms to analyze them is a significant way to select advantageous orientations of structural surfaces and provide a scientific theoretical basis for other rock mass engineering research. Traditional clustering algorithms often suffer from sensitivity to initialization and lack practical applicability, as discontinuity data are typically rough, low-precision, and unlabeled. Confronting these challenges, II-LA-KM, a learning-augmented clustering algorithm with improved initialization for rock discontinuity grouping, is proposed. Our method begins with heuristically selecting initial centers to ensure they are well-separated. Then, optimal transport is used to adjust these centers, minimizing the transport cost between them and other points. To enhance fault tolerance, a learning-augmented algorithm is integrated that iteratively reduces clustering costs, refining the initial results toward optimal clustering. Extensive experiments on a simulated artificial dataset and a real dataset from Woxi, Hunan, China, featuring both orientational and non-orientational attributes, demonstrate the effectiveness of II-LA-KM. The algorithm achieves a 97.5% accuracy on the artificial dataset and successfully differentiates between overlapping groups. Its performance is even more pronounced on the real dataset, underscoring its robustness for handling complex and noisy data. These strengths make our approach highly beneficial for practical rock discontinuity grouping applications.
Rock mass discontinuities are an excellent information set for reflecting the geometric, spatial, and physical properties of the rock mass. Using clustering algorithms to analyze them is a significant way to select advantageous orientations of structural surfaces and provide a scientific theoretical basis for other rock mass engineering research. Traditional clustering algorithms often suffer from sensitivity to initialization and lack practical applicability, as discontinuity data are typically rough, low-precision, and unlabeled. Confronting these challenges, II-LA-KM, a learning-augmented clustering algorithm with improved initialization for rock discontinuity grouping, is proposed. Our method begins with heuristically selecting initial centers to ensure they are well-separated. Then, optimal transport is used to adjust these centers, minimizing the transport cost between them and other points. To enhance fault tolerance, a learning-augmented algorithm is integrated that iteratively reduces clustering costs, refining the initial results toward optimal clustering. Extensive experiments on a simulated artificial dataset and a real dataset from Woxi, Hunan, China, featuring both orientational and non-orientational attributes, demonstrate the effectiveness of II-LA-KM. The algorithm achieves a 97.5% accuracy on the artificial dataset and successfully differentiates between overlapping groups. Its performance is even more pronounced on the real dataset, underscoring its robustness for handling complex and noisy data. These strengths make our approach highly beneficial for practical rock discontinuity grouping applications.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.