Advanced pruning strategies to speed up mining closed molecular fragments

In 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 substructur...

Full description

Saved in:
Bibliographic Details
Main Authors: Borgelt, C., Meinl, T., Berthold, M.R.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Biochemistry
Computer science
Computer science
control theory
systems
Control theory. Systems
Data mining
Drugs
Ear
Exact sciences and technology
Human immunodeficiency virus
Hydrogen
Information science
Protection
Tree graphs
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 4570 vol.5
container_issue
container_start_page 4565
container_title
container_volume 5
creator Borgelt, C.
Meinl, T.
Berthold, M.R.
description In 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. 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 C. Borgelt and M.R. Berthold, (2002)) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database.
doi_str_mv 10.1109/ICSMC.2004.1401251
format conference_proceeding
fullrecord <record><control><sourceid>pascalfrancis_CHZPO</sourceid><recordid>TN_cdi_pascalfrancis_primary_17524164</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1401251</ieee_id><sourcerecordid>17524164</sourcerecordid><originalsourceid>FETCH-LOGICAL-i249t-1d3e7103548bbdba0077510095a665fd8b727e8b0d4e309aaeedb99356e17f1f3</originalsourceid><addsrcrecordid>eNpFkElLxEAUhBsXcGb0D-glF48Z3-s1fRyCy8CIBxW8DZ3kJbRkI50I_nuDETwV1FdUQTF2jbBFBHu3T1-f0y0HkFuUgFzhCVtxZUyMWqlTtgaTgEiU1uaMrRA0jy3nHxdsHcInAAeJyYrtd8WXa3Mqon6YWt9WURgHN1LlKURjF4WeZjb1UeN_aV53YTaarqZ8qt0QlYOrGmrHcMnOS1cHuvrTDXt_uH9Ln-LDy-M-3R1iz6UdYywEGQShZJJlReYAjFEIYJXTWpVFkhluKMmgkCTAOjfvZ9YKpQlNiaXYsNult3chd_W83-Y-HPvBN274PqJRXKKWc-5myXki-sfLVeIHcsRbfw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Advanced pruning strategies to speed up mining closed molecular fragments</title><source>IEEE Xplore All Conference Series</source><creator>Borgelt, C. ; Meinl, T. ; Berthold, M.R.</creator><creatorcontrib>Borgelt, C. ; Meinl, T. ; Berthold, M.R.</creatorcontrib><description>In 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. 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 C. Borgelt and M.R. Berthold, (2002)) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database.</description><identifier>ISSN: 1062-922X</identifier><identifier>ISBN: 0780385667</identifier><identifier>ISBN: 9780780385665</identifier><identifier>EISSN: 2577-1655</identifier><identifier>DOI: 10.1109/ICSMC.2004.1401251</identifier><language>eng</language><publisher>Piscataway NJ: IEEE</publisher><subject>Applied sciences ; Biochemistry ; Computer science ; Computer science; control theory; systems ; Control theory. Systems ; Data mining ; Drugs ; Ear ; Exact sciences and technology ; Human immunodeficiency virus ; Hydrogen ; Information science ; Protection ; Tree graphs</subject><ispartof>2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2004, Vol.5, p.4565-4570 vol.5</ispartof><rights>2006 INIST-CNRS</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1401251$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1401251$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17524164$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Borgelt, C.</creatorcontrib><creatorcontrib>Meinl, T.</creatorcontrib><creatorcontrib>Berthold, M.R.</creatorcontrib><title>Advanced pruning strategies to speed up mining closed molecular fragments</title><title>2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)</title><addtitle>ICSMC</addtitle><description>In 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. 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 C. Borgelt and M.R. Berthold, (2002)) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database.</description><subject>Applied sciences</subject><subject>Biochemistry</subject><subject>Computer science</subject><subject>Computer science; control theory; systems</subject><subject>Control theory. Systems</subject><subject>Data mining</subject><subject>Drugs</subject><subject>Ear</subject><subject>Exact sciences and technology</subject><subject>Human immunodeficiency virus</subject><subject>Hydrogen</subject><subject>Information science</subject><subject>Protection</subject><subject>Tree graphs</subject><issn>1062-922X</issn><issn>2577-1655</issn><isbn>0780385667</isbn><isbn>9780780385665</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFkElLxEAUhBsXcGb0D-glF48Z3-s1fRyCy8CIBxW8DZ3kJbRkI50I_nuDETwV1FdUQTF2jbBFBHu3T1-f0y0HkFuUgFzhCVtxZUyMWqlTtgaTgEiU1uaMrRA0jy3nHxdsHcInAAeJyYrtd8WXa3Mqon6YWt9WURgHN1LlKURjF4WeZjb1UeN_aV53YTaarqZ8qt0QlYOrGmrHcMnOS1cHuvrTDXt_uH9Ln-LDy-M-3R1iz6UdYywEGQShZJJlReYAjFEIYJXTWpVFkhluKMmgkCTAOjfvZ9YKpQlNiaXYsNult3chd_W83-Y-HPvBN274PqJRXKKWc-5myXki-sfLVeIHcsRbfw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Borgelt, C.</creator><creator>Meinl, T.</creator><creator>Berthold, M.R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Advanced pruning strategies to speed up mining closed molecular fragments</title><author>Borgelt, C. ; Meinl, T. ; Berthold, M.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i249t-1d3e7103548bbdba0077510095a665fd8b727e8b0d4e309aaeedb99356e17f1f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Biochemistry</topic><topic>Computer science</topic><topic>Computer science; control theory; systems</topic><topic>Control theory. Systems</topic><topic>Data mining</topic><topic>Drugs</topic><topic>Ear</topic><topic>Exact sciences and technology</topic><topic>Human immunodeficiency virus</topic><topic>Hydrogen</topic><topic>Information science</topic><topic>Protection</topic><topic>Tree graphs</topic><toplevel>online_resources</toplevel><creatorcontrib>Borgelt, C.</creatorcontrib><creatorcontrib>Meinl, T.</creatorcontrib><creatorcontrib>Berthold, M.R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Borgelt, C.</au><au>Meinl, T.</au><au>Berthold, M.R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Advanced pruning strategies to speed up mining closed molecular fragments</atitle><btitle>2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)</btitle><stitle>ICSMC</stitle><date>2004</date><risdate>2004</risdate><volume>5</volume><spage>4565</spage><epage>4570 vol.5</epage><pages>4565-4570 vol.5</pages><issn>1062-922X</issn><eissn>2577-1655</eissn><isbn>0780385667</isbn><isbn>9780780385665</isbn><abstract>In 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. 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 C. Borgelt and M.R. Berthold, (2002)) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI's HIV database.</abstract><cop>Piscataway NJ</cop><pub>IEEE</pub><doi>10.1109/ICSMC.2004.1401251</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1062-922X
ispartof 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2004, Vol.5, p.4565-4570 vol.5
issn 1062-922X
2577-1655
language eng
recordid cdi_pascalfrancis_primary_17524164
source IEEE Xplore All Conference Series
subjects Applied sciences
Biochemistry
Computer science
Computer science
control theory
systems
Control theory. Systems
Data mining
Drugs
Ear
Exact sciences and technology
Human immunodeficiency virus
Hydrogen
Information science
Protection
Tree graphs
title Advanced pruning strategies to speed up mining closed molecular fragments
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T18%3A31%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Advanced%20pruning%20strategies%20to%20speed%20up%20mining%20closed%20molecular%20fragments&rft.btitle=2004%20IEEE%20International%20Conference%20on%20Systems,%20Man%20and%20Cybernetics%20(IEEE%20Cat.%20No.04CH37583)&rft.au=Borgelt,%20C.&rft.date=2004&rft.volume=5&rft.spage=4565&rft.epage=4570%20vol.5&rft.pages=4565-4570%20vol.5&rft.issn=1062-922X&rft.eissn=2577-1655&rft.isbn=0780385667&rft.isbn_list=9780780385665&rft_id=info:doi/10.1109/ICSMC.2004.1401251&rft_dat=%3Cpascalfrancis_CHZPO%3E17524164%3C/pascalfrancis_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i249t-1d3e7103548bbdba0077510095a665fd8b727e8b0d4e309aaeedb99356e17f1f3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1401251&rfr_iscdi=true