Publikation: Subgraph Mining
Lade...
Dateien
Datum
2008
Autor:innen
Fischer, Ingrid
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Sammelband
Publikationsstatus
Published
Erschienen in
Encyclopedia of Data Warehousing and Mining. 2. Hershey, PA, USA: IGI Global, 2008, pp. 1865-1870
Zusammenfassung
Graphs are often used as models in very different application areas ranging from networks to molecules and proteins. Having graphs in a graph database it is an interesting problem to find small graph parts, so called subgraphs, that appear in a certain number of graphs within the database. Possible subgraphs of a set of graphs form a lattice that must be searched to find the subgraphs that appear most frequently. Two steps are necessary for this search: first new possible subgraphs must be generated, secondly it must be checked how often a newly generated subgraph appears in the database. Additionally intelligent pruning methods, inexact graph matching and background knowledge can be incorporated in the mining algorithms.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
graph mining
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
FISCHER, Ingrid, Thorsten MEINL, 2008. Subgraph Mining. In: Encyclopedia of Data Warehousing and Mining. 2. Hershey, PA, USA: IGI Global, 2008, pp. 1865-1870BibTex
@incollection{Fischer2008Subgr-5922,
year={2008},
title={Subgraph Mining},
edition={2},
publisher={IGI Global},
address={Hershey, PA, USA},
booktitle={Encyclopedia of Data Warehousing and Mining},
pages={1865--1870},
author={Fischer, Ingrid and Meinl, Thorsten}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5922">
<dcterms:bibliographicCitation>First publ. in: Encyclopedia of Data Warehousing and Mining, 2. ed. - Hershey, PA, USA : IGI Global, 2008, pp. 1865-1870</dcterms:bibliographicCitation>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:issued>2008</dcterms:issued>
<dc:contributor>Fischer, Ingrid</dc:contributor>
<dc:creator>Fischer, Ingrid</dc:creator>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5922/1/Wang2007.pdf"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:23Z</dcterms:available>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:format>application/pdf</dc:format>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:01:23Z</dc:date>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5922"/>
<dc:creator>Meinl, Thorsten</dc:creator>
<dc:contributor>Meinl, Thorsten</dc:contributor>
<dcterms:title>Subgraph Mining</dcterms:title>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5922/1/Wang2007.pdf"/>
<dc:language>eng</dc:language>
<dcterms:abstract xml:lang="eng">Graphs are often used as models in very different application areas ranging from networks to molecules and proteins. Having graphs in a graph database it is an interesting problem to find small graph parts, so called subgraphs, that appear in a certain number of graphs within the database. Possible subgraphs of a set of graphs form a lattice that must be searched to find the subgraphs that appear most frequently. Two steps are necessary for this search: first new possible subgraphs must be generated, secondly it must be checked how often a newly generated subgraph appears in the database. Additionally intelligent pruning methods, inexact graph matching and background knowledge can be incorporated in the mining algorithms.</dcterms:abstract>
<dc:rights>terms-of-use</dc:rights>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
