Search Techniques Department Of Computer Science搜索技术计算机科学系.pptVIP

下载本文档

2
0
约6.09千字
约 16页
2018-06-19 发布于福建
举报
版权申诉

Search Techniques Department Of Computer Science搜索技术计算机科学系.ppt

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Search Techniques Department Of Computer Science搜索技术计算机科学系

Search Techniques CS480/580 Fall 2009 Introduction Trees: Root, parent, child, sibling, leaf node, node, edge Single path from root to any node Graphs: Nodes, edges, directed/undirected graph, acyclic graph Search techniques for Trees Exhaustive search Breadth-first search: Use a queue to implement Search nodes each level at a time Depth-first search: Use a stack to implement Search nodes path at a time Searching Graph Apply the same two techniques But to eliminate infinite looping, mark a node when it is already visited. This way it won’t be explored repeatedly. Heuristic Search When the search space is very large (millions of nodes), it is not feasible to search the entire space; Instead we use a heuristic search that directs the search based on some heuristics Evaluation function to rank the nodes to determine the order of searchwhich is most likely to succeed Heuristic 1: Hill Climbing /c/a/Java/AIBased-Problem-Solving/4/ First decide on an evaluation function for each nodethis depends on the specific application E.g., In airline routing, if the task is to find a route that can take a passenger from airport X to airport Y, there could be several possible sequence of hops that need to be considered. Suppose there is no direct path from X-Y, but there are 4 hubs H1, H2, H3, H4, that X has flights to, then we need to determine which is the next hub we want to explore. We need a basis for the decision. Suppose we consider the distance between X and a hub as the evaluation function so the further a hub takes a passenger away from X, then the closer it is to the destination Y. So evaluation criteria is: choose an alternate that is farthest from X. This may or may not always result in optimal solution. Local maxima, local minimaproblems Look at the airline routing in the above reference Best First Search Similar to BFS and DFS, it is exhaustive. The difference is that the next node to search is based on an evaluation functionin other words whenever we need to