The exploration of polarized communities, which consist of two antagonistic subgraphs and include a set of query nodes, is a crucial task in community search on signed networks. Most existing methods either predominantly rely on topological structure while disregarding node attributes or tend to prioritize the global identification of all polarized communities. Thus, they fail to consider two crucial insights.The exploration of polarized communities, which consist of two antagonistic subgraphs and include a set of query nodes, is a crucial task in community search on signed networks. Most existing methods either predominantly rely on topological structure while disregarding node attributes or tend to prioritize the global identification of all polarized communities. Thus, they fail to consider two crucial insights.[#item_full_content]