This paper introduces the idea that conceptual clustering can be performed using connectionist competitive learning. Competitive learning is used to detect clusters of objects and their corresponding (qualitative) descriptions. A genetic algorithm is employed to choose a subset of these descriptions such that the objects matching them form partitions over the population of objects concerned. Hierarchical classification trees are built by recursing the above two steps (competitive learning 'clustering' and genetic algorithm 'partitioning') over the objects matching the descriptions at each node.SCOPUS: cp.pinfo:eu-repo/semantics/publishe
Competitive learning approaches with penalization or cooperation mechanism have been applied to unsu...
In this thesis, a new system for incremental conceptual clustering is presented. Incremental concept...
3 An important structuring mechanism for knowledge bases is building an inheritance hierarchy of cl...
This paper develops a new method for hierarchical clustering. Unlike other existing clustering schem...
Abstract This paper presents a new competitive learning algorithm for data clustering, named the dyn...
This paper develops a new method for hierarchical clustering. Unlike other existing clustering schem...
We introduce a novel algorithm for factorial learning, motivated by segmentation problems in computa...
This paper develops a new method for hierarchical clustering based on a generative dendritic cluster...
An algorithm is described which constructs a hierarchical taxonomy over object sets. The algorithm f...
A general technique is proposed for embedding on-line clustering algorithms based on competitive lea...
Abstract—Clustering in the neural-network literature is gener-ally based on the competitive learning...
In this master’s paper a great attention is paid for multidimensional data analysis by conceptual cl...
Unsupervised competitive learning classifies patterns based on similarity of their input representat...
Competitive learning is an important machine learning approach which is widely employed in artificia...
If the promise of computational modeling is to be fully realized in higher-level cognitive domains s...
Competitive learning approaches with penalization or cooperation mechanism have been applied to unsu...
In this thesis, a new system for incremental conceptual clustering is presented. Incremental concept...
3 An important structuring mechanism for knowledge bases is building an inheritance hierarchy of cl...
This paper develops a new method for hierarchical clustering. Unlike other existing clustering schem...
Abstract This paper presents a new competitive learning algorithm for data clustering, named the dyn...
This paper develops a new method for hierarchical clustering. Unlike other existing clustering schem...
We introduce a novel algorithm for factorial learning, motivated by segmentation problems in computa...
This paper develops a new method for hierarchical clustering based on a generative dendritic cluster...
An algorithm is described which constructs a hierarchical taxonomy over object sets. The algorithm f...
A general technique is proposed for embedding on-line clustering algorithms based on competitive lea...
Abstract—Clustering in the neural-network literature is gener-ally based on the competitive learning...
In this master’s paper a great attention is paid for multidimensional data analysis by conceptual cl...
Unsupervised competitive learning classifies patterns based on similarity of their input representat...
Competitive learning is an important machine learning approach which is widely employed in artificia...
If the promise of computational modeling is to be fully realized in higher-level cognitive domains s...
Competitive learning approaches with penalization or cooperation mechanism have been applied to unsu...
In this thesis, a new system for incremental conceptual clustering is presented. Incremental concept...
3 An important structuring mechanism for knowledge bases is building an inheritance hierarchy of cl...