期刊论文详细信息
Computación y Sistemas | |
Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining | |
Andrés Gago Alonso1  Jesús A. Carrasco Ochoa1  José E. Medina Pagola1  José F. Martínez Trinidad1  | |
关键词: Data mining; frequent patterns; graph mining; frequent subgraph.; | |
DOI : | |
学科分类:电子、光学、磁材料 | |
来源: Instituto Politecnico Nacional * Centro de Investigacion en Computacion | |
【 摘 要 】
Frequent connected subgraph (FCS) mining is an interesting problem with wide applications in real life. Most of the FCS mining algorithms have been focused o...
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201912050599248ZK.pdf | 789KB | download |