The following pages link to (Q2767121):
Displaying 50 items.
- MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model (Q356030) (← links)
- A survey on enhanced subspace clustering (Q362155) (← links)
- Krimp: mining itemsets that compress (Q408645) (← links)
- Extracting compact and information lossless sets of fuzzy association rules (Q429403) (← links)
- Expressive generalized itemsets (Q506732) (← links)
- Valuations and closure operators on finite lattices (Q548273) (← links)
- Selective association rule generator (Q626210) (← links)
- Itemset mining: a constraint programming perspective (Q650527) (← links)
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures (Q740594) (← links)
- A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets (Q740603) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams (Q872309) (← links)
- Triadic formal concept analysis and triclustering: searching for optimal patterns (Q890322) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Top-down mining of frequent closed patterns from very high dimensional data (Q1007893) (← links)
- Layered critical values: a powerful direct-adjustment approach to discovering significant patterns (Q1009257) (← links)
- New and efficient algorithms for producing frequent itemsets with the Map-Reduce framework (Q1712055) (← links)
- Discrimination- and privacy-aware patterns (Q1715918) (← links)
- Mining significant association rules from uncertain data (Q1741259) (← links)
- Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery (Q1741345) (← links)
- Interpretation of text patterns (Q1741391) (← links)
- Probabilistic generalization of formal concepts (Q1758720) (← links)
- Generating a condensed representation for association rules (Q1774512) (← links)
- Parallel algorithms for enumerating closed patterns from multi-relational data (Q1800394) (← links)
- Summarizing categorical data by clustering attributes (Q1944973) (← links)
- Mining closed strict episodes (Q1944978) (← links)
- Learning multi-linear representations of distributions for efficient inference (Q1959506) (← links)
- The minimum description length principle for pattern mining: a survey (Q2097441) (← links)
- A tutorial on statistically sound pattern discovery (Q2218330) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- Closed and noise-tolerant patterns in \(n\)-ary relations (Q2377278) (← links)
- Discovering significant patterns (Q2384152) (← links)
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks (Q2435685) (← links)
- A statistical significance testing approach to mining the most informative set of patterns (Q2435712) (← links)
- G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
- Formal concept analysis based on the topology for attributes of a formal context (Q2446428) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← links)
- Itemset frequency satisfiability: complexity and axiomatization (Q2481978) (← links)
- Frequency-based views to pattern collections (Q2489656) (← links)
- Hybridization of GRASP metaheuristic with data mining techniques (Q2506213) (← links)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset (Q2671748) (← links)
- The Agree Concept Lattice for Multidimensional Database Analysis (Q3003421) (← links)
- Meta itemset: a new concise representation of frequent itemset (Q3401379) (← links)
- An algorithm for discovering the frequent closed itemsets in a large database (Q3429323) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory (Q4409021) (← links)
- ZooM: a nested Galois lattices-based system for conceptual clustering (Q4409025) (← links)
- Comparing performance of algorithms for generating concept lattices (Q4409026) (← links)
- Association Rules Network: Definition and Applications (Q4969631) (← links)
