Support measures for graph data

DOI10.1007/S10618-006-0044-8zbMath1235.68200OpenAlexW2092676508WikidataQ57518761 ScholiaQ57518761MaRDI QIDQ2508500

Solomon Eyal Shimony, Natalia Vanetik, Ehud Gudes

Publication date: 13 October 2006

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

Full work available at URL: https://doi.org/10.1007/s10618-006-0044-8

zbMATH Keywords

data mininggraph miningsupport measures

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

All normalized anti-monotonic overlap graph measures are bounded ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ An efficiently computable subgraph pattern support measure: counting independent observations ⋮ Support measures for graph data

Uses Software

• XQuery
• gSpan

Cites Work

• Calculi for synchrony and asynchrony
• Complete mining of frequent patterns from graphs: Mining graph data
• Support measures for graph data
• Isomorph-Free Exhaustive Generation

This page was built for publication: Support measures for graph data