Skip to content

Identifying key classes using biterm-sensitive PageRank with motif-based coreness

Aug 2026 · ACM Transactions on Software Engineering and Methodology · 0 citations · 70 references

TL;DR

This paper introduces BiMo, a novel approach for identifying key classes in Java projects that significantly outperforms all baselines with significant differences, and is robust against different weighting mechanisms used to assign strengths for different relationship types in the CAN.

Abstract

Key classes serve as excellent starting points for developers, particularly newcomers, to comprehend unfamiliar software systems. Although numerous unsupervised learning approaches for identifying key classes have been proposed in the literature—typically by representing software as class dependency networks (aka software networks) and leveraging various network metrics (e.g., \(h\) -index, \(a\) -index, coreness, and PageRank value) —these approaches fail to account for both the information available in diverse software artifacts, such as user manuals, and higher-order information captured by small network subgraphs (e.g., motifs) in software networks. In this paper, we introduce BiMo, a novel approach for identifying key classes in Java projects. First, we utilize a c lass-level a ggregated n etwork ( \({\rm CAN}\) ) to precisely represent classes and their inter-class couplings. Second, we extract biterms (i.e., co-occurred word pairs) from both user manuals and class source code, and further propose a b iterm-based s e mantic similarity metric, BE, to quantify the semantic similarity between user manuals and classes. Third, we detect all 3- and 4-node motifs within the \({\rm CAN}\) and further utilize them to construct a m otif-based c lass c oupling n etwork (MCCN); based on the MCCN, we propose a m otif-based c oreness metric, MC, to characterize the higher-order information of classes in the MCCN. Fourth, based on both the BE and MC metrics, we develop a novel PageRank variant, BiCoRank, to measure the PageRank value of classes in the \({\rm CAN}\) as the importance of classes. Finally, we sort classes in descending order according to their importance, and a cutoff is used to filter out non-key classes: the top-ranked classes are the recommended key classes. Empirical experiments performed on a set of 18 open-source Java projects show that i) BiMo significantly outperforms all baselines with significant differences; ii) BiMo is robust against different weighting mechanisms used to assign strengths for different relationship types in the \({\rm CAN}\) ; iii) both the MC and BE metrics significantly enhance the effectiveness of BiMo; iv) BiMo exhibits strong scalability and is well-suited for application in large-scale systems; and v) BiMo shows significant promise in real-world software comprehension tasks.

View source

Similar papers

Preprint Aug 2026

TAHB: A Comprehensive Benchmark for Text-Attributed Hypergraph Learning

TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...

D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al. · 0 citations
#artificial intelligence Preprint Aug 2026

PyKEEN-NSX: A Modular Framework for Static, Dynamic and Schema-Aware Negative Sampling in PyKEEN

PyKEEN-NSX is introduced, an extension of PyKEEN, the popular KGE framework, that provides a modular engineered abstraction for negative sampling that separates the generation of candidate negative pools, conditioned on an explicit context, from the selection strategy, enabling the development of static, schema-aware a...

Ivan Diliso, N. Fanizzi, Claudia d'Amato · 0 citations
#artificial intelligence Preprint Open access Oct 2026

Hop-Decayed Influence: New Vulnerabilities of Structural Auxiliary Indexing in GraphRAG Pipelines with LLM

GraphRAG pipelines construct auxiliary structures during offline indexing--semantic summaries, hierarchical edges, and pre-computed scores--that determine how retrieval is prioritised at query time. Prior attacks target only instance-level components (nodes, edges, triples), overlooking these schema-level structures. W...

Ji-sun Park, John Le, Heath Cooper · 0 citations
Conference Open access Sep 2026

Graph4LLM: A Systematic Survey of Graph-Enhanced Large Language Models

This survey examines how these methods integrate graphs into various stages of the LLM pipeline, including the input, model, and output phases, and outlines the challenges and future research directions for developing more efficient and interpretable solutions.

Xin-Yan Zhu, Cheng Yang, Qiu-Yue Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Athena: Vulnerability-Affected Library Identification via Knowledge Graph Completion

Athea, the first graph-based approach for vulnerability affected library identification, is proposed, which models vulnerability databases as a knowledge graph and reformulates the identification problem as knowledge graph completion (KGC).

P. Duy, Trang Dang Yen, Hưng Nguyễn Hữu et al. · 0 citations
#machine learning Preprint Sep 2026

Refining Heuristic-Based Bitcoin Address Clustering with Graph Neural Networks

This work proposes a method for refining heuristic-obtained clusters by grounding the authors' clustering on contrastive embeddings yielded by graph neural networks, and releases a publicly available dataset of Bitcoin transaction graphs containing a substantial number of clusters.

Hugo Schnoering, Roman Bresson, M. Vazirgiannis · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.