0
$\begingroup$

I am working on pattern matching algorithm. Its working and using very less memory. For the comparison, I have to compare it with the Rete Algorithm. I have checked it in the thesis of the author, some of his paper and he has provided some complexities which are not based on then, nor does its efficiency is provided in the space complexity.

My algorithm despite large inputs worst case is $O(n^2)$. Can someone point me to a good reference where I can find its complexity? I have been searching for a while now, and I did not even get the pseudo code. Things not to consider in order to save your time is algorithms, software, expert systems based on Rete algorithm e.g. Jess etc. reference link for algorithm thesis pdf Click to download

citation of the paper "Forgy, C.L., 1982. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial intelligence, 19(1), pp.17-37."

$\endgroup$
3
  • 1
    $\begingroup$ You need to give a proper reference for this "Rete" algorithm. Have you tried analysing it yourself? Have you compared the efficacy of both algorithms? $\endgroup$
    – Raphael
    Commented Nov 13, 2017 at 6:50
  • $\begingroup$ i want the original source, it is available in JESS as a code but i cannot use it being an external source $\endgroup$ Commented Nov 13, 2017 at 7:29
  • $\begingroup$ That's not an issue here because we don't like source code, anyway. (If it's a research paper, chances are there is no implementation at all, or the one they have was never published. It sucks, but still.) $\endgroup$
    – Raphael
    Commented Nov 13, 2017 at 10:37

1 Answer 1

0
$\begingroup$

finally i found what was needed, thought i wil share here for others who might need it. http://reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-113.pdf

$\endgroup$
2
  • $\begingroup$ And what's in there? Links break. $\endgroup$
    – Raphael
    Commented Jan 25, 2018 at 12:24
  • $\begingroup$ its working, link is fine $\endgroup$ Commented Jan 30, 2018 at 4:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.