The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1989 vol.11)
pp: 1312-1316
ABSTRACT
<p>Structured matching is a task-specific technique for selecting one choice out of a small number of alternatives based on a given set of parameters. In structured matching, the knowledge and control for making a decision are integrated within a hierarchical structure. Each node in the hierarchy corresponds to a different aspect of the decision and contains knowledge for directly mapping the results of its children nodes (or selected parameters) into a choice on the subdecision. The root node selects the final choice for the decision. The authors formally characterize the task and strategy of structured matching and analyze its computational complexity. They believe that structured matching captures the essence of what makes a range of decision-making problems computationally feasible to solve.</p>
INDEX TERMS
pattern recognition; knowledge engineering; structured matching; hierarchical structure; computational complexity; decision-making problems; computational complexity; knowledge engineering; pattern recognition
CITATION
A. Goel, T. Bylander, "Computational Feasibility of Structured Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.11, no. 12, pp. 1312-1316, December 1989, doi:10.1109/34.41369
49 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool