Abstract
In many practical situations, it is necessary to cluster given situations, i.e., to divide them into groups so that situations within each group are similar to each other. This is how we humans usually make decisions: instead of taking into account all the tiny details of a situation, we classify the situation into one of the few groups, and then make a decision depending on the group containing a given situation. When we have many situations, we can describe the probability density of different situations. In terms of this density, clusters are connected sets with higher density separated by sets of smaller density. It is therefore reasonable to define clusters as connected components of the set of all the situations in which the density exceeds a certain threshold t. This idea indeed leads to reasonable clustering. It turns out that the resulting clustering works best if we use a Gaussian function for smoothing when estimating the density, and we select a threshold in a certain way. In this paper, we provide a theoretical explanation for this empirical optimality. We also show how the above clustering algorithm can be modified so that it takes into account that we are not absolutely sure whether each observed situation is of the type in which we are interested, and takes into account that some situations “almost” belong to a cluster.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stain, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)
Nasibov, E.N., Ulutagay, G.: A new unsupervised approach for fuzzy clustering. Fuzzy Sets and Systems 158, 2118–2133 (2007)
Nasibov, E.N., Ulutagay, G.: Robustness of density-based clustering methods with various neighborhood relations. Fuzzy Sets and Systems 160, 3601–3615 (2009)
Pal, N.R., Bezdek, J.C.: On the cluster validity for the fuzzy c-means model. IEEE Transactions on Fuzzy Systems 3(3), 370–379 (1995)
Parzen, E.: On the estimation of a probability density function and the mode. Annals of Mathematical Statistics 33, 1065–1076 (1962)
Pedrycz, W., Gomide, F.: An Introduction to Fuzzy Sets. MIT Press, Cambridge (1998)
Rabinovich, S.: Measurement Errors and Uncertainties: Theory and Practice. Springer, New York (2005)
Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures. Chapman & Hall/CRC, Boca Raton (2007)
Zadeh, L.A.: A Note on Z-numbers. Information Sciences 181, 2923–2932 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ulutagay, G., Kreinovich, V. (2014). Density-Based Fuzzy Clustering as a First Step to Learning Rules: Challenges and Solutions. In: Jamshidi, M., Kreinovich, V., Kacprzyk, J. (eds) Advance Trends in Soft Computing. Studies in Fuzziness and Soft Computing, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-319-03674-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-03674-8_34
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03673-1
Online ISBN: 978-3-319-03674-8
eBook Packages: EngineeringEngineering (R0)