Automatic aspect discrimination in relational data clustering

Horta, Danilo, and Campello, Ricardo J.G.B. (2011) Automatic aspect discrimination in relational data clustering. In: Proceedings of the 11th International Conference on Intelligent Systems Design and Applications. pp. 522-529. From: ISDA 2011: 11th International Conference on Intelligent Systems Design and Applications, 22-24 November 2011, Cordoba, Spain.

[img] PDF (Published Version) - Published Version
Restricted to Repository staff only

View at Publisher Website:


The features describing a data set may often be arranged in meaningful subsets, each of which corresponds to a different aspect of the data. An unsupervised algorithm (SCAD) that performs fuzzy clustering and aspects weighting simultaneously was recently proposed. However, there are several situations where the data set is represented by proximity matrices only (relational data), which renders several clustering approaches, including SCAD, inappropriate. To handle this kind of data, the relational clustering algorithm CARD, based on the SCAD algorithm, has been recently developed. However, CARD may fail and halt given certain conditions. To fix this problem, its steps are modified and then reordered to also reduce the number of parameters required. The improved CARD is assessed over hundreds of real and artificial data sets.

Item ID: 46790
Item Type: Conference Item (Research - E1)
ISBN: 978-1-4577-1676-8
Funders: CNPq, FAPESP
Date Deposited: 05 Jun 2017 02:33
FoR Codes: 01 MATHEMATICAL SCIENCES > 0104 Statistics > 010401 Applied Statistics @ 100%
SEO Codes: 97 EXPANDING KNOWLEDGE > 970101 Expanding Knowledge in the Mathematical Sciences @ 100%
Downloads: Total: 3
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page