Disagreement-based combinatorial pure exploration: Efficient algorithms and an analysis with localization