{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T22:38:22Z","timestamp":1773355102731,"version":"3.50.1"},"reference-count":0,"publisher":"Agora University of Oradea","issue":"2","license":[{"start":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:00:00Z","timestamp":1773273600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INT J COMPUT COMMUN, Int. J. Comput. Commun. Control"],"abstract":"<jats:p>The identification of key nodes within multi-relational networks presents significant challenges due to the heterogeneity of node attributes and the varying significance of different attributes across distinct relationships. Conventional methods often fail to effectively capture these complexities, leading to suboptimal mining outcomes. To address this issue, a passive clustering-based approach is introduced to enhance the identification of important nodes in multi-relational networks. By constructing an adjacency matrix framework, the network structure is systematically represented, encapsulating the connectivity relationships among nodes. The comprehensive centrality of entity nodes is then evaluated to preliminarily select candidates with substantial network influence. Subsequently, a passive clustering algorithm is applied to categorize nodes into clusters based on attribute similarities, enabling a refined analysis within each cluster. The principle of node centrality metrics is further adapted to assess node importance within and across clusters, thereby mitigating the impact of attribute heterogeneity. Nodes exhibiting weak intra-cluster associations are eliminated, ensuring the robustness of the clustering process. The proposed method demonstrates superior efficiency and scalability, requiring a memory footprint below 160 KB. Furthermore, the computational efficiency of node degree centrality, median centrality, and proximity centrality is improved, with relative computational time ratios of 14.2%, 8.9%, and 8.6%, respectively. These results indicate that the proposed approach effectively captures complex dynamic interactions within undirected and unprivileged multi-relational networks, offering a scalable and computationally efficient solution for important node mining.<\/jats:p>","DOI":"10.15837\/ijccc.2026.2.7108","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:45:54Z","timestamp":1773315954000},"source":"Crossref","is-referenced-by-count":0,"title":["A Passive Clustering-Based Approach for Important Node Mining in Multi-Relational Networks"],"prefix":"10.15837","volume":"21","author":[{"given":"Haijun","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6528","published-online":{"date-parts":[[2026,3,12]]},"container-title":["INTERNATIONAL JOURNAL OF COMPUTERS  COMMUNICATIONS &amp; CONTROL"],"original-title":[],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:45:55Z","timestamp":1773315955000},"score":1,"resource":{"primary":{"URL":"https:\/\/univagora.ro\/jour\/index.php\/ijccc\/article\/view\/7108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,12]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,3,12]]}},"URL":"https:\/\/doi.org\/10.15837\/ijccc.2026.2.7108","relation":{},"ISSN":["1841-9844","1841-9836"],"issn-type":[{"value":"1841-9844","type":"electronic"},{"value":"1841-9836","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3,12]]}}}