Skip to main content
Erschienen in: Knowledge and Information Systems 1/2018

28.10.2017 | Regular Paper

A heterogeneous hidden Markov model for mobile app recommendation

verfasst von: Victor C. Cheng, Li Chen, William K. Cheung, Chi-kuen Fok

Erschienen in: Knowledge and Information Systems | Ausgabe 1/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recent proliferation of ubiquitous smart phones has led to the emergence of a wide variety of apps. Selecting apps through keyword search or recommendations from friends or social networks (e.g., Facebook) may not match the real preferences of users, especially when the need is just-in-time and context specific. Although there are many collaborative filtering approaches that are capable of generating time-aware recommendations, most of them work on modeling of the time stamps (the time that events happen) rather than modeling of the sequential patterns (in cases that time stamps are not available) as well as investigating the factors behind those patterns. In this paper, we propose a mechanism for modeling three important factors governing the app installation of smart phone users: (1) short-term context, (2) co-installation pattern, and (3) random choice. Specifically, we use a hidden Markov model equipped with heterogeneous emission distributions to incorporate these factors. Apps being installed are probabilistically categorized into one of these factors, and app recommendations for users are carried out accordingly. This coherent model can be inferred effectively by using Gibbs sampling. The formulation has a significant advantage that the performance is less sensitive to data sparsity and incompleteness. Empirical results show that it has higher performance in recommending mobile apps to smart phone users, measured in terms of precision and area under the ROC curve (AUC). Besides, the proposed model allows the nature of the apps, with respect to the three factors, to be revealed as well as the extent to which each user is affected by the three factors to be inferred, providing additional insights on the users’ behavior.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Fußnoten
1
The hidden state for marking sequence boundaries serves as the initial state and the termination state for the HMM.
 
2
For this app installation data set, we found that the time-weighted user-based CF has poorer performance than the user-based CF in most cases whenever the decay factor is greater than zero. Nevertheless, for the sake of comparison and illustration, we set it to 0.1.
 
3
For the time-weighted user-based CF, the weight decay factor is multiplied to the rates.
 
4
For the case where the last rating batch of a user contains less than 5 movies, we move also the immediate preceding batch to the test data set.
 
5
The number of movies used in building MTM is much higher than that for mobile app recommendation. It is because the users rated the movies in batch and the order of rating the movies within a batch does not necessarily follow the order of exploring the movies. Thus, the range of dependence among movies in the sequence is much longer.
 
