IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-97-4045-1_2.html
   My bibliography  Save this book chapter

An Attribute Relationship Clustering Algorithm for Telecom Customer Group Discovery

In: Liss 2023

Author

Listed:
  • Xiong Hu

    (University of Science and Technology Beijing)

  • Xuedong Gao

    (University of Science and Technology Beijing)

Abstract

This article focuses on the issue of telecommunications customer management, and studies customer group discovery methods based on customer communication relationships and customer attributes. A density clustering algorithm is proposed that considers both communication customer attributes and communication relationships between customers. The customer clustering algorithm is based on an undirected weighted network with integrated similarity. It sorts the nodes in the network according to their strength, starting from the object with the highest node strength. The pruned nodes in the undirected weighted network that have a direct connection to the clustering starting point after removing edges that are less than the similarity threshold are clustered into one group. The starting point of this clustering is the core node, while also obtaining hub nodes and isolated nodes. The empirical analysis of customer data from a telecommunications company in Beijing shows that the customer clustering algorithm proposed in this study can effectively discover customer groups and identify core objects within the customer group.

Suggested Citation

  • Xiong Hu & Xuedong Gao, 2024. "An Attribute Relationship Clustering Algorithm for Telecom Customer Group Discovery," Lecture Notes in Operations Research, in: Daqing Gong & Yixuan Ma & Xiaowen Fu & Juliang Zhang & Xiaopu Shang (ed.), Liss 2023, pages 13-28, Springer.
    • Handle: RePEc:spr:lnopch:978-981-97-4045-1_2
    DOI: 10.1007/978-981-97-4045-1_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnopch:978-981-97-4045-1_2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.