Preview

Social Influence Modeling on Smartphone Usage

Best Essays
Open Document
Open Document
3900 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Social Influence Modeling on Smartphone Usage
Social Influence Modeling on Smartphone Usage
Masaji Katagiri1,2 and Minoru Etoh1,3
1 R&D Center, NTT DOCOMO, Inc. Yokosuka, Kanagawa, 239-8536 Japan katagirim@nttdocomo.co.jp, etoh@ieee.org Graduate School of Information Science and Technologies, Osaka University Suita, Osaka, 565-0871 Japan 3 Cybermedia Center, Osaka University Toyonaka, Osaka, 560-0043 Japan

2

Abstract. This paper presents a probabilistic influence model for smartphone usage; it applies a latent group model to social influence. The probabilistic model is built on the assumption that a time series of students’ application downloads and activations can be represented by individual inter-personal influence factors which consist of latent groups. To verify that model with its assumption, about 160 university students voluntarily participated in a mobile application usage monitoring experiment. Analysis could identify latent user groups by observing predictive performance against reduced dimensions of factor matrices with NMF. Proper dimension reduction is shown to significantly improve predictive performance, which implies a reduction in the over-fitting phenomenon. With this improvement, the model outperforms conventional collaborative filtering models and popularity models in perplexity evaluation. The results validate the model and its assumption as well as its usefulness. Keywords: user influence, mobile application, recommendation, behavior prediction, latent structure analysis, matrix factorization, NMF.

1

Introduction

Smartphones are becoming popular devices that can replace traditional cellular phones globally. One of their features is that various applications are available through the public network. In the case of Android phones, there is the “Android Market” site where people can find and download applications. Since the sheer number of applications makes it difficult for users to find the appropriate software, it is crucial to provide an appropriate search function and/or recommendation system



References: 1. Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering 17, 734–749 (2005) 302 M. Katagiri and M. Etoh 2. Badea, L.: Extracting gene expression profiles common to colon and pancreatic adenocarcinoma using simultaneous nonnegative matrix factorization. In: Altman, R.B., Dunker, A.K., Hunter, L., Murray, T., Klein, T.E. (eds.) Pacific Symposium on Biocomputing, pp. 267–278. World Scientific (2008) 3. Brunet, J.P., Tamayo, P., Golub, T.R., Mesirov, J.P.: Metagenes and molecular pattern discovery using matrix factorization. PNAS 101(12), 4164–4169 (2004) 4. Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. Journal of the American Society for Information Science 41(6), 391–407 (1990) 5. Furui, S.: Speech and speaker recognition evaluation. In: Dybkjœr, L., Hemsen, H., Minker, W., Ide, N. (eds.) Evaluation of Text and Speech Systems, Text, Speech and Language Technology, vol. 37, pp. 1–27. Springer, Netherlands (2007) 6. Gaujoux, R., Seoighe, C.: A flexible R package for nonnegative matrix factorization. BMC bioinformatics 11(1), 367+ (2010) 7. Goldenberg, J., Libai, B., Muller, E.: Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth. In: Marketing Letters, pp. 211–223 (August 2001) 8. Goyal, A., Bonchi, F., Lakshmanan, L.V.: Learning influence probabilities in social networks. In: Proceedings of the Third ACM International Conference on Web Search and Data Mining, WSDM 2010, pp. 241–250. ACM, New York (2010) 9. Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blogspace. In: Proceedings of the 13th International Conference on World Wide Web, WWW 2004, pp. 491–501. ACM, New York (2004) 10. Hofmann, T.: Probabilistic latent semantic indexing. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1999, pp. 50–57. ACM, New York (1999) 11. Kawamae, N., Sakano, H., Yamada, T.: Personalized recommendation based on the personal innovator degree. In: Proceedings of the Third ACM Conference on Recommender Systems, RecSys 2009, pp. 329–332. ACM, New York (2009) 12. Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137–146. ACM, New York (2003) 13. Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating nonnegativity-constrained least squares for microarray data analysis. Bioinformatics 23(12), 1495–1502 (2007) 14. Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: Proceedings of the 22nd National Conference on Artificial Intelligence, AAAI 2007, vol. 2, pp. 1371–1376. AAAI Press, Vancouver (2007) 15. Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(9), 30–37 (2009) 16. Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788–791 (1999) 17. Lee, D.D., Seung, H.S.: Algorithms for Non-negative Matrix Factorization. In: Leen, T.K., Dietterich, T.G., Tresp, V. (eds.) Advances in Neural Information Processing Systems, vol. 13, pp. 556–562. MIT Press, Cambridge (2001) 18. Pascual-Montano, A., Carazo, J., Kochi, K., Lehmann, D., Pascual-Marqui, R.D.: Nonsmooth nonnegative matrix factorization (nsnmf). IEEE Transactions on Pattern Analysis and Machine Intelligence 28, 403–415 (2006) Social Influence Modeling on Smartphone Usage 303 19. R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2008) 20. Song, X., Tseng, B.L., Lin, C.Y., Sun, M.T.: Personalized recommendation driven by information flow. In: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2006, pp. 509–516. ACM, New York (2006) 21. Zhang, J., Wei, L., Feng, X., Ma, Z., Wang, Y.: Pattern expression nonnegative matrix factorization: Algorithm and applications to blind source separation. Computational Intelligence and Neuroscience 2008 (2008)

