Librarians and search professionals have traditionally favored Boolean keyword search systems, which, when successful, return a small set of relevant hits.
we adopted the Q learning paradigm (watkins, 1989;Mitchell, 1997) to model our problem as a set of possible states, S, and a set of actions, A, which can be performed to alter the current state.