English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Supervised Probabilistic Principal Component Analysis

Yu, S., Yu, K., Tresp, V., Kriegel, H.-P., & Wu, M. (2006). Supervised Probabilistic Principal Component Analysis. In T. Eliassi-Rad, L. Ungar, M. Craven, & D. Gunopulos (Eds.), KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 464-473). New York, NY, USA: ACM Press.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-D099-1 Version Permalink: https://hdl.handle.net/21.11116/0000-0004-9A2E-C
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://dl.acm.org/citation.cfm?doid=1150402.1150454 (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Yu, S, Author
Yu , K, Author
Tresp, V, Author
Kriegel, H-P, Author
Wu, M1, 2, Author           
Ungar, L, Editor
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: Principal component analysis (PCA) has been extensively applied in data mining, pattern recognition and information retrieval for unsupervised dimensionality reduction. When labels of data are available, e.g., in a classification or regression task, PCA is however not able to use this information. The problem is more interesting if only part of the input data are labeled, i.e., in a semi-supervised setting. In this paper we propose a supervised PCA model called SPPCA and a semi-supervised PCA model called S2PPCA, both of which are extensions of a probabilistic PCA model. The proposed models are able to incorporate the label information into the projection phase, and can naturally handle multiple outputs (i.e., in multi-task learning problems). We derive an efficient EM learning algorithm for both models, and also provide theoretical justifications of the model behaviors. SPPCA and S2PPCA are compared with other supervised projection methods on various learning tasks, and show not only promising performance but also good scalability.

Details

show
hide
Language(s):
 Dates: 2006-08
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/1150402.1150454
BibTex Citekey: 4069
 Degree: -

Event

show
hide
Title: 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Place of Event: Philadelphia, PA, USA
Start-/End Date: 2006-08-20 - 2006-08-23

Legal Case

show

Project information

show

Source 1

show
hide
Title: KDD '06: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Source Genre: Proceedings
 Creator(s):
Eliassi-Rad, T, Editor
Ungar, L, Editor
Craven, M, Editor
Gunopulos, D, Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 464 - 473 Identifier: ISBN: 1-59593-339-5