1994•Unpublished venueRequires access

Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases

Jiawei Han, Yongjian Fu

Open publisher page 162 citations

Abstract

Concept hierarchies organize data and concepts in hierarchical]orms or in certain partial order, which helps expressing knowledge and data relationships in databases in concise, high level terms, and thus, plays an important ¯role in knowledge discovery processes. Concept hierarchies could be provided by knowledge engineers, domain experts or users, or embedded in some data relations. However, it is sometimes desirable to automatically generate some concept hierarchies or adjust some given hierarchies for particular learning tasks. In this paper, the issues o] dynamic generation and refinement of concept hierarchies are studied. The study leads to some algorithms for automatic generation of concept hierarchies]or numerical attributes based on data distributions and for dynamic refinement of a given or generated concept hierarchy based on a learning request, the relevant set of data and database statistics. These algorithms have been implemented in the DBLearn knowledge discovery system and tested against large relational databases. The experimental results show that the algorithms are efficient and effective]or knowledge discovery in large databases.

About this research paper

What this paper is about

Concept hierarchies organize data and concepts in hierarchical]orms or in certain partial order, which helps expressing knowledge and data relationships in databases in concise, high level terms, and thus, plays an important ¯role in knowledge discovery processes. Concept hierarchies could be provided by knowledge engineers, domain experts or users, or embedded in some data relations. However, it is sometimes desirable to automatically generate some concept hierarchies or adjust some given hierarchies for particular learning tasks. In this paper, the issues o] dynamic generation and refinement of concept hierarchies are studied. The study leads to some algorithms for automatic generation of concept hierarchies]or numerical attributes based on data distributions and for dynamic refinement of a given or generated concept hierarchy based on a learning request, the relevant set of data and database statistics. These algorithms have been implemented in the DBLearn knowledge discovery system and tested against large relational databases. The experimental results show that the algorithms are efficient and effective]or knowledge discovery in large databases.

Why it matters

OpenAlex reports 162 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Concept hierarchies organize data and concepts in hierarchical]orms or in certain partial order, which helps expressing knowledge and data relationships in databases in concise, high level terms, and thus, plays an important ¯role in knowledge discovery processes. Concept hierarchies could be provided by knowledge engineers, domain experts or users, or embedded in some data relations. However, it is sometimes desirable to automatically generate some concept hierarchies or adjust some given hierarchies for particular learning tasks. In this paper, the issues o] dynamic generation and refinement of concept hierarchies are studied. The study leads to some algorithms for automatic generation of concept hierarchies]or numerical attributes based on data distributions and for dynamic refinement of a given or generated concept hierarchy based on a learning request, the relevant set of data and database statistics. These algorithms have been implemented in the DBLearn knowledge discovery system and tested against large relational databases. The experimental results show that the algorithms are efficient and effective]or knowledge discovery in large databases.

Key concepts: Computer science, Knowledge extraction, Hierarchy, Relational database, Set (abstract data type), Domain knowledge, Domain (mathematical analysis), Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic generation and refinement of concept hierarchies for knowledge discovery in databases — Research Paper | ScholarLens