×

Mountain clustering on non-uniform grids using \(p\)-trees. (English) Zbl 1078.68722

Summary: A new clustering technique is described, which is an improvement on the mountain method (MM) of clustering originally proposed by Yager and Filev. This new technique employs a data driven, hierarchical partitioning of the data set to be clustered, using a “p-tree” algorithm for spatially decomposing the data set. The centroids of data subsets in the terminal nodes of the “p-tree” become the set of candidate cluster centers upon which the iterative cluster center selection process of MM is applied. As the data dimension and/or the number of uniform grid lines used in Yager and Filev’s original technique increases, our approach requires exponentially fewer cluster centers to be evaluated by the MM selection algorithm. Extensive sample data sets are used to illustrate the performance of this new technique.

MSC:

68T05 Learning and adaptive systems in artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI

References:

[4] Chiu, S. L. (1995). ?Extracting Fuzzy Rules for Pattern Classification by Cluster Estimation?, Proceedings of 6th International Fuzzy Systems Association World Congress (IFSA ?95), Sao Paulo, Brazil, 1-4, July.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.