2019
DOI: 10.1007/s10489-019-01564-8
|View full text |Cite
|
Sign up to set email alerts
|

Mining clique frequent approximate subgraphs from multi-graph collections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…If it is not less than the minimum support count, save the column vector to yðW j Þ. The item set corresponding to the finally retained column vector is the frequent item [18,19] 2.2. Data Cleaning.…”
Section: Datamentioning
confidence: 99%
“…If it is not less than the minimum support count, save the column vector to yðW j Þ. The item set corresponding to the finally retained column vector is the frequent item [18,19] 2.2. Data Cleaning.…”
Section: Datamentioning
confidence: 99%
“…• It would be valuable to extract rules from the high-level visualizations that we obtained. For example, Acosta-Mendoza et al propose a frequent approximate subgraph mining approach [51], which we could incorporate as the last step of our methodology.…”
mentioning
confidence: 99%