Literatur
1.
Zurück zum Zitat Agrawal R, Imieliński T, Swami A (1993) Mining association rules betweens sets of items in large databases In: Proceedings of 1993 ACM SIGMOD international conference on management of data, pp 207–216 Agrawal R, Imieliński T, Swami A (1993) Mining association rules betweens sets of items in large databases In: Proceedings of 1993 ACM SIGMOD international conference on management of data, pp 207–216
2.
Zurück zum Zitat Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases, pp 487–499 Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases, pp 487–499
4.
Zurück zum Zitat Bao J, Zheng Y, Mokbel M (2012) Location-based and preference-aware recommendation using sparse geo-social networking data In: Proceedings of 20th ACM SIGSPATIAL, pp 199–208 Bao J, Zheng Y, Mokbel M (2012) Location-based and preference-aware recommendation using sparse geo-social networking data In: Proceedings of 20th ACM SIGSPATIAL, pp 199–208
5.
Zurück zum Zitat Beal MJ (2003) Variational algorithms for approximate Bayesian inference, Ph.D. thesis, Gatsby Computational Neuroscience Unit, University College London Beal MJ (2003) Variational algorithms for approximate Bayesian inference, Ph.D. thesis, Gatsby Computational Neuroscience Unit, University College London
6.
Zurück zum Zitat Blei D (2011) Introduction to probabilistic topic models. Commun ACM 44(4):77–84CrossRef Blei D (2011) Introduction to probabilistic topic models. Commun ACM 44(4):77–84CrossRef
7.
Zurück zum Zitat Blei D, Ng A, Jordan M (2003) Latent Dirichlet allocation. J Mach Learn Res 3:993–1022MATH Blei D, Ng A, Jordan M (2003) Latent Dirichlet allocation. J Mach Learn Res 3:993–1022MATH
8.
Zurück zum Zitat Burke R (2000) Knowledge-based recommender systems. Encycl Libr Inf Syst 69(32):180 Burke R (2000) Knowledge-based recommender systems. Encycl Libr Inf Syst 69(32):180
9.
Zurück zum Zitat Burke R, Claypool M, Gokhale A, Miranda T, Murnikov P, Netes D (1999) Integrating knowledge-based and collaborative-filtering recommender systems. In: Proceedings of AAAI Workshop on AI and electronic commerce, pp 577–584 Burke R, Claypool M, Gokhale A, Miranda T, Murnikov P, Netes D (1999) Integrating knowledge-based and collaborative-filtering recommender systems. In: Proceedings of AAAI Workshop on AI and electronic commerce, pp 577–584
10.
Zurück zum Zitat Cremonesi P, Garza P, Quintarelli E, Turrin R (2011) Top-n recommendations on unpopular items with contextual knowledge. Workshop on Context-aware Recommender Systems, Chicago Cremonesi P, Garza P, Quintarelli E, Turrin R (2011) Top-n recommendations on unpopular items with contextual knowledge. Workshop on Context-aware Recommender Systems, Chicago
11.
Zurück zum Zitat Ding Y, Li X (2005) Time weighted collaborative filtering. In: Proceedings of 14th ACM international conference on information and knowledge management, pp 485–492 Ding Y, Li X (2005) Time weighted collaborative filtering. In: Proceedings of 14th ACM international conference on information and knowledge management, pp 485–492
12.
Zurück zum Zitat Fosler-Lussier E (1998) Markov models and hidden Markov models: a brief tutorial. International Computer Science Institute, Berkeley Fosler-Lussier E (1998) Markov models and hidden Markov models: a brief tutorial. International Computer Science Institute, Berkeley
13.
Zurück zum Zitat Gilks WR (1999) Markov chain Monte Carlo in practice. CRC Press, Boca Raton Gilks WR (1999) Markov chain Monte Carlo in practice. CRC Press, Boca Raton
15.
Zurück zum Zitat Griffiths L, Steyvers M, Blei D, Tenenbaum J (2005) Integrating topics and syntax. In: Saul LK, Weiss Y, Bottou L (eds) Advances in neural information processing systems, vol 17. MIT Press, Cambridge, pp 537–544 Griffiths L, Steyvers M, Blei D, Tenenbaum J (2005) Integrating topics and syntax. In: Saul LK, Weiss Y, Bottou L (eds) Advances in neural information processing systems, vol 17. MIT Press, Cambridge, pp 537–544
16.
Zurück zum Zitat Griffiths TL, Steyvers M (2004) Finding scientific topics. Proc Natl Acad Sci 101(Suppl. 1):5228–5235CrossRef Griffiths TL, Steyvers M (2004) Finding scientific topics. Proc Natl Acad Sci 101(Suppl. 1):5228–5235CrossRef
17.
Zurück zum Zitat Liu JS (2001) Monte Carlo strategies in scientific computing. Springer, BerlinMATH Liu JS (2001) Monte Carlo strategies in scientific computing. Springer, BerlinMATH
18.
Zurück zum Zitat Liu NN, Zhao M, Xiang E, Yang Q (2010) Online evolutionary collaborative filtering. In: Proceedings of 4th ACM Conference on recommender systems, pp 95–102 Liu NN, Zhao M, Xiang E, Yang Q (2010) Online evolutionary collaborative filtering. In: Proceedings of 4th ACM Conference on recommender systems, pp 95–102
19.
Zurück zum Zitat Marlin B (2004) Modeling user rating profiles for collaborative filtering. Advances in neural information processing systems, vol 15. MIT Press, Cambridge, pp 627–634 Marlin B (2004) Modeling user rating profiles for collaborative filtering. Advances in neural information processing systems, vol 15. MIT Press, Cambridge, pp 627–634
20.
Zurück zum Zitat Natarajan N, Shin D, Dhillon I (2013) Which app will you use next? Collaborative filtering with interactional context. In: Proceedings of 7th ACM conference on recommender systems, pp 201–208 Natarajan N, Shin D, Dhillon I (2013) Which app will you use next? Collaborative filtering with interactional context. In: Proceedings of 7th ACM conference on recommender systems, pp 201–208
21.
Zurück zum Zitat Rabiner LR, Juang BH (1986) An introduction to hidden Markov models. IEEE ASSP Mag 3(1):4–16CrossRef Rabiner LR, Juang BH (1986) An introduction to hidden Markov models. IEEE ASSP Mag 3(1):4–16CrossRef
22.
Zurück zum Zitat Ross SM (2006) Introduction to probability models. Academic Press, Inc., CambridgeMATH Ross SM (2006) Introduction to probability models. Academic Press, Inc., CambridgeMATH
23.
Zurück zum Zitat Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:1–19CrossRef Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell 2009:1–19CrossRef
24.
Zurück zum Zitat Wang C, Blei D (2011) Collaborative topic modeling for recommending scientific articles. In: Proceedings of 17th ACM SIGKDD international conference on KDD, pp 448–456 Wang C, Blei D (2011) Collaborative topic modeling for recommending scientific articles. In: Proceedings of 17th ACM SIGKDD international conference on KDD, pp 448–456
26.
Zurück zum Zitat Woerndl W, Schueller C, Wojtech R (2007) A hybrid recommender system for context-aware recommendations of mobile applications. In: Proceedings of IEEE 23rd international conference on data engineering workshop, pp 871–878 Woerndl W, Schueller C, Wojtech R (2007) A hybrid recommender system for context-aware recommendations of mobile applications. In: Proceedings of IEEE 23rd international conference on data engineering workshop, pp 871–878
27.
Zurück zum Zitat Yin H, Cui B, Li J, Yao J, Chen C (2012) Challenging the long tail recommendation. Proc. VLDB Endow. 5(9):896–907CrossRef Yin H, Cui B, Li J, Yao J, Chen C (2012) Challenging the long tail recommendation. Proc. VLDB Endow. 5(9):896–907CrossRef
28.
Zurück zum Zitat Zhou N, Cheung W, Qiu G, Xue X (2011) A hybrid probabilistic model for unified collaborative and content-based image tagging. IEEE Trans. PAMI 33(7):1281–1294CrossRef Zhou N, Cheung W, Qiu G, Xue X (2011) A hybrid probabilistic model for unified collaborative and content-based image tagging. IEEE Trans. PAMI 33(7):1281–1294CrossRef
29.
Zurück zum Zitat Zhu H, Xiong H, Ge Y, Chen E (2014) Mobile app recommendations with security and privacy awareness. In: Proceedings of 20th ACM SIGKDD international conference on KDD, pp 951–960 Zhu H, Xiong H, Ge Y, Chen E (2014) Mobile app recommendations with security and privacy awareness. In: Proceedings of 20th ACM SIGKDD international conference on KDD, pp 951–960
Metadaten
Titel
A heterogeneous hidden Markov model for mobile app recommendation
verfasst von
Victor C. Cheng
Li Chen
William K. Cheung
Chi-kuen Fok
Publikationsdatum
28.10.2017
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 1/2018
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-017-1124-3

Weitere Artikel der Ausgabe 1/2018

Knowledge and Information Systems 1/2018 Zur Ausgabe