go-v.orgdoi

Hierachical Clustering For Data Mining By RBF Network

Ö. Ciftcioglu, Sevil Sarıyıldız · container not stated · 2000

  • DOI 10.2495/data000461
  • Publisher OpenAlex
  • Type article
  • Issued 2000

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

· OpenAlex · article · 2000

Abstract

Clustering is one of the dominant techniques of exploratory data analysis. In the context of data mining, one of the powerful clustering methods is the method of orthogonal least squares (OLS) applied to radial basis functions (RBF) network. However, for data mining case, conventional utilization of OLS learning is not desirable even though the learning process feasible for an amount of data at hand. This is due to the fact that some dominant associations in the data can easily obscure many interrelations of interest among the data at hand and also because of this, the rest of the associations for identification can heavily be limited.

Therefore, as novel RBF clustering for data mining, the data set is separated into several subsets so that each subset is subjected to clustering separately. The dominant clusters in each subset are accumulated throughout the modular processing of total data set. The newly formed reduced data set which comprises the patterns from the clusters of the subsets, is subjected to final RBF network clustering by OLS for hierarchical cluster gradation of the subsets to identify the existing interrelations being searched for. In this way the associations are discovered in a perspective without obscurity caused by some strong but local associations in the given data set.

The paper deals with the details of the novel RBF clustering for data mining.

Open the resolved locator · 10.2495/data000461

Metadata licence: OpenAlex metadata (CC0)