[Marcus Vilain]

Hi there,

Just wanted to know how the following algorithm is named :

- It search in depth guided by an heuristic and cut the branch if it consider that the branch is not good enough.

Thanks for that !
Marcus

[Korrelan]

https://en.wikipedia.org/wiki/Decision_tree_pruning

 

[Marcus Vilain]

Hi,

Thank you for your answer. Not sure that the decision tree pruning is the right name since it seems related to learning algorithm but I’ll take a closer look... The term « pruning Â» make me think about « branch and bound Â».

In fact, it’s a sort of « best first Â» search with pruning...  I can’t believe this has no name.

Marcus

[Art]

It can be called anything you like but I believe Korrelan is correct in his choice of labels.

Some call it Selective Pruning but the description of "Selective" = decision, therefore the same thing.

[8pla.net]

Wow!  This is a good A.I. topic you started, Marcus.

Hey AiDreams, let's go take an online college
course together.  Imagine that, all of us
fellow online students?

Here is our first homework assignment...
Reference: CSE 473 Artificial Intelligence
https://courses.cs.washington.edu/courses/cse473/14sp/slides/3-search.pdf

Which is Marcus asking about?

A. Depth-first search DFS
B. Breadth-first search BFS
C. Best First with f(n)= heuristic estimate.
D. Greedy Search
E. None of the above

Your answer:____

Thanks and credit to Hanna Hajishirzi, Dan Klein, Stuart Russell,  Andrew Moore, Dan Weld, Pieter Abbeel, and Luke  Zettelmoyer at The University of Washington.

[LOCKSUIT]

holy, molly, that moment at 1/3rd down the pdf, shocking...........................the parse tree is a markov chain graph

[LOCKSUIT]

a comparison of 3 ways of building sequences:

Add "dog dot" and you have a problem.

[LOCKSUIT]

Notice mine can also do breadth search thingy, and notice my example has sequences beginning with D. Also I left out markings on my lines, 1 & 2 denote order of sequences, ex. D>O.

[LOCKSUIT]

"No information about goal location "

Mine at top allows you to know where you're going. If you're looking for "dog dot", you just keep looking for parent matches ex. "di" & "m" point to "dim". You don't even have to check all "di" 's  parents!

[LOCKSUIT]

see that map of countries in the PDF?
Mine can do it too, follow along the green country nodes: