Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation

S. Liu, J.A. Quinn, M.U. Gutmann, M. Sugiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose a new method for detecting changes in Markov network structure between two sets of samples. Instead of naively fitting two Markov network models separately to the two data sets and figuring out their difference, we directly learn the network structure change by estimating the ratio of Markov network models. This density-ratio formulation naturally allows us to introduce sparsity in the network structure change, which highly contributes to enhancing interpretability. Furthermore, computation of the normalization term, which is a critical computational bottleneck of the naive approach, can be remarkably mitigated.
Through experiments on gene expression and Twitter data analysis, we demonstrate the usefulness of our method.
Original languageEnglish
Title of host publicationMachine Learning and Knowledge Discovery in Databases
Subtitle of host publicationEuropean Conference, ECML PKDD 2013, Prague, Czech Republic, September 23-27, 2013, Proceedings, Part II
PublisherSpringer Berlin Heidelberg
Pages596-611
Number of pages16
ISBN (Electronic)978-3-642-40991-2
ISBN (Print)978-3-642-40990-5
DOIs
Publication statusPublished - Sep 2013

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume8189
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation'. Together they form a unique fingerprint.

Cite this