Full duplicate candidate pruning for frequent connected subgraph mining
Andrés Gago-Alonso, Jesús Ariel Carrasco-Ochoa, José Eladio Medina-Pagola, José Fco. Martínez-Trinidad · Integrated Computer-Aided Engineering · 2010
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