New rough set based maximum partitioning attribute algorithm for categorical data clustering
Clustering a set of data into homogeneous groups is a fundamental operation in data mining. Recently, consideration has been put on categorical data clustering, where the data set consists of non-numerical attributes. However, implementing several existing categorical clustering algorithms is challe...
Saved in:
Main Author: | Jomah Baroud, Muftah Mohamed |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/101497/1/MuftahMohamedJomahBaroudPSC2022.pdf.pdf http://eprints.utm.my/id/eprint/101497/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:150786 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An new algorithm-based rough set for selecting clustering attribute in categorical data
by: Baroud, Muftah Mohamed Jomah, et al.
Published: (2020) -
An Improved Genetic Clustering Algorithm for Categorical Data
by: Jasni, Mohamad Zain, et al.
Published: (2013) -
Empirical analysis of rough set categorical clustering techniques based on rough purity and value set
by: Uddin, Jamal
Published: (2017) -
Rough set approach for categorical data clustering
by: Herawan, Tutut
Published: (2010) -
Discovering attributes dependency for categorical data set based on soft set theory for better decision making
by: Mohd Isa, Awang, et al.
Published: (2015)