All normalized anti-monotonic overlap graph measures are bounded

DOI10.1007/S10618-011-0217-YzbMATH Open1235.68135OpenAlexW2112745556WikidataQ114827259 ScholiaQ114827259MaRDI QIDQ408673FDOQ408673

Authors: Toon Calders, Jan Ramon, Dries Van Dyck 

Publication date: 11 April 2012

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/296695

Recommendations

• An efficiently computable subgraph pattern support measure: counting independent observations
• Counting frequent patterns in large labeled graphs: a hypergraph-based approach
• Support measures for graph data
• Measures on monotone properties of graphs
• Frequent Hypergraph Mining

zbMATH Keywords

anti-monotonicitygraph mininglarge network settingmorphism reductionssupport measure

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Random graphs.
• Title not available (Why is that?)
• Handbook of Graph Theory
• A solution of the isomorphism problem for circulant graphs
• The sandwich theorem
• Support measures for graph data
• Clique, chromatic, and Lovász numbers of certain circulant graphs
• Inductive Logic Programming: Theory and methods
• Title not available (Why is that?)
• Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs
• The subgraph homeomorphism problem

Cited In (3)

• Linear Programs with Conjunctive Database Queries
• An efficiently computable subgraph pattern support measure: counting independent observations
• Nearly exact mining of frequent trees in large networks

Uses Software

• QNet

This page was built for publication: All normalized anti-monotonic overlap graph measures are bounded

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408673)