Mining weighted subgraphs in a single large graph

DOI10.1016/j.ins.2019.12.010zbMath1457.68234OpenAlexW2992820505WikidataQ126639883 ScholiaQ126639883MaRDI QIDQ2660705

Bay Vo, Ngoc-Thao Le, Lam B. Q. Nguyen, Hamido Fujita, Bac Le

Publication date: 31 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.12.010

zbMATH Keywords

data miningsubgraph miningpruning techniquessingle large graphweighted subgraph

Mathematics Subject Classification ID

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

Related Items

Subgraph matching on temporal graphs

Uses Software

• gSpan
• AnyDBC

Cites Work

• On risk-averse maximum weighted subgraph problems
• Anytime parallel density-based clustering
• Mining frequent subgraphs in multigraphs
• On exploiting priority relation graph for reliable multi-path communication in mobile social networks
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• An efficiently computable subgraph pattern support measure: counting independent observations