RHPTree—Risk Hierarchical Pattern Tree for Scalable Long Pattern Mining
| Autor: | Danlu Liu, Yu Li, William Baskett, Dan Lin, Chi-Ren Shyu |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | ACM Transactions on Knowledge Discovery from Data. 16:1-33 |
| ISSN: | 1556-472X 1556-4681 |
| Popis: | Risk patterns are crucial in biomedical research and have served as an important factor in precision health and disease prevention. Despite recent development in parallel and high-performance computing, existing risk pattern mining methods still struggle with problems caused by large-scale datasets, such as redundant candidate generation, inability to discover long significant patterns, and prolonged post pattern filtering. In this article, we propose a novel dynamic tree structure, Risk Hierarchical Pattern Tree (RHPTree), and a top-down search method, RHPSearch, which are capable of efficiently analyzing a large volume of data and overcoming the limitations of previous works. The dynamic nature of the RHPTree avoids costly tree reconstruction for the iterative search process and dataset updates. We also introduce two specialized search methods, the extended target search (RHPSearch-TS) and the parallel search approach (RHPSearch-SD), to further speed up the retrieval of certain items of interest. Experiments on both UCI machine learning datasets and sampled datasets of the Simons Foundation Autism Research Initiative (SFARI)—Simon’s Simplex Collection (SSC) datasets demonstrate that our method is not only faster but also more effective in identifying comprehensive long risk patterns than existing works. Moreover, the proposed new tree structure is generic and applicable to other pattern mining problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|