.png){kind=icon}
返回
Mining colossal patterns with length constraints
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-021-02357-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining of colossal patterns is used to mine patterns in databases with many attributes and values, but the number of instances in each database is small. Although many efficient approaches for extracting colossal patterns have been proposed, they cannot be applied to colossal pattern mining with constraints. In this paper, we solve the challenge of extracting colossal patterns with length constraints. Firstly, we describe the problems of min-length constraint and max-length constraint and combine them with length constraints. After that, we evolve a proposal for efficiently truncating candidates in the mining process and another one for fast checking of candidates. Based on these properties, we offer the mining algorithm of Length Constraints for Colossal Pattern (LCCP) to extract colossal patterns with length constraints. Experiments are also conducted to show the effectiveness of the proposed LCCP algorithm with a comparison to some other ones.
Keyword:
Colossal pattern
Data mining
High-dimensional database
Length constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Canopy‐Based Normalized Difference Vegetation Index Sensors for Monitoring Cotton Nitrogen Status
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏分享收藏Non-parametric spectral estimation techniques for DNA sequence analysis and exon region prediction
PREAI
分享收藏
查看更多内容