Formal Concept Analysis Based Clustering

Formal Concept Analysis Based Clustering

Jamil M. Saquer (Southwest Missouri State University, USA)
Copyright: © 2005 |Pages: 5
DOI: 10.4018/978-1-59140-557-3.ch097
OnDemand PDF Download:
$37.50

Abstract

Formal concept analysis (FCA) is a branch of applied mathematics with roots in lattice theory (Wille, 1982; Ganter & Wille, 1999). It deals with the notion of a concept in a given universe, which it calls context. For example, consider the context of transactions at a grocery store where each transaction consists of the items bought together. A concept here is a pair of two sets (A, B). A is the set of transactions that contain all the items in B and B is the set of items common to all the transactions in A. A successful area of application for FCA has been data mining. In particular, techniques from FCA have been successfully used in the association mining problem and in clustering (Kryszkiewicz, 1998; Saquer, 2003; Zaki & Hsiao, 2002). In this article, we review the basic notions of FCA and show how they can be used in clustering.

Complete Chapter List

Search this Book:
Reset