A fuzzy logic approach to the summarization of database information

An approach to the summarization of database information using fuzzy logic is presented. The general form of a summary is QYs are F where Q is a fuzzy linguistic quantifier, Y is a class of objects and F is a property of the class or a summary that applies to the class quantified by Q. The truth of such a proposition can be determined for each tuple. Bounds on such descriptions can be defined in terms of a most general specification constituent description and a most specific generalization constraint description. A genetic algorithm technique is used to obtain a near optimal summary that fits a given set of tuples