Shifting Hypergraphs by Probabilistic Voting

@inproceedings{Wang2014ShiftingHB,
  title={Shifting Hypergraphs by Probabilistic Voting},
  author={Yang Wang and Xuemin Lin and Qing Zhang and Lin Wu},
  booktitle={PAKDD},
  year={2014}
}
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the existing techniques to seek graph modes by shifting vertices based on pair-wise edges (i.e, an edge with 2 ends), our paradigm is based on shifting high-order edges (hyperedges) to deliver graph modes. Specifically, we convert the problem of seeking graph modes… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Similar Papers

Loading similar papers…