Using Ripley s K-function to improve graph-based clustering techniques

Kevin Streib, James W. Davis. Using Ripley s K-function to improve graph-based clustering techniques. In The 24th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, Colorado Springs, CO, USA, 20-25 June 2011. pages 2305-2312, IEEE, 2011. [doi]

@inproceedings{StreibD11,
  title = {Using Ripley s K-function to improve graph-based clustering techniques},
  author = {Kevin Streib and James W. Davis},
  year = {2011},
  doi = {10.1109/CVPR.2011.5995509},
  url = {http://dx.doi.org/10.1109/CVPR.2011.5995509},
  tags = {rule-based, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/StreibD11},
  cites = {0},
  citedby = {0},
  pages = {2305-2312},
  booktitle = {The 24th IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, Colorado Springs, CO, USA, 20-25 June 2011},
  publisher = {IEEE},
}