You May Also Find These Documents Helpful

  • Best Essays

    INFS1602 Assignment A

    • 3808 Words
    • 16 Pages

    16. X Ning, H. J. (2008). RSS: A Framwork Enabling Ranked Research on the Semantic Web. Information Processing and Management .…

    • 3808 Words
    • 16 Pages
    Best Essays
  • Good Essays

    Nt1310 Unit 3 Study Essay

    • 3921 Words
    • 16 Pages

    |Term-Document Matrix |A frequency matrix created from digitized and organized documents (the corpus) where the columns…

    • 3921 Words
    • 16 Pages
    Good Essays
  • Better Essays

    BUS 219 Netflix Final Paper

    • 4031 Words
    • 10 Pages

    Everybody knows, world-wide, about Netflix and that it is an online based company that a paid subscriber can go to, to watch movies, TV shows and original content produced by Netflix. A customer can either stream the media directly to their computer or handheld device or, select DVD’s to be delivered to their home. The most popular way to access Netflix is to stream media on a PC or handheld. Have you ever wondered how Netflix decides what to suggest for you to watch? What you might not know is that it’s actually an innovative algorithm that starts suggesting items for the viewer once they’ve watched something. This is so the customer doesn’t have to spend time finding something for their selves. By using that data, they build a more personalized experience for their customers.…

    • 4031 Words
    • 10 Pages
    Better Essays
  • Good Essays

    In addition, neither does LPA need optimization of the predefined objective function nor does it need priori information on numbers and scales of the community. Furthermore, there is no limit on the size of the community and the division effect is very ideal. So LPA has become one of the most widely used community discovery algorithm and it is widely used in the field of multimedia information classification [17], virtual community mining and so…

    • 480 Words
    • 2 Pages
    Good Essays
  • Good Essays

    The Filter

    • 502 Words
    • 3 Pages

    The Filter is a recommendation engine which is used in conjunction with other business’ websites for the suggesting of digital media and entertainment materials, and technological products. Its purpose is to analyze the past purchases of the consumer and use the data to suggest other materials and products that the consumer could likely be interested in, some of which the consumer otherwise would not have been exposed to. The Filter was not successful on an individual basis, but in the business to business environment, it has proven itself to be very productive. However, the challenge facing the Filter now is to realize its ultimate goal of expanding its service to other industries other than the media, entertainment, and technology.…

    • 502 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Netflix Information System

    • 1867 Words
    • 8 Pages

    One of the most important technologies that support Netflix’s customer relationship management is its custom-built intelligent agent. An intelligent agent is artificial intelligence software that helps or acts on behalf of the user to perform repetitive-computer related tasks (Haag 224). In particular, Netflix uses a buyer agent, also known as a shopping bot. A buyer agent is an intelligent agent on a website that assists the consumer in finding a product or service that he or she wants (Haag 225). Netflix’ shopping bots use two techniques in order to predict customers’ DVD preferences: collaborative filtering and adaptive filtering. Collaborative filtering is when a customer is matched with a group of users who have similar tastes. Then, the customer is presented with common selections in that group (Haag 225). Adaptive filtering is when the consumer is asked to rate a product or situation and then monitored over time (Haag 226). Ultimately, Netflix will know what the customer likes and dislikes. By using a hybrid technique, Netflix is able to give…

    • 1867 Words
    • 8 Pages
    Powerful Essays
  • Powerful Essays

    References: Choudhary, A., Harding, J., Lin, H., Tiwari, M., & Shankar, R. (2011). Knowledge Discovery…

    • 2088 Words
    • 6 Pages
    Powerful Essays
  • Satisfactory Essays

    All ages, from tech savvy to tech illiterate. People with trendy aspirations and people with fast no hassle user criteria. Social network challengers with high technological aspirations, all the way down to the grandmother that keeps in touch with her grandchild in Amsterdam using Skype with her iPad are just a few of the demographics.…

    • 636 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    The smartphone application industry is growing very fast the past 5 years, most of the people rely on their smartphone’s applications to kill time while travelling on transportation, idle moments or even at work or school. Therefore, a well-designed, interesting, interactive application can easily be popular. Also, a good application’s review is easily spread by word of mouth with the help of social network, such as Facebook and Youtube. As King.com is…

    • 996 Words
    • 4 Pages
    Better Essays
  • Powerful Essays

    Social Media Marketing

    • 8139 Words
    • 33 Pages

    Value; Social media marketing is a fairly new trend; it will be a key factor in the…

    • 8139 Words
    • 33 Pages
    Powerful Essays
  • Powerful Essays

    Marlin, B., & Zemel, R. S. (2004). The multiple multiplicative factor model for collaborative filtering.…

    • 4443 Words
    • 18 Pages
    Powerful Essays
  • Good Essays

    20 Kohavi, R., and John, G. H., 1997, “Wrappers for Feature Subset Selection,” Artif. Intell., 97 1–2 , pp. 273–324. 21 Espinosa, J., Vandewalle, J., and Wertz, V., 2005, Fuzzy Logic, Identification and Predictive Control, Springer-Verlag, London, UK. 22 http://en.wikipedia.org/wiki/Curse_of_dimensionality. 23 Bishop, C. M., 1995, Neural Networks for Pattern Recognition, Oxford University, New York. 24 Seidel, P., Seidel, A., and Herbarth, O., 2007, “Multilayer Perceptron Tumor Diagnosis Based on Chromatography Analysis of Urinary Nucleoside,” Neural Networks, 20 5 , pp. 646–651. 25 Smola, A. J., and Schoelkopf, B., 2004, “A Tutorial on Support Vector Regression,” Stat. Comput., 14 3 , pp. 199–222. 26 Cristianini, N., and Shawe-Taylor, J., 2000, An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods, Cambridge University, New York, p. 189. 27 Prasad, A. M., Iverson, L. R., and Liaw, A., 2006, “Newer Classification and Regression Tree Techniques: Bagging and Random Forests for Ecological Prediction,” Ecosystems, 9 2 , pp. 181–189. 28 Breiman, L., 2001, “Random Forest,” Mach. Learn., 45 1 , pp. 5–32. 29 Breiman, L., Friedman, J., Olshen, R. A., and Stone, C. J., 1984, Classification and Regression Trees, Wadsworth International, Monterey, CA. 30 Wang, Y., and Witten, I. H., 2002, “Modeling for Optimal Probability Prediction,” Proceedings of the 19th International Conference in Machine Learning, Sydney, Australia, pp. 650–657.…

    • 6353 Words
    • 26 Pages
    Good Essays
  • Powerful Essays

    Joeran Beel, Stefan Langer, Bela Gipp, and Andreas Nürnberger. 2014. The Architecture and Datasets of Docear’s Research Paper Recommender System. In Proceedings…

    • 6703 Words
    • 27 Pages
    Powerful Essays
  • Good Essays

    Naive Bayes

    • 7200 Words
    • 29 Pages

    Hand D.J. and Yu K. (2001) Idiot’s Bayes—not so stupid after all? International Statistical Review, 69, 385–398. Hastie T.J. and Tibshirani R.J. (1990) Generalized Additive Models. London: Chapman and Hall. Jamain A. and Hand D.J. (2005) The na¨ve Bayes mystery: A statistical detective ı story. Pattern Recognition Letters, 26, 1752–1760. Jamain A. and Hand D.J. (2008) Mining supervised classification performance studies: A meta-analytic investigation. Journal of Classification, 25, 87–112. Langley P. (1993) Induction of recursive Bayesian classifiers. Proceedings of the Eighth European Conference on Machine Learning, Vienna, Austria: SpringerVerlag, 153–164. Mani S., Pazzani M.J., and West J. (1997) Knowledge discovery from a breast cancer database. Lecture Notes in Artificial Intelligence, 1211, 130–133. Metsis V., Androutsopoulos I., and Paliouras G. (2006) Spam filtering with na¨ve ı Bayes—which na¨ve Bayes? CEAS 2006—Third Conference on Email and Antiı Spam, Mountain View, California. Sahami M., Dumains S., Heckerman D., and Horvitz E. (1998) A Bayesian approach to filtering junk e-mail. In Learning for Text Categorization—Papers from the AAAI Workshop, Madison, Wisconsin, pp. 55–62. Titterington D.M., Murray G.D., Murray L.S., Spiegelhalter D.J., Skene A.M., Habbema J.D.F., and Gelpke G.J. (1981) Comparison of discrimination techniques applied to a complex data set of head injured patients. Journal of the Royal Statistical Society, Series A, 144, 145–175.…

    • 7200 Words
    • 29 Pages
    Good Essays
  • Good Essays

    We here briefly describe the classification algorithms applied, the BBC forum dataset [112] used and the performance evaluation measures used to analyze the results.…

    • 816 Words
    • 4 Pages
    Good Essays