返回
Clustering-based gradual pattern mining
DOI:10.1007/s13042-023-02027-w.png)
摘要
En 中文
Generally, the classical problem of gradual pattern mining involves generating pattern candidates and determining the number of concordant object pairs associated with them. Given a numeric data set with n objects and m features, each feature yields two gradual items. Gradual pattern candidates can be formed by combining different sets of gradual items. In fact, a gradual pattern is composed of gradual items with similar concordant object pairs. However, computing the object pairs for each item has a complexity that is approximately quadratic in terms of the number of objects. As the main contribution of this paper, we propose finding gradual patterns by clustering gradual items based on their similarity in object pairs. First, we project the object pairs of each gradual item onto an n-dimensional subspace, thus reducing the complexity of computing object pairs from a quadratic function to a linear function. Second, we group gradual items into r clusters based on the similarity of object pairs in the n-dimensional subspace. As part of our experiments, we evaluated our approach using a variety of clustering algorithms. We found that the best clustering algorithms (across all the data sets we used) achieved precision scores above 55%, recall scores close to 100%, and F1 scores above 71%.
Keyword:
Data mining
Gradual patterns
Spectral clustering
Unsupervised learning
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
Rail industry knowledge, experience and perceptions on the use of nature-based solutions as climate change adaptation measures in Australia and the United Kingdom铁路行业知识、经验及对自然基解决方案作为气候变化适应措施在澳大利亚和英国的使用认知
Magmatic context of Bou Skour copper deposit (Eastern Anti-Atlas, Morocco): Petrogrography, geochemistry and alterationsBou Skour铜矿床(摩洛哥东部安提阿特拉斯)的岩浆环境:岩石学、地球化学和蚀变
Monitoring Asbestos Mine Remediation Using Airborne Hyperspectral Imaging System: A Case Study of Jefferson Lake Mine, US利用机载高光谱成像系统监测石棉矿修复:美国杰斐逊湖矿案例研究

