The following pages link to Inductive Logic Programming (Q5394634):
Displaying 6 items.
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Mining frequent closed rooted trees (Q1959538) (← links)
- Mining CSTNUDs significant for a set of traces is polynomial (Q2051798) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- (Q4413498) (← links)
- Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (Q4932736) (← links)