An extended branch and bound search algorithm for finding top-N formal concepts of documents

Authors:
Makoto Haraguchi;Yoshiaki Okubo
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan
Venue:
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Year:
2006

Citing 10
Cited 2

Efficient mining of association rules using closed itemset lattices

Information Systems
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Introduction to Modern Information Retrieval

Introduction to Modern Information Retrieval
Constructing Approximate Informative Basis of Association Rules

DS '01 Proceedings of the 4th International Conference on Discovery Science
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Survey of Text Mining II: Clustering, Classification, and Retrieval

Survey of Text Mining II: Clustering, Classification, and Retrieval
An efficient branch-and-bound algorithm for finding a maximum clique

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A method for pinpoint clustering of web pages with pseudo-clique search

Proceedings of the 2005 international conference on Federation over the Web
An overview of web data clustering practices

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Finding significant web pages with lower ranks by pseudo-clique search

DS'05 Proceedings of the 8th international conference on Discovery Science

Finding Top-N Pseudo Formal Concepts with Core Intents

MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
An algorithm for extracting rare concepts with concise intents

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

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.