An algorithm for extracting rare concepts with concise intents

DOI10.1007/978-3-642-11928-6_11zbMATH Open1274.68494OpenAlexW2109521752MaRDI QIDQ3552286FDOQ3552286

Authors: Yoshiaki Okubo, Makoto Haraguchi 

Publication date: 14 April 2010

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11928-6_11

Recommendations

• A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
• A local approach to concept generation
• From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit
• Formal Concept Analysis with Constraints by Closure Operators
• A fast algorithm for formal concept analysis intent

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Knowledge representation (68T30) Nonnumerical algorithms (68W05)

Cited In (1)

• A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets

This page was built for publication: An algorithm for extracting rare concepts with concise intents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552286)