IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8246540.html
   My bibliography  Save this article

Animation User Value Portrait Based on RFM Model under Big Data

Author

Listed:
  • Qifang Liu
  • Wuying Deng
  • Naeem Jan

Abstract

The development and application of big data technology has expanded the sources and methods for enterprises in the animation industry to obtain data, which provided them with the opportunity to obtain more user samples and solved the computing and storage problems faced by enterprises with massive data. By using statistical analysis and data mining methods for modeling, the user portrait of each user is depicted in an all-round and three-dimensional manner. Based on this background, this study proposes the topic of user portrait modeling based on the Reference Forward Model (RFM) model under big data. In this study, the animation user portrait modeling based on the RFM model under big data is firstly summarized: collect and summarize the behavior data of animation client users, prepare the data, and use entropy and Pearson correlation coefficient methods for data processing. And, then the weight of RFM is calculated through AHP (Analytic Hierarchy Process), and the behavior data collection method for animation user portrait modeling is described. Finally, based on the model tag in the constructed user portrait tag system, the RFM model under big data is used to analyze and model from multiple dimensions. In particular, in the algorithm model of animation user recognition, the weight and value of RFM are calculated to obtain the user value, and the results of the animation user portrait are summarized. Experiments proved that based on RFM Model under Big Dat can identify animation users more accurately.

Suggested Citation

  • Qifang Liu & Wuying Deng & Naeem Jan, 2022. "Animation User Value Portrait Based on RFM Model under Big Data," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-6, July.
  • Handle: RePEc:hin:jnlmpe:8246540
    DOI: 10.1155/2022/8246540
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8246540.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8246540.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/8246540?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:8246540. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.