Finding the best not the most: regularized loss minimization subgraph selection for graph classification. Pan, S., Wu, J., Zhu, X., Long, G., & Zhang, C. Pattern Recognit., 48(11):3783-3796, 2015.
Finding the best not the most: regularized loss minimization subgraph selection for graph classification. [link]Link  Finding the best not the most: regularized loss minimization subgraph selection for graph classification. [link]Paper  bibtex   
@article{journals/pr/PanWZLZ15,
  added-at = {2021-05-18T00:00:00.000+0200},
  author = {Pan, Shirui and Wu, Jia and Zhu, Xingquan and Long, Guodong and Zhang, Chengqi},
  biburl = {https://www.bibsonomy.org/bibtex/2adc82f77755f14e670d7a764c4658d7b/dblp},
  ee = {https://doi.org/10.1016/j.patcog.2015.05.019},
  interhash = {0dd501f964934f34f4a972e55e0ade66},
  intrahash = {adc82f77755f14e670d7a764c4658d7b},
  journal = {Pattern Recognit.},
  keywords = {dblp},
  number = 11,
  pages = {3783-3796},
  timestamp = {2024-04-08T13:11:32.000+0200},
  title = {Finding the best not the most: regularized loss minimization subgraph selection for graph classification.},
  url = {http://dblp.uni-trier.de/db/journals/pr/pr48.html#PanWZLZ15},
  volume = 48,
  year = 2015
}

Downloads: 0