Automatic Taxonomy Extraction from Bipartite Graphs

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KOTTER, Tobias, Stephan GUNNEMANN, Michael R. BERTHOLD, Christos FALOUTSOS, 2015. Automatic Taxonomy Extraction from Bipartite Graphs. 15th IEEE International Conference on Data Mining (ICDM 2015). Atlantic City, NJ, USA, Nov 14, 2015 - Nov 17, 2015. In: AGGARWAL, Charu, ed. and others. 15th IEEE International Conference on Data Mining : ICDM 2015 : Proceedings : 14–17 November 2015, Atlantic City, New Jersey. Los Alamitos, California:IEEE, pp. 221-230. ISBN 978-1-4673-9503-8. Available under: doi: 10.1109/ICDM.2015.24

@inproceedings{Kotter2015-11Autom-33506, title={Automatic Taxonomy Extraction from Bipartite Graphs}, year={2015}, doi={10.1109/ICDM.2015.24}, isbn={978-1-4673-9503-8}, address={Los Alamitos, California}, publisher={IEEE}, booktitle={15th IEEE International Conference on Data Mining : ICDM 2015 : Proceedings : 14–17 November 2015, Atlantic City, New Jersey}, pages={221--230}, editor={Aggarwal, Charu}, author={Kotter, Tobias and Gunnemann, Stephan and Berthold, Michael R. and Faloutsos, Christos} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:contributor>Berthold, Michael R.</dc:contributor> <dc:date rdf:datatype="">2016-03-30T13:10:33Z</dc:date> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Gunnemann, Stephan</dc:creator> <dc:contributor>Faloutsos, Christos</dc:contributor> <dcterms:abstract xml:lang="eng">Given a large bipartite graph that represents objects and their properties, how can we automatically extract semantic information that provides an overview of the data and -- at the same time -- enables us to drill down to specific parts for an in-depth analysis? In this work, we propose extracting a taxonomy that models the relation between the properties via an is a hierarchy. The extracted taxonomy arranges the properties from general to specific providing different levels of abstraction. Our proposed method has the following desirable properties: (a) it requires no user-defined parameters, by exploiting the principle of minimum description length, (b) it is effective, by utilizing the inheritance of objects when representing the hierarchy, and (c) it is scalable, being linear in the number of edges. We demonstrate the effectiveness and scalability of our method on a broad spectrum of real, publicly available graphs from drug-property graphs to social networks with up to 22 million vertices and 286 million edges.</dcterms:abstract> <dcterms:available rdf:datatype="">2016-03-30T13:10:33Z</dcterms:available> <dcterms:title>Automatic Taxonomy Extraction from Bipartite Graphs</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Berthold, Michael R.</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Kotter, Tobias</dc:contributor> <dc:creator>Faloutsos, Christos</dc:creator> <dcterms:issued>2015-11</dcterms:issued> <bibo:uri rdf:resource=""/> <dc:contributor>Gunnemann, Stephan</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:language>eng</dc:language> <dc:creator>Kotter, Tobias</dc:creator> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account