scientific article

zbMath1317.68165MaRDI QIDQ2933958

Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi

Publication date: 8 December 2014

Full work available at URL: http://jmlr.csail.mit.edu/papers/v14/jethava13a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random graphssupport vector machinemultiple kernel learningplanted cliquesLovász theta functioncommon dense subgraphorthogonal labellings of graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Learning and adaptive systems in artificial intelligence (68T05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items (3)

A characterization of the weighted Lovász number based on convex quadratic programming ⋮ Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning ⋮ Graph Kernels: A Survey

This page was built for publication: