Kernel Measures of Independence for non-iid Data

Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this criterion to deal with structured and interdependent observations. This is achieved by modeling the structures using undirected graphical models and comparing the Hilbert space embeddings of distributions. We apply this new criterion to independent component analysis and sequence clustering.

• Type: Conference
• Year: 2008
• Where: NIPS
• Authors: Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smola
• Keywords: Hilbert Space Embeddings, Information Technology, Machine Learning Algorithms, NIPS 2008, Schmidt Independence Criterion