Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Pattern Miner considering too many groundings #9

Open
ngeiswei opened this issue May 7, 2019 · 1 comment
Open

Pattern Miner considering too many groundings #9

ngeiswei opened this issue May 7, 2019 · 1 comment

Comments

@ngeiswei
Copy link
Member

ngeiswei commented May 7, 2019

MinerUtils::restricted_satisfying_set should only check whether the given text matches or not, rather than considering subhypergraphs, as well as permutations due to unordered links, which is contrary to how empirical probability is calculated.

@linas
Copy link
Member

linas commented May 9, 2019

permutations over unordered links are needed only if there are two or more ungrounded variables. Otherwise, one can promptly make a 1-to-1 match; permutations are not needed for this

@linas linas transferred this issue from opencog/opencog Sep 14, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants