Mining weighted subgraphs in a single large graph

DOI10.1016/J.INS.2019.12.010zbMATH Open1457.68234OpenAlexW2992820505WikidataQ126639883 ScholiaQ126639883MaRDI QIDQ2660705FDOQ2660705

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

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

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)

Cites Work

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

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
• Title not available (Why is that?)

Uses Software

• gSpan
• AnyDBC

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)