MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006

Gärtner, Thomas; Garriga, Gemma C.; Meinl, Thorsten

MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006

Dateien

MLG2006_Proceedings.pdfGröße: 4.2 MBDownloads: 1571

Datum

2006

Autor:innen

Gärtner, Thomas

Garriga, Gemma C.

Meinl, Thorsten

URI (zitierfähiger Link)

http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-67789

Link zur Lizenz

Attribution-NonCommercial-NoDerivs 2.0 Generic

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Konferenzband

Publikationsstatus

Published

Zusammenfassung

At a time where the amount of data collected day by day far exceeds the human capabilities to extract the knowledge hidden in it, it becomes more and more important to automate the process of learning. Typical data collections have two things in common: They are huge and the information stored in them is highly structured. Graphs are one of the most popular data representations in mathematics, computer science, engineering disciplines, and other natural sciences. This workshop on Mining and Learning with Graphs (MLG) thus concentrated on learning from graphs and its subclasses such as but not limited to trees, sequences (GTS). The primary goal of MLG was to bring together researchers working on various aspects of mining and learning with graphs. It is hence in the tradition of previous ECML/PKDD workshops on Mining Graphs, Trees, and Sequences (MGTS) but extends its scope to include other areas of machine learning and data mining also concerned with graphs and their subclasses such as: Algorithmic aspects of Theoretical aspects of Open problems in Novel applications of Evaluative studies of the following non-exclusive list of topics Kernels and Distances for graphs. GTS-structured output spaces. Frequent GTS mining. Learning with generative GTS models and compact (e.g., intensional) representations like GTS transformations, grammars, or matchings. Theoretical aspects of learning from GTS. Probabilistic modelling of GTS. GTS-based approaches to transductive and semi-supervised learning. Compared to previous workshops on MGTS, MLG was able to attract a record number of submissions (28 full and 6 short papers). For time and space restrictions, we could only accept 9 full papers and 15 short papers (most of which were originally submitted as full papers). For the first time, the workshop received the support of the PASCAL Network of Excellence that sponsored the invited talk and the best paper award. We most sincerely thank the PASCAL network for this sponsoring; the program committee and additional reviewers for their reviews; as well as the authors for their high quality submissions.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

GÄRTNER, Thomas, Gemma C. GARRIGA, Thorsten MEINL, 2006. MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006

BibTex

@proceedings{Gartner2006Proce-5412,
  year={2006},
  title={MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006}
}

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/5412">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">At a time where the amount of data collected day by day far exceeds the human capabilities to extract the knowledge hidden in it, it becomes more and more important to automate the process of learning. Typical data collections have two things in common: They are huge and the information stored in them is highly structured. Graphs are one of the most popular data representations in mathematics, computer science, engineering disciplines, and other natural sciences. This workshop on  Mining and Learning with Graphs  (MLG) thus concentrated on learning from graphs and its subclasses such as   but not limited to   trees, sequences (GTS). The primary goal of MLG was to bring together researchers working on various aspects of mining and learning with graphs. It is hence in the tradition of previous ECML/PKDD workshops on  Mining Graphs, Trees, and Sequences  (MGTS) but extends its scope to include other areas of machine learning and data mining also concerned with graphs and their subclasses such as: Algorithmic aspects of Theoretical aspects of Open problems in Novel applications of Evaluative studies of the following   non-exclusive   list of topics Kernels and Distances for graphs. GTS-structured output spaces. Frequent GTS mining. Learning with generative GTS models and compact (e.g., intensional) representations like GTS transformations, grammars, or matchings. Theoretical aspects of learning from GTS. Probabilistic modelling of GTS. GTS-based approaches to transductive and semi-supervised learning. Compared to previous workshops on MGTS, MLG was able to attract a record number of submissions (28 full and 6 short papers). For time and space restrictions, we could only accept 9 full papers and 15 short papers (most of which were originally submitted as full papers). For the first time, the workshop received the support of the PASCAL Network of Excellence that sponsored the invited talk and the best paper award. We most sincerely thank the PASCAL network for this sponsoring; the program committee and additional reviewers for their reviews; as well as the authors for their high quality submissions.</dcterms:abstract>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5412/1/MLG2006_Proceedings.pdf"/>
    <dc:creator>Gärtner, Thomas</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dc:contributor>Gärtner, Thomas</dc:contributor>
    <dc:creator>Meinl, Thorsten</dc:creator>
    <dcterms:title>MLG 2006: Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006</dcterms:title>
    <dc:contributor>Meinl, Thorsten</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5412"/>
    <dc:contributor>Garriga, Gemma C.</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Garriga, Gemma C.</dc:creator>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dc:language>eng</dc:language>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5412/1/MLG2006_Proceedings.pdf"/>
    <dcterms:issued>2006</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:09Z</dcterms:available>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:09Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja