Portal de Periódicos da CAPES

Full duplicate candidate pruning for frequent connected subgraph mining

2010; IOS Press; Volume: 17; Issue: 3 Linguagem: Inglês

10.3233/ica-2010-0342

1875-8835

Andrés Gago-Alonso, Jesús Ariel Carrasco-Ochoa, José E. Medina-Pagola, José Fco. Martínez-Trinidad,

Data Management and Algorithms

Support calculation and duplicate detection are the most challenging and unavoidable subtasks in frequent connected subgraph (FCS) mining. The most successful FCS mining algorithms have focused on optimizing these subtasks since the existing solution