1 research outputs found

    An Extended Branch and Bound Search Algorithm for Finding Top-N Formal Concepts of Documents

    No full text
    Abstract. This paper presents a branch and bound search algorithm for finding only top N number of extents of formal concepts w.r.t. their evaluation, where the corresponding intents are under some quality control. The algorithm aims at finding potentially interesting documents of even lower evaluation values that belong to some highly evaluated formal concept. The experimental results show that it can effectively find such documents.
    corecore