3 Citations (Scopus)

Abstract

Clustering algorithms partition data sets into of objects such that the pairwise similarity objects within the same cluster is higher than assigned to different clusters. Defining a measure becomes challenging in the of categorical data and affects the quality meaningfulness of the clusters formed. , the curse of dimensionality diminishes robustness of such measures. This paper introduces (Supervised Clustering with Association Rules) nontraditional algorithm for clustering massive high categorical data. SCAR is robust to the of dimensionality, it relies on association rules an intuitive way to evaluate the similarity between objects and group them.

Original languageEnglish (US)
Title of host publication2008 International Conference on Innovations in Information Technology, IIT 2008
Pages223-227
Number of pages5
DOIs
StatePublished - 2008
Event2008 International Conference on Innovations in Information Technology, IIT 2008 - Al Ain, United Arab Emirates
Duration: Dec 16 2008Dec 18 2008

Other

Other2008 International Conference on Innovations in Information Technology, IIT 2008
CountryUnited Arab Emirates
CityAl Ain
Period12/16/0812/18/08

Fingerprint

Association rules
Clustering algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Berrado, A., & Runger, G. (2008). Clustering massive categorical data with class association rules. In 2008 International Conference on Innovations in Information Technology, IIT 2008 (pp. 223-227). [4781693] https://doi.org/10.1109/INNOVATIONS.2008.4781693

Clustering massive categorical data with class association rules. / Berrado, Abdelaziz; Runger, George.

2008 International Conference on Innovations in Information Technology, IIT 2008. 2008. p. 223-227 4781693.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Berrado, A & Runger, G 2008, Clustering massive categorical data with class association rules. in 2008 International Conference on Innovations in Information Technology, IIT 2008., 4781693, pp. 223-227, 2008 International Conference on Innovations in Information Technology, IIT 2008, Al Ain, United Arab Emirates, 12/16/08. https://doi.org/10.1109/INNOVATIONS.2008.4781693
Berrado A, Runger G. Clustering massive categorical data with class association rules. In 2008 International Conference on Innovations in Information Technology, IIT 2008. 2008. p. 223-227. 4781693 https://doi.org/10.1109/INNOVATIONS.2008.4781693
Berrado, Abdelaziz ; Runger, George. / Clustering massive categorical data with class association rules. 2008 International Conference on Innovations in Information Technology, IIT 2008. 2008. pp. 223-227
@inproceedings{133714d6ce89443e9a06fc3370acae86,
title = "Clustering massive categorical data with class association rules",
abstract = "Clustering algorithms partition data sets into of objects such that the pairwise similarity objects within the same cluster is higher than assigned to different clusters. Defining a measure becomes challenging in the of categorical data and affects the quality meaningfulness of the clusters formed. , the curse of dimensionality diminishes robustness of such measures. This paper introduces (Supervised Clustering with Association Rules) nontraditional algorithm for clustering massive high categorical data. SCAR is robust to the of dimensionality, it relies on association rules an intuitive way to evaluate the similarity between objects and group them.",
author = "Abdelaziz Berrado and George Runger",
year = "2008",
doi = "10.1109/INNOVATIONS.2008.4781693",
language = "English (US)",
isbn = "9781424433971",
pages = "223--227",
booktitle = "2008 International Conference on Innovations in Information Technology, IIT 2008",

}

TY - GEN

T1 - Clustering massive categorical data with class association rules

AU - Berrado, Abdelaziz

AU - Runger, George

PY - 2008

Y1 - 2008

N2 - Clustering algorithms partition data sets into of objects such that the pairwise similarity objects within the same cluster is higher than assigned to different clusters. Defining a measure becomes challenging in the of categorical data and affects the quality meaningfulness of the clusters formed. , the curse of dimensionality diminishes robustness of such measures. This paper introduces (Supervised Clustering with Association Rules) nontraditional algorithm for clustering massive high categorical data. SCAR is robust to the of dimensionality, it relies on association rules an intuitive way to evaluate the similarity between objects and group them.

AB - Clustering algorithms partition data sets into of objects such that the pairwise similarity objects within the same cluster is higher than assigned to different clusters. Defining a measure becomes challenging in the of categorical data and affects the quality meaningfulness of the clusters formed. , the curse of dimensionality diminishes robustness of such measures. This paper introduces (Supervised Clustering with Association Rules) nontraditional algorithm for clustering massive high categorical data. SCAR is robust to the of dimensionality, it relies on association rules an intuitive way to evaluate the similarity between objects and group them.

UR - http://www.scopus.com/inward/record.url?scp=67649511993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649511993&partnerID=8YFLogxK

U2 - 10.1109/INNOVATIONS.2008.4781693

DO - 10.1109/INNOVATIONS.2008.4781693

M3 - Conference contribution

SN - 9781424433971

SP - 223

EP - 227

BT - 2008 International Conference on Innovations in Information Technology, IIT 2008

ER -