loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Madhusudana Shashanka and Michael Giering

Affiliation: United Technologies Research Center, United States

Keyword(s): Matrix factorization, Probabilistic Latent Semantic Analysis (PLSA), Nonnegative Matrix Factorization (NMF), Singular Values Decomposition (SVD), Principal Components Analysis (PCA).

Related Ontology Subjects/Areas/Topics: Feature Selection and Extraction ; Matrix Factorization ; Pattern Recognition ; Theory and Methods

Abstract: Probabilistic Latent Semantic Analysis (PLSA) is a popular technique to analyze non-negative data where multinomial distributions underlying every data vector are expressed as linear combinations of a set of basis distributions. These learned basis distributions that characterize the dataset lie on the standard simplex and themselves represent corners of a simplex within which all data approximations lie. In this paper, we describe a novel method to extend the PLSA decomposition where the bases are not constrained to lie on the standard simplex and thus are better able to characterize the data. The locations of PLSA basis distributions on the standard simplex depend on how the dataset is aligned with respect to the standard simplex. If the directions of maximum variance of the dataset are orthogonal to the standard simplex, then the PLSA bases will give a poor representation of the dataset. Our approach overcomes this drawback by utilizing Singular Values Decomposition (SVD) to ident ify the directions of maximum variance, and transforming the dataset to align these directions parallel to the standard simplex before performing PLSA. The learned PLSA features are then transformed back into the data space. The effectiveness of the proposed approach is demonstrated with experiments on synthetic data. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.118.200.86

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Shashanka, M. and Giering, M. (2012). SIMPLEX DECOMPOSITIONS USING SVD AND PLSA. In Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM; ISBN 978-989-8425-98-0; ISSN 2184-4313, SciTePress, pages 248-252. DOI: 10.5220/0003797802480252

@conference{icpram12,
author={Madhusudana Shashanka. and Michael Giering.},
title={SIMPLEX DECOMPOSITIONS USING SVD AND PLSA},
booktitle={Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM},
year={2012},
pages={248-252},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003797802480252},
isbn={978-989-8425-98-0},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM
TI - SIMPLEX DECOMPOSITIONS USING SVD AND PLSA
SN - 978-989-8425-98-0
IS - 2184-4313
AU - Shashanka, M.
AU - Giering, M.
PY - 2012
SP - 248
EP - 252
DO - 10.5220/0003797802480252
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic