Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy Clustering Models and Applications
Fuzzy Clustering Models and Applications
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Matching Software Practitioner Needs to Researcher Activities
APSEC '03 Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
Gene Ontology Friendly Biclustering of Expression Profiles
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
A tutorial on spectral clustering
Statistics and Computing
A method of relational fuzzy clustering based on producing feature vectors using FastMap
Information Sciences: an International Journal
Thematic fuzzy clusters with an additive spectral approach
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Hi-index | 0.00 |
We present a novel methodology for mapping a system such as a research department to a related taxonomy in a thematically consistent way. The components of the structure are supplied with fuzzy membership profiles over the taxonomy. Our method generalizes the profiles in two steps: first, by fuzzy clustering, and then by mapping the clusters to higher ranks of the taxonomy. To be specific, we concentrate on the Computer Sciences area represented by the taxonomy of ACM Computing Classification System (ACM-CCS). We build fuzzy clusters of the taxonomy leaves according to the similarity between individual profiles by using a novel, additive spectral, fuzzy clustering method that, in contrast to other methods, involves a number of model-based stopping conditions. The clusters are not necessarily consistent with the taxonomy. This is formalized by a novel method for parsimoniously elevating them to higher ranks of the taxonomy using an original recursive algorithm for minimizing a penalty function that involves "head subjects" on the higher ranks of the taxonomy along with their "gaps" and "offshoots". An example is given illustrating the method applied to real-world data.