The following pages link to Discovery Science (Q5464540):
Displaying 18 items.
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Listing closed sets of strongly accessible set systems with applications to data mining (Q844900) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery (Q1741345) (← links)
- Parallel algorithms for enumerating closed patterns from multi-relational data (Q1800394) (← links)
- LCM from FCA point of view: a CbO-style algorithm with speed-up features (Q2076970) (← links)
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis (Q2117120) (← links)
- On the efficient stability computation for the selection of interesting formal concepts (Q2200684) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality (Q2279533) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (Q2980895) (← links)
- Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (Q4932736) (← links)
- ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS (Q5151065) (← links)
- Pruning techniques in lincbo for the computation of the duquenne-guigues basis (Q6125182) (← links)
- Formal concept analysis: from knowledge discovery to knowledge processing (Q6602260) (← links)
- Efficient discovery of interesting patterns based on strong closedness (Q6641619) (← links)
