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

Information Fusion Algorithm for Big Data in Digital Publishing Industry Chain

Author

Listed:
  • Haixiang He
  • Zhihan Lv

Abstract

This paper studies the information of big data in the digital publishing industry chain and adopts advanced algorithms for its fusion calculation. The basic theory of digital publishing ecological chain is dissected, the construction requirements, construction methods, and construction paths of digital publishing ecological chain are analysed, and feasible construction measures are proposed. It also defines the connotation of the fusion of knowledge services between publishing institutions and libraries in the digital era; then analyses the characteristics and principles of the fusion of knowledge services between publishing institutions and libraries in the digital era; and finally sorts out the theoretical foundations such as synergy theory, information integration service theory, and game theory. Meanwhile, this paper also studies the flow of digital publishing resources and empirically analyses the eco-efficiency of digital publishing eco-chain by using metabolic network analysis, population analysis, and life cycle analysis, and it finds the eco-efficiency problems of the existing e-book eco-chain from its analysis. Finally, the imbalance in the digital publishing ecological chain and its hazards are analysed, and specific regulation and optimization measures are proposed. The research in this paper makes up for the deficiencies of related studies and can well solve the problems that exist in the previous and provide theoretical support for the healthy development of digital publishing enterprises.

Suggested Citation

  • Haixiang He & Zhihan Lv, 2021. "Information Fusion Algorithm for Big Data in Digital Publishing Industry Chain," Complexity, Hindawi, vol. 2021, pages 1-10, April.
  • Handle: RePEc:hin:complx:9925567
    DOI: 10.1155/2021/9925567
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9925567.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9925567.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/9925567?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:complx:9925567. 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.