Clustering with the fisher score

Koji Tsuda, Motoaki Kawanabe, Klaus Muller

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

12 Citations (Scopus)

Abstract

Recently the Fisher score (or the Fisher kernel) is increasingly used as a feature extractor for classification problems. The Fisher score is a vector of parameter derivatives of loglikelihood of a probabilistic model. This paper gives a theoretical analysis about how class information is preserved in the space of the Fisher score, which turns out that the Fisher score consists of a few important dimensions with class information and many nuisance dimensions. When we perform clustering with the Fisher score, K-Means type methods are obviously inappropriate because they make use of all dimensions. So we will develop a novel but simple clustering algorithm specialized for the Fisher score, which can exploit important dimensions. This algorithm is successfully tested in experiments with artificial data and real data (amino acid sequences).

Original languageEnglish
Title of host publicationAdvances in Neural Information Processing Systems
PublisherNeural information processing systems foundation
ISBN (Print)0262025507, 9780262025508
Publication statusPublished - 2003 Jan 1
Externally publishedYes
Event16th Annual Neural Information Processing Systems Conference, NIPS 2002 - Vancouver, BC, Canada
Duration: 2002 Dec 92002 Dec 14

Other

Other16th Annual Neural Information Processing Systems Conference, NIPS 2002
CountryCanada
CityVancouver, BC
Period02/12/902/12/14

Fingerprint

Clustering algorithms
Amino acids
Derivatives
Experiments
Statistical Models

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Tsuda, K., Kawanabe, M., & Muller, K. (2003). Clustering with the fisher score. In Advances in Neural Information Processing Systems Neural information processing systems foundation.

Clustering with the fisher score. / Tsuda, Koji; Kawanabe, Motoaki; Muller, Klaus.

Advances in Neural Information Processing Systems. Neural information processing systems foundation, 2003.

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

Tsuda, K, Kawanabe, M & Muller, K 2003, Clustering with the fisher score. in Advances in Neural Information Processing Systems. Neural information processing systems foundation, 16th Annual Neural Information Processing Systems Conference, NIPS 2002, Vancouver, BC, Canada, 02/12/9.
Tsuda K, Kawanabe M, Muller K. Clustering with the fisher score. In Advances in Neural Information Processing Systems. Neural information processing systems foundation. 2003
Tsuda, Koji ; Kawanabe, Motoaki ; Muller, Klaus. / Clustering with the fisher score. Advances in Neural Information Processing Systems. Neural information processing systems foundation, 2003.
@inproceedings{4000ecd13b344dd6b8c022cf3ad98703,
title = "Clustering with the fisher score",
abstract = "Recently the Fisher score (or the Fisher kernel) is increasingly used as a feature extractor for classification problems. The Fisher score is a vector of parameter derivatives of loglikelihood of a probabilistic model. This paper gives a theoretical analysis about how class information is preserved in the space of the Fisher score, which turns out that the Fisher score consists of a few important dimensions with class information and many nuisance dimensions. When we perform clustering with the Fisher score, K-Means type methods are obviously inappropriate because they make use of all dimensions. So we will develop a novel but simple clustering algorithm specialized for the Fisher score, which can exploit important dimensions. This algorithm is successfully tested in experiments with artificial data and real data (amino acid sequences).",
author = "Koji Tsuda and Motoaki Kawanabe and Klaus Muller",
year = "2003",
month = "1",
day = "1",
language = "English",
isbn = "0262025507",
booktitle = "Advances in Neural Information Processing Systems",
publisher = "Neural information processing systems foundation",

}

TY - GEN

T1 - Clustering with the fisher score

AU - Tsuda, Koji

AU - Kawanabe, Motoaki

AU - Muller, Klaus

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Recently the Fisher score (or the Fisher kernel) is increasingly used as a feature extractor for classification problems. The Fisher score is a vector of parameter derivatives of loglikelihood of a probabilistic model. This paper gives a theoretical analysis about how class information is preserved in the space of the Fisher score, which turns out that the Fisher score consists of a few important dimensions with class information and many nuisance dimensions. When we perform clustering with the Fisher score, K-Means type methods are obviously inappropriate because they make use of all dimensions. So we will develop a novel but simple clustering algorithm specialized for the Fisher score, which can exploit important dimensions. This algorithm is successfully tested in experiments with artificial data and real data (amino acid sequences).

AB - Recently the Fisher score (or the Fisher kernel) is increasingly used as a feature extractor for classification problems. The Fisher score is a vector of parameter derivatives of loglikelihood of a probabilistic model. This paper gives a theoretical analysis about how class information is preserved in the space of the Fisher score, which turns out that the Fisher score consists of a few important dimensions with class information and many nuisance dimensions. When we perform clustering with the Fisher score, K-Means type methods are obviously inappropriate because they make use of all dimensions. So we will develop a novel but simple clustering algorithm specialized for the Fisher score, which can exploit important dimensions. This algorithm is successfully tested in experiments with artificial data and real data (amino acid sequences).

UR - http://www.scopus.com/inward/record.url?scp=84898958024&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84898958024&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0262025507

SN - 9780262025508

BT - Advances in Neural Information Processing Systems

PB - Neural information processing systems foundation

ER -