Extract frequent pattern from simple graph data

DOI10.1007/3-540-45703-8_15MaRDI QIDQ4708634zbMATH OpenFDO

Authors QingQing Yuan, Yubo Lou, HaoFeng Zhou, Wei Wang, Baile Shi

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2419/24190158.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• An efficient algorithm of frequent connected subgraph extraction
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Complete mining of frequent patterns from graphs: Mining graph data
• An efficient approach for mining frequent subgraphs
• Frequent mining of subgraph structures

Cited in

(5)

• Complete mining of frequent patterns from graphs: Mining graph data
• The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• An efficient algorithm of frequent connected subgraph extraction
• Mining frequent patterns in 2D+t grid graphs for cellular automata analysis

This page was built for publication: Extract frequent pattern from simple graph data

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