IDEAS home Printed from https://ideas.repec.org/a/ids/ijitma/v24y2025i1-2p117-129.html
   My bibliography  Save this article

The personalised classification of brand promotion information based on K-means algorithm

Author

Listed:
  • Xi Li

Abstract

In order to improve the efficiency of personalised classification of brand promotion information and shorten the time of personalised classification, this paper proposes a personalised classification method of brand promotion information based on K-means algorithm. First, collect brand promotion information, and calculate the text relevance of brand promotion information through weighting factors. Secondly, the attribute division of extension information is carried out by using the three branch decision-making theory. Then, the information features of brand promotion are extracted by capsule network. Finally, calculate the similarity between different brand promotion information, obtain the brand promotion information classification function, and realise the personalised classification of brand promotion information through k-means algorithm. The experimental results show that the classification accuracy of this method is 98.08%, and the time of personalised information classification is only 1.20 s, indicating that this method can effectively improve the efficiency of personalised classification of brand promotion information.

Suggested Citation

  • Xi Li, 2025. "The personalised classification of brand promotion information based on K-means algorithm," International Journal of Information Technology and Management, Inderscience Enterprises Ltd, vol. 24(1/2), pages 117-129.
    • Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:117-129
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=144114
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijitma:v:24:y:2025:i:1/2:p:117-129. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=18 .

    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.