Graph Based Relational Features for Collective Classification

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

BAYER, Immanuel, Uwe NAGEL, Steffen RENDLE, 2015. Graph Based Relational Features for Collective Classification. 19th Pacific-Asia Conference, PAKDD 2015. Ho Chi Minh City, Vietnam, 19. Mai 2015 - 22. Mai 2015. In: CAO, Tru, ed. and others. Advances in Knowledge Discovery and Data Mining, 19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015; Proceedings, Part II. 19th Pacific-Asia Conference, PAKDD 2015. Ho Chi Minh City, Vietnam, 19. Mai 2015 - 22. Mai 2015. Cham:Springer, pp. 447-458. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-18031-1

@inproceedings{Bayer2015-05-09Graph-39725, title={Graph Based Relational Features for Collective Classification}, year={2015}, doi={10.1007/978-3-319-18032-8_35}, number={9078}, isbn={978-3-319-18031-1}, issn={0302-9743}, address={Cham}, publisher={Springer}, series={Lecture Notes in Artificial Intelligence}, booktitle={Advances in Knowledge Discovery and Data Mining, 19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015; Proceedings, Part II}, pages={447--458}, editor={Cao, Tru}, author={Bayer, Immanuel and Nagel, Uwe and Rendle, Steffen} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/39725"> <dcterms:abstract xml:lang="eng">Statistical Relational Learning (SRL) methods have shown that classification accuracy can be improved by integrating relations between samples. Techniques such as iterative classification or relaxation labeling achieve this by propagating information between related samples during the inference process. When only a few samples are labeled and connections between samples are sparse, collective inference methods have shown large improvements over standard feature-based ML methods. However, in contrast to feature based ML, collective inference methods require complex inference procedures and often depend on the strong assumption of label consistency among related samples. In this paper, we introduce new relational features for standard ML methods by extracting information from direct and indirect relations. We show empirically on three standard benchmark datasets that our relational features yield results comparable to collective inference methods. Finally we show that our proposal outperforms these methods when additional information is available.</dcterms:abstract> <dcterms:issued>2015-05-09</dcterms:issued> <dcterms:title>Graph Based Relational Features for Collective Classification</dcterms:title> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39725"/> <dc:creator>Nagel, Uwe</dc:creator> <dc:language>eng</dc:language> <dc:contributor>Bayer, Immanuel</dc:contributor> <dc:creator>Bayer, Immanuel</dc:creator> <dc:contributor>Rendle, Steffen</dc:contributor> <dc:creator>Rendle, Steffen</dc:creator> <dc:contributor>Nagel, Uwe</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-02T08:45:12Z</dcterms:available> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-02T08:45:12Z</dc:date> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto