|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Liang Zhang, Chaoran Li, Yanfei Xu, Baile Shi, "An Efficient Solution to Factor Drifting Problem in the pLSA Model," Computer and Information Technology, International Conference on, pp. 175-181, Fifth International Conference on Computer and Information Technology (CIT'05), 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/CIT.2005.70, author = {Liang Zhang and Chaoran Li and Yanfei Xu and Baile Shi}, title = {An Efficient Solution to Factor Drifting Problem in the pLSA Model}, journal ={Computer and Information Technology, International Conference on}, volume = {0}, year = {2005}, isbn = {0-7695-2432-X}, pages = {175-181}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2005.70}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computer and Information Technology, International Conference on TI - An Efficient Solution to Factor Drifting Problem in the pLSA Model SN - 0-7695-2432-X SP175 EP181 A1 - Liang Zhang, A1 - Chaoran Li, A1 - Yanfei Xu, A1 - Baile Shi, PY - 2005 KW - null VL - 0 JA - Computer and Information Technology, International Conference on ER - | |||
Probabilistic Latent Semantic Analysis (pLSA) is a powerful statistical technique to analyze relation between factors in dyadic data Although various pLSA-based applications, ranging from information retrieval, information filtering, to text-mining and visualization, have been successfully conducted, they can not afford dynamic revising of model when one of the factors changes constantly. In this paper, we take the advantage of decoupling ability of pLSA thoroughly, and propose a more elegant approach based on maximum likelihood estimation to gain an incremental learning with the drift of a factor. We demonstrate our method in the context of collaborative filtering where single user interests change fast, but the community interests remain almost constant. Experiments against the MovieLens and EachMovie data sets reveal that the proposed method improves the recommending accuracy 10% further beyond the original pLSA at a less computation cost.
