Rough subspace-based clustering ensemble for categorical data

DOI10.1007/s00500-012-0972-8zbMath1325.68187OpenAlexW1988104581MaRDI QIDQ889921

Can Gao, Witold Pedrycz, Duoqian Miao

Publication date: 9 November 2015

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-012-0972-8

zbMATH Keywords

rough setscategorical dataclustering ensemblefuzzy \(k\)-modescluster cardinality index

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Ensemble learning based on approximate reducts and bootstrap sampling

Uses Software

• ROSETTA

Cites Work

• Analysis of alternative objective functions for attribute reduction in complete decision tables
• From cluster ensemble to structure ensemble
• Hybrid cluster ensemble framework based on the random combination of data transformation operators
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm
• On voting-based consensus of cluster ensembles
• A scalable framework for cluster ensembles
• Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
• Ensembling neural networks: Many could be better than all
• On fuzzy cluster validity indices
• A model of granular data: a design problem with the Tchebyschev FCM
• Rough sets
• 10.1162/153244303321897735
• Knowledge‐Based Clustering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rough subspace-based clustering ensemble for categorical data