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. 35. The system of claim 33 , wherein the graph search is a depth-first search subject to constraints that limit expansion at any single node to a maximum number of nodes.