33. The system of claim 31 , wherein the graph search involves incrementally extending multiple independent search paths such that a search path is extended at each increment and such that a same search path is extended continuously until a first occurrence of any of the following conditions: an end of the continuously extended search path is reached; an encountered node represents an association rule that does not satisfy an information gain improvement criteria; and an encountered node represents an association rule that is not improvable through further expansion of the continuously extended search path.
33. The system of claim 31 , wherein the graph search involves incrementally extending multiple independent search paths such that a search path is extended at each increment and such that a same search path is extended continuously until a first occurrence of any of the following conditions: an end of the continuously extended search path is reached; an encountered node represents an association rule that does not satisfy an information gain improvement criteria; and an encountered node represents an association rule that is not improvable through further expansion of the continuously extended search path. 34. The system of claim 33 , wherein the graph search further involves maintaining and updating a list of nodes and the association rules that the nodes of the list represent, wherein maintaining and updating the list of nodes includes using the list of nodes to track a portion of nodes visited in the search that represent association rules evaluated to be more precise than association rules represented by other nodes visited in the search.