DocumentCode :
3330407
Title :
A fast `parsing´ algorithm for conceptual clustering
Author :
Jaishankar, N. Sanjay
fYear :
1991
fDate :
3-5 Apr 1991
Firstpage :
471
Abstract :
The notion of conceptual clustering was introduced by Michalski in 1980 where he used concepts at a more physical level such as (color=`red´) and (height=`tall´) and so on. Shankar et al. explored the possibility of using a knowledge base in the clustering process. They used concepts at one or more levels higher than the physical level. The author suggests a method which uses only integers during the clustering process. The idea involves reorganizing the knowledge base (KB) used in Shankar et al. and the presentation of a method for clustering, which uses KB so re-organized. The crux of the reorganization involves associating every node in cohesion forest (CF) with a unique integer. This association is made in a `breadth-first-traversal´ fashion for all trees in CF
Keywords :
grammars; knowledge based systems; search problems; trees (mathematics); CF; KB; `breadth-first-traversal; clustering process; cohesion forest; conceptual clustering; integers; knowledge base; parsing; physical level; trees; Clustering algorithms; Erbium; Writing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Applied Computing, 1991., [Proceedings of the 1991] Symposium on
Conference_Location :
Kansas City, MO
Print_ISBN :
0-8186-2136-2
Type :
conf
DOI :
10.1109/SOAC.1991.143922
Filename :
143922
Link To Document :
بازگشت