The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A connectionist scheme, namely, σ-<it>F</it>uzzy <it>L</it>attice <it>N</it>eurocomputing scheme or σ-<it>FLN</it> for short, which has been introduced in the literature lately for clustering in a lattice data domain, is employed in this work for computing clusters of directed graphs in a master-graph. New tools are presented and used here, including a convenient inclusion measure function for clustering graphs. A directed graph is treated by σ<it>-FLN</it> as a single datum in the mathematical lattice of subgraphs stemming from a master-graph. A series of experiments is detailed where the master-graph emanates from a Thesaurus of spoken language synonyms. The words of the Thesaurus are fed to σ<it>-FLN</it> in order to compute clusters of semantically related words, namely, <it>hyperwords</it>. The arithmetic parameters of σ<it>-FLN</it> can be adjusted so as to calibrate the total number of hyperwords computed in a specific application. It is demonstrated how the employment of hyperwords implies a reduction, based on the a priori knowledge of semantics contained in the Thesaurus, in the number of features to be used for document classification. In a series of comparative experiments for document classification, it appears that the proposed method favorably improves classification accuracy in problems involving longer documents, whereas performance deteriorates in problems involving short documents.</p>
Text classification, neural networks, clustering, graphs, framework of fuzzy lattices.

V. Petridis and V. G. Kaburlasos, "Clustering and Classification in Structured Data Domains Using Fuzzy Lattice Neurocomputing (FLN)," in IEEE Transactions on Knowledge & Data Engineering, vol. 13, no. , pp. 245-260, 2001.
86 ms
(Ver 3.3 (11022016))