We give an improved local partitioning algorithm using heat kernel pagerank, a modified version of PageRank. For a subset S with Cheeger ratio (or conductance) h, we show that there are at least a quarter of the vertices in S that can serve as seeds for heat kernel pagerank which lead to local cuts with Cheeger ratio at most O(Öh)O(\sqrt{h}), improving the previously bound by a factor of Ö{log|S|}\sqrt{log|S|}.