Abstract
To structure data, developers of decision support systems are increasingly using “Data Mining” methods and models, including data clustering algorithms. In this paper, the author proposes a clustering algorithm based on the graph theory and fuzzy logic methodology. Unlike the well-known clustering algorithms, where the division of a set of input vectors into groups (clusters) subject to the object similarity principle is determined by measuring the distance to a certain center(s), the formation of clusters is proposed to be done following the principle of pairwise distance of objects from each other by a value not exceeding that set by the decision-maker. The clustering problem key parameters include the distance between the objects and the number of objects in one cluster. The clear and fuzzy approaches to data cluster formation are implemented. In case of the fuzzy approach, the measure of the sample objects’ similarity is determined by the decision-maker based on the fuzzy logic tools. Intended input parameters of this measure depend on the objective function of the problem. The construction of clusters of the required configuration in the fuzzy interpretation of the data clustering issue relies on the decision maker’s (DM) empirical choice of the α-slice in a fuzzy set of the distance between the objects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Classification, clustering, and data mining applications (2021) Proceedings of the meeting of the international federation of classification societies (IFCS), ... Data analysis, and knowledge organization). Gostekhizdat, Moskva
Dan B (2021) Data mining for design and manufacturing: methods and applications (Massive Computing). RGGU, Moskva
Giacomo DR (2021) Computational intelligence in data mining. RGGU, Moskva
Romanov VP (2007) Intellektualnye informatsionnye sistemy v ekonomike: uchebnoe posobie dlya studentov vuzov, obuchayuschikhsya po spetsialnosti “Prikladnaya informatika” i drugim mezhdistsiplinarnym spetsialnostyam. Ekzamen, Moskva
Gary M, Johnson D (1982) Vychislitelnye mashiny i trudnoreshaemye zadachi. Mir, Moskva
Tambieva DA (1999) Matematicheskie modeli i metody dlya vektornoi zadachi o klikakh: dis. ... kandidata fiziko-matematicheskikh nauk: 05.13.16 - Cherkessk
Zykov AA (1987) Osnovy teorii grafov. Moskva
Emelichev VA, Melnikov OI, Sarvanov VI, Tyshkevich RI (1990) Lektsii po teorii grafov. Nauka, Moskva
Badekha IA (2013) Issledovanie klikovykh pokrytii reber grafa. Prikladnaya diskretnaya matematika 1(19):69–83
Kou LT, Stockmeyer LJ, Wong CK (1978) Cliques with regard to keyword conflflicts and intersection graphs. Commun ACM 21(2):135–139. https://doi.org/10.1145/359340.359346
Orlin J (1977) Contentment in graph theory: covering graphs with cliques. Indagat Math 39:406–424. https://doi.org/10.1016/1385-7258(77)90055-5
Gramm J, Guo J, Huffner F, Niedermeier R (2006) Data reduction, exact, and heuristic algorithms for clique cover. In: Proceedings of 8th workshop on algorithm engineering and experiments, Miami, Fl, pp 86–94, 21 January 2006
Cavers MS (2005) Masters thesis, University of Waterloo. http://www.math.uwaterloo.ca/co/graduate-students/fifiles/mmath/MikeCavers.pdf
Perepelitsa VA, Tambieva DA (2009) Sistemy s ierarkhicheskoi strukturoi upravleniya: razrabotka ekonomiko–matematicheskikh i instrumentalnykh metodov, p 240. Finansy i statistika, Moskva
Perepelitsa VA, Tambieva DA (2016) Ob odnom teoretiko-gipergrafovom podkhode resheniya zadachi o klikakh. Materialy XII Mezhdunarodnogo seminara «Diskretnaya matematika i ee prilozheniya», imeni akademika O.B. Lupanova (Moskva, MGU, 20–25 iyunya 2016g.)/Pod redaktsiei O.M. Kasim-Zade, pp 305–308. MGU. Izd-vo mekhaniko-matematicheskogo fakulteta, Moskva
Tambieva DA (2018) Ob odnom podkhode klasterizatsii dannykh v kontekste metodologii “Data Mining”. In: Alekseev VB Romanov, DS Danilov BR (eds) V sbornike: Diskretnye modeli v teorii upravlyayuschikh sistem. Trudy X Mezhdunarodnoi konferentsii. Otvetstvennye redaktory, pp 255–257. MAKS Press, Moskva
Kofman A (1982) Vvedenie v teoriyu nechetkikh mnozhestv. Moskva: Radio i svyaz, p 432
Orlovskii SA (1981) Problemy prinyatiya reshenii pri nechetkoi iskhodnoi informatsii. Nauka, Moskva
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Tambieva, D.A., Shmatko, S.G., Shlaev, D.V. (2022). Elements of Fuzzy Logic in Solving Clustering Problems. In: Tchernykh, A., Alikhanov, A., Babenko, M., Samoylenko, I. (eds) Mathematics and its Applications in New Computer Systems. MANCS 2021. Lecture Notes in Networks and Systems, vol 424. Springer, Cham. https://doi.org/10.1007/978-3-030-97020-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-97020-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97019-2
Online ISBN: 978-3-030-97020-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)