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