Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments

Borgelt C, Meinl T, Berthold MR (2004)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2004

Publisher: IEEE

Edited Volumes: Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Pages Range: 4565-4570 vol. 5

Conference Proceedings Title: Proceedings of the 2004 Intl Conference on Systems, Man and Cybernetics

Event location: Den Haag NL

ISBN: 0-7803-8567-5

URI: http://www2.informatik.uni-erlangen.de/publication/download/advancedPruning_SMC2004.pdf

DOI: 10.1109/ICSMC.2004.1401251

Abstract

In recent years several algorithms for mining frequent subgraphs in graph databases have been proposed, with a major application area being the discovery of frequent substructures of biomolecules. Unfortunately, most of these algorithms still struggle with fairly long execution times if larger substructures or molecular fragments are desired. In this paper we describe two advanced pruning strategies -equivalent sibling pruning and perfect extension pruning -that can be used to speed up the MoFa algorithm (introduced in [2]) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database. © 2004 IEEE.

How to cite

APA:

Borgelt, C., Meinl, T., & Berthold, M.R. (2004). Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. In Thissen, Wil ; Wieringa, Peter ; Pantic, Maja ; Ludema, Marcel (Eds.), Proceedings of the 2004 Intl Conference on Systems, Man and Cybernetics (pp. 4565-4570 vol. 5). Den Haag, NL: IEEE.

MLA:

Borgelt, Christian, Thorsten Meinl, and Michael R. Berthold. "Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments." Proceedings of the 2004 IEEE Conference on Systems, Man & Cybernetics, Den Haag Ed. Thissen, Wil ; Wieringa, Peter ; Pantic, Maja ; Ludema, Marcel, IEEE, 2004. 4565-4570 vol. 5.

BibTeX: Download