Advertisement

A Belief Function Reasoning Approach to Web User Profiling

  • Luepol Pipanmaekaporn
  • Suwatchai KamonsantirojEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9375)

Abstract

This paper presents a novel approach to web user profiling. Our proposed approach consists of two main parts. The first part focuses on discovering user interests in a user feedback collection, usually including relevant and irrelevant documents. Frequent pattern mining widely used in data mining community is applied to extract user feedback information. The second part is to represent user profiles. We introduce a novel user profile model based on belief function reasoning. In this model, the user profile is described by a probability distribution over the user feedback information extracted. Experimental results on an information filtering task show that the proposed approach clearly outperforms several baseline methods.

Keywords

Web user profile User interests discovery Belief function reasoning Relevance feedback 

References

  1. 1.
    Buckley, C., Salton, G., Allan, J.: The effect of adding relevance information in a relevance feedback environment. In: ACM SIGIR 17th International Conference, pp. 292–300 (1994)Google Scholar
  2. 2.
    Joachims, T.: A probabilistic analysis of the rocchio algorithm with TFIDF for text categorization. In: Proceedings of the 4th International Conference on Machine Learning, pp. 143–151 (1997)Google Scholar
  3. 3.
    Schiaffino, S., Amandi, A.: Intelligent user profiling. In: Bramer, M. (ed.) Artificial Intelligence. LNCS (LNAI), vol. 5640, pp. 193–216. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Sebastiani, F.: Machine learning in automated text categorization. ACM Comput. Surv. 34, 1–47 (2002)CrossRefGoogle Scholar
  5. 5.
    Smets, P.: Decision making in the TBM: the necessity of the pignistic transformation. Int. J. Approximate Reasoning 38(2), 133–147 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Smets, P., Kennes, R.: The transferable belief model. Artif. Intell. 66(2), 191–234 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Soboroff, I., Robertson, S.: Building a filtering test collection for TREC 2002. In: Proceedings of the 26th International ACM SIGIR Conference, p. 250. ACM (2003)Google Scholar
  8. 8.
    Wu, S.T., Li, Y., Xu, Y.: Deploying approaches for pattern refinement in text mining. In: 6th IEEE ICDM International Conference on Data Mining, pp. 1157–1161 (2006)Google Scholar
  9. 9.
    Wu, S.T., Li, Y., Xu, Y., Pham, B., Chen, P.: Automatic pattern-taxonomy extraction for web mining. In: 3th IEEE/WIC/ACM WI International Conference on Web Intelligence, pp. 242–248 (2004)Google Scholar
  10. 10.
    Zaki, M.J.: Generating non-redundant association rules. In: 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34–43 (2000)Google Scholar
  11. 11.
    Zhong, N., Li, Y., Wu, S.-T.: Effective pattern discovery for text mining. IEEE Trans. Knowl. Data Eng. 24(1), 30–44 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Luepol Pipanmaekaporn
    • 1
  • Suwatchai Kamonsantiroj
    • 1
    Email author
  1. 1.Department of Computer and Information ScienceKing Mongkut’s University of Technology North BangkokBangkokThailand

Personalised recommendations