LCM
From MaRDI portal
Cited in
(50)- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
- A classification for community discovery methods in complex networks
- On the termination of some biclique operators on multipartite graphs
- Local and global symmetry breaking in itemset mining
- Efficient algorithms to identify periodic patterns in multiple sequences
- An efficient algorithm for solving pseudo clique enumeration problem
- Checkpoint evolution for volatile correlation computing
- Mining local periodic patterns in a discrete sequence
- Mining maximal quasi‐bicliques: Novel algorithm and applications in the stock market and protein networks
- DenseZDD: a compact and fast index for families of sets
- LCM from FCA point of view: a CbO-style algorithm with speed-up features
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
- \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures
- A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- FastFDs
- NetMine
- TANE
- ECCLAT
- APRIORI
- GO-TermFinder
- gSpan
- SPMF
- Constrained itemset mining on a sequence of incoming data blocks
- AFOPT
- RP-Tree
- GraphScope
- PrefixSpan
- SAPPORO BDD
- CLOSET
- FCALGS
- In-Close
- IGLUE
- DenseZDD
- Graphillion
- Ordered subtree mining via transactional mapping using a structure-preserving tree database schema
- Mining mid-level visual patterns with deep CNN activations
- Enumeration aspects of maximal cliques and bicliques
- Latent association graph inference for binary transaction data
- HPStream
- Interesting pattern mining in multi-relational data
- Itemset mining: a constraint programming perspective
- A survey on enhanced subspace clustering
- Expressive generalized itemsets
- Flexible constrained sampling with guarantees for pattern mining
- Itemset generalization with cardinality-based constraints
- Boosting over non-deterministic ZDDs
- Pruning techniques in LinCbO for computation of the Duquenne-Guigues basis
- Grafting for combinatorial binary model using frequent itemset mining
- Characterizing functional dependencies in formal concept analysis with pattern structures
This page was built for software: LCM
