Mining weighted subgraphs in a single large graph

DOI10.1016/J.INS.2019.12.010MaRDI QIDQ2660705zbMATH OpenOpenAlexWikidataFDO

Authors Ngoc-Thao Le, Bay Vo, 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)

Recommendations

• scientific article; zbMATH DE number 139776
• Finding, minimizing, and counting weighted subgraphs
• Finding, minimizing, and counting weighted subgraphs
• Mining frequent subgraphs in multigraphs
• On the usefulness of weight-based constraints in frequent subgraph mining

Cites work

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

Cited in

(6)

• HUSM: high utility subgraph mining in single graph databases
• On the usefulness of weight-based constraints in frequent subgraph mining
• An efficient weighted graph aggregation algorithm
• Subgraph matching on temporal graphs
• FCSG-Miner: frequent closed subgraph mining in multi-graphs
• scientific article; zbMATH DE number 5347083 (Why is no real title available?)

Describes a project that uses

Uses Software

• AnyDBC
• gSpan

This page was built for publication: Mining weighted subgraphs in a single large graph

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