IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v33y2005i6p483-490.html
   My bibliography  Save this article

A spanning heuristic for the unordered and ordered matching identification problem

Author

Listed:
  • Kline, Douglas M.
  • Riggle, Charlene G.
  • Mehrez, Abraham

Abstract

The matching identification problem (MIP) is a combinatoric search problem related to the fields of learning from examples, boolean functions, and knowledge acquisition. The MIP involves identifying a single "goal" item from a large set of items. Because there is commonly a cost associated with evaluating each guess, the goal item should be identified in as few guesses as possible. As in most search problems, the items have a similar structure, which allows an evaluation of each guessed item. In other words, each guessed item elicits partial information about the goal item, i.e. how similar the guess is to the goal. With this information the goal is more quickly identified. The unordered MIP has been studied by Mehrez and Steinberg (ORSA J. Comput. 7 (1995) 211) in which they proposed two different types of algorithms. The purpose of the present paper is to suggest an improved Spanning Heuristic algorithm. Its improvement increases as the problem size increases. Further results and comparisons are derived for the unordered and ordered cases. This research shows that when the search space is very large, it is better to inquire from items that are known not to be the goal (they have been ruled out by previous guesses), for the purpose of acquiring more information about the goal. As the search space is narrowed, it is better to guess items that have not been ruled out.

Suggested Citation

  • Kline, Douglas M. & Riggle, Charlene G. & Mehrez, Abraham, 2005. "A spanning heuristic for the unordered and ordered matching identification problem," Omega, Elsevier, vol. 33(6), pages 483-490, December.
    • Handle: RePEc:eee:jomega:v:33:y:2005:i:6:p:483-490
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00106-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Vetle I. Torvik & Evangelos Triantaphyllou, 2002. "Minimizing the Average Query Complexity of Learning Monotone Boolean Functions," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 144-174, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:33:y:2005:i:6:p:483-490. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.