Optimal Kullback-Leibler Aggregation via Information Bottleneck

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

GEIGER, Bernhard C., Tatjana PETROV, Gernot KUBIN, Heinz KOEPPL, 2015. Optimal Kullback-Leibler Aggregation via Information Bottleneck. In: IEEE Transactions on Automatic Control. 60(4), pp. 1010-1022. ISSN 0018-9286. eISSN 1558-2523. Available under: doi: 10.1109/TAC.2014.2364971

@article{Geiger2015Optim-42134, title={Optimal Kullback-Leibler Aggregation via Information Bottleneck}, year={2015}, doi={10.1109/TAC.2014.2364971}, number={4}, volume={60}, issn={0018-9286}, journal={IEEE Transactions on Automatic Control}, pages={1010--1022}, author={Geiger, Bernhard C. and Petrov, Tatjana and Kubin, Gernot and Koeppl, Heinz} }

<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/rdf/resource/123456789/42134"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:abstract xml:lang="eng">In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost; The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a sub-optimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions.</dcterms:abstract> <dc:creator>Koeppl, Heinz</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T11:35:43Z</dc:date> <dc:contributor>Koeppl, Heinz</dc:contributor> <dcterms:issued>2015</dcterms:issued> <dcterms:title>Optimal Kullback-Leibler Aggregation via Information Bottleneck</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42134"/> <dc:creator>Geiger, Bernhard C.</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-23T11:35:43Z</dcterms:available> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Kubin, Gernot</dc:creator> <dc:contributor>Petrov, Tatjana</dc:contributor> <dc:contributor>Kubin, Gernot</dc:contributor> <dc:creator>Petrov, Tatjana</dc:creator> <dc:contributor>Geiger, Bernhard C.</dc:contributor> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto