Does the Apriori Property of graphs always hold?
I have been working on this question.
Given a graph database D as a set of small graphs, the Apriori property of support means if a
pattern is frequent in D, then all of its subgraphs are frequent. Consider a graph mining problem
defined over a single graph G, where the support of a pattern P refers to the number of all the
subgraphs in G that are isomorphic to P. Does the Apriori property still holds? If yes, give a proof.
If not, give a counter example.
The questions core is whether the Apriori algorithm works in this case or not. In my opinion I see no reason why I shouldn't work, and despite my research have been unable to find a counter example.
Does the apriori algorithm hold up here? Or is this some exception I am unaware of?
Thank you for reading.
algorithm pattern-matching data-mining graph-theory apriori
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
add a comment |
I have been working on this question.
Given a graph database D as a set of small graphs, the Apriori property of support means if a
pattern is frequent in D, then all of its subgraphs are frequent. Consider a graph mining problem
defined over a single graph G, where the support of a pattern P refers to the number of all the
subgraphs in G that are isomorphic to P. Does the Apriori property still holds? If yes, give a proof.
If not, give a counter example.
The questions core is whether the Apriori algorithm works in this case or not. In my opinion I see no reason why I shouldn't work, and despite my research have been unable to find a counter example.
Does the apriori algorithm hold up here? Or is this some exception I am unaware of?
Thank you for reading.
algorithm pattern-matching data-mining graph-theory apriori
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
add a comment |
I have been working on this question.
Given a graph database D as a set of small graphs, the Apriori property of support means if a
pattern is frequent in D, then all of its subgraphs are frequent. Consider a graph mining problem
defined over a single graph G, where the support of a pattern P refers to the number of all the
subgraphs in G that are isomorphic to P. Does the Apriori property still holds? If yes, give a proof.
If not, give a counter example.
The questions core is whether the Apriori algorithm works in this case or not. In my opinion I see no reason why I shouldn't work, and despite my research have been unable to find a counter example.
Does the apriori algorithm hold up here? Or is this some exception I am unaware of?
Thank you for reading.
algorithm pattern-matching data-mining graph-theory apriori
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
I have been working on this question.
Given a graph database D as a set of small graphs, the Apriori property of support means if a
pattern is frequent in D, then all of its subgraphs are frequent. Consider a graph mining problem
defined over a single graph G, where the support of a pattern P refers to the number of all the
subgraphs in G that are isomorphic to P. Does the Apriori property still holds? If yes, give a proof.
If not, give a counter example.
The questions core is whether the Apriori algorithm works in this case or not. In my opinion I see no reason why I shouldn't work, and despite my research have been unable to find a counter example.
Does the apriori algorithm hold up here? Or is this some exception I am unaware of?
Thank you for reading.
algorithm pattern-matching data-mining graph-theory apriori
algorithm pattern-matching data-mining graph-theory apriori
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
edited Nov 14 '18 at 5:39
Dominique Fortin
1,638816
1,638816
asked Nov 13 '18 at 4:14
rifscaperifscape
11
asked Nov 13 '18 at 4:14
rifscaperifscape
11
asked Nov 13 '18 at 4:14
rifscaperifscape
11
11
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53273710%2fdoes-the-apriori-property-of-graphs-always-hold%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53273710%2fdoes-the-apriori-property-of-graphs-always-hold%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
