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

Rough-Set-Based Real-Time Interest Label Extraction over Large-Scale Social Networks

Author

Listed:
  • Xiaoling Huang
  • Lei Li
  • Hao Wang
  • Chengxiang Hu
  • Xiaohan Xu
  • Changlin Wu
  • Manman Yuan

Abstract

Labels provide a quick and effective solution to obtain people interesting content from large-scale social network information. The current interest label extraction method based on the subgraph stream proves the feasibility of the subgraph stream for user label extraction. However, it is extremely time-consuming for constructing subgraphs. As an effective mathematical method to deal with fuzzy and uncertain information, rough set-based representations for subgraph stream construction are capable of capturing the uncertainties of the social network. Therefore, we propose an effective approach called RS_UNITE_SS (namely, rough-set-based user-networked interest topic extraction in the form of subgraph stream), which is suitable for large-scale social network user interest label extraction. Specifically, we first propose the subgraph division algorithm to construct a subgraph stream by incorporating a rough set. Then, the algorithm for user real-time interest label extraction based on upper approximation (RILE) is proposed by using sequentially characteristics of the subgraph. Empirically, we evaluate RS_UNITE_SS over real-world datasets, and experimental results demonstrate that our proposed approach is more computationally efficient than existing methods while achieving higher precision value and MRR value.

Suggested Citation

  • Xiaoling Huang & Lei Li & Hao Wang & Chengxiang Hu & Xiaohan Xu & Changlin Wu & Manman Yuan, 2022. "Rough-Set-Based Real-Time Interest Label Extraction over Large-Scale Social Networks," Complexity, Hindawi, vol. 2022, pages 1-17, June.
  • Handle: RePEc:hin:complx:2072950
    DOI: 10.1155/2022/2072950
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2072950.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/2072950.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/2072950?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:2072950. 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.