All normalized anti-monotonic overlap graph measures are bounded
type: Item
instance of: scholarly article
title: All normalized anti-monotonic overlap graph measures are bounded
zbMATH Open document ID: 1235.68135
author: Toon Calders
author: Jan Ramon
author: Dries Van Dyck
published in: Data Mining and Knowledge Discovery
publication date: 2012-04-11T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/296695
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 6022942
zbMATH Keywords: graph mining
zbMATH Keywords: large network setting
zbMATH Keywords: support measure
zbMATH Keywords: anti-monotonicity
zbMATH Keywords: morphism reductions
Wikidata QID: Q114827259
describes a project that uses: QNet
MaRDI profile type: Publication
OpenAlex ID: W2112745556
cites work: Random graphs.
cites work: Clique, chromatic, and Lovász numbers of certain circulant graphs
cites work: Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs
cites work: Q4507228
cites work: Handbook of Graph Theory
cites work: The sandwich theorem
cites work: The subgraph homeomorphism problem
cites work: Inductive Logic Programming: Theory and methods
cites work: A solution of the isomorphism problem for circulant graphs
cites work: Q4298260
cites work: Q4536686
cites work: Support measures for graph data
DOI: 10.1007/S10618-011-0217-Y
description: scientific article; zbMATH DE number 6022942