Granular-Ball Computing (GBC) is an efficient, robust, and highly interpretable multi-granularity representation and computation method. Nonetheless, most feature selection methods based on GBC require considerable time to calculate the significance measures of features or repeatedly generate granular balls, which limi...
Ye Li, Lei Yang, Binbin Sang et al.· IEEE Transactions on Knowled...· 1 citation
A network-optimized Monte Carlo tree search (NMCTS)-based index selection model, called tree-based index selection (Tree-IS), is proposed by using the sampling-based reinforcement learning algorithm Monte Carlo tree search (MCTS), achieving the rapid identification of optimal index sets and a significant improvement in...
Shaojie Qiao, Lei Yang, Rongmin Tang et al.· IEEE Transactions on Neural...· 0 citations
This work proposes SeeExplainer, a parameter-free explainer to interpret graph neural networks, and introduces a granular-ball graph refinement mechanism that decomposes a graph into several disjoint granular-balls with no fixed size, and utilizes them as nodes to construct a structural graph.
Jian-Cu Chen, Shuyin Xia, Guan Wang et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
