IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v199y2025ip1s0960077925006678.html
   My bibliography  Save this article

Interpretable graph clustering on massive attribute networks via multi-agent dynamic game

Author

Listed:
  • Li, Huijia
  • Lou, Fanghao
  • Wang, Qiqi
  • Li, Guijun

Abstract

The efficient clustering of attributed graphs is a critical and challenging problem that has attracted significant attention across various research fields. In this area, interpretation of the formation for attribute cluster configuration and balance between clustering quality and computational efficiency are two important issues. To solve these problems, in this paper, we model the attribute graph clustering problem as a multi-objective optimization problem and interpret the formation and evolution of cluster configuration by a new multi-agent dynamic game. By the effectively defining of feasible strategy mapping function and utility function for each node, the proposed framework demonstrates that the multi-objective optimization problem can be solved by calculating a series of coupled Nash equilibrium problems to achieve Pareto local optimal solution. Based on the theoretical analysis, we further propose a new attribute graph clustering algorithm. By updating the state variable to the convergence, one can automatically uncover rich semantic clusters on massive attribute graphs. The experiments on four public datasets show that the proposed method is effective and efficient.

Suggested Citation

  • Li, Huijia & Lou, Fanghao & Wang, Qiqi & Li, Guijun, 2025. "Interpretable graph clustering on massive attribute networks via multi-agent dynamic game," Chaos, Solitons & Fractals, Elsevier, vol. 199(P1).
  • Handle: RePEc:eee:chsofr:v:199:y:2025:i:p1:s0960077925006678
    DOI: 10.1016/j.chaos.2025.116654
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925006678
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2025.116654?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
    ---><---

    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:eee:chsofr:v:199:y:2025:i:p1:s0960077925006678. 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: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    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.