z-logo
open-access-imgOpen Access
Hierarchical Semi-Supervised Factorization for Learning the Semantics
Author(s) -
Bin Shen,
Olzhas Makhambetov
Publication year - 2014
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2014.p0366
Subject(s) - computer science , artificial intelligence , semantics (computer science) , semi supervised learning , unsupervised learning , machine learning , supervised learning , probabilistic latent semantic analysis , probabilistic logic , labeled data , non negative matrix factorization , natural language processing , matrix decomposition , artificial neural network , programming language , eigenvalues and eigenvectors , physics , quantum mechanics
Most semi-supervised learning methods are based on extending existing supervised or unsupervised techniques by incorporating additional information from unlabeled or labeled data. Unlabeled instances help in learning statistical models that fully describe the global property of our data, whereas labeled instances make learned knowledge more human-interpretable. In this paper we present a novel way of extending conventional non-negativematrix factorization (NMF) and probabilistic latent semantic analysis (pLSA) to semi-supervised versions by incorporating label information for learning semantics. The proposed algorithm consists of two steps, first acquiring prior bases representing some classes from labeled data and second utilizing them to guide the learning of final bases that are semantically interpretable.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom