CC BY
53
УДК 004.93
FUZZY FORMAL CONCEPT ANALYSIS IN THE CONSTRUCTION OF ONTOLOGIES
V.P. Oficerov1, S.V. Smirnov2
1 Moscow City University, Moscow, Russia OficerovVP@mgpu. ru
2 Institute for the Control of Complex Systems ofRAS, Samara, Russia smirnov@iccs. ru
Abstract
Formal Concept Analysis (FCA) is a rigorous mathematical theory in the "Data mining" research field. It advances the classical approach to the Concept as to a fundamental epistemic element which is determined by extent and intent. FCA is suitable for mining formal ontologies from the experimental data representing Domains of Interest (DI). In this sense Fuzzy FCA (FFCA) is an adaptation of the FCA to real nature of such information. The genesis study of fuzziness of the formal contexts is a new approach, which necessitates the inclusion of special stages of primary data processing into designing ontologies. It is shown that some of the reasons for this fuzziness are inherent in the technology of generating a formal context from experimental data. Other fuzziness factors were revealed during the morphological analysis of the basic empirical structure - the "objects-properties" table. Interpretation of additional information is possible on the basis of elementary methods of fuzzy inference. Lastly, variants of FFCA application for fuzzy ontologies are analyzed.
Key words: formal concept analysis, formal context, formal ontology, incomplete source date, fuzzy inference, fuzzy concept.
Citation: Oficerov VP, Smirnov SV. Fuzzy Formal Concept Analysis in the construction of ontologies. Ontology of designing. 2017; 7(4): 487-495. DOI: 10.18287/2223-9537-2017-7-4-487-495.
Introduction
FCA [1] provides effective ways of solving the problem of automatic formation of conceptual structures, describing the DI, relevant for researchers, according to the classical principles of analytical philosophy and mathematic foundations.
[2] covers the issues of "objective" formation of primary Formal Contexts (FC) of the DI, required for FCA and, in particular, provides the solution of the problem description of structural relations between DI objects. The offered method of knowledge extraction from the empirical data allows the construction of non-uniform semantic networks, which well correspond to the modern vision of computer specifications of DI ontologies [3], which in turn allows naming this technology as Ontological Data Analysis (ODA).
ODA establishes the relation between classical data analysis [4] and FCA, basing on the standard point of view, that the experimental material representing DI has the form of the "Objects-Properties'' Table (OPT). However, it is stated that any measurement can give the special result "None". This result means that either the analyzed object and the measuring procedure are not se-mantically compatible, or that the measured value is outside of the sensitivity interval or the range of measuring equipment. On the other hand, in FCA similar effects are reached as a result of performance the cognitive procedure called "conceptual scaling" [1, 5]. Its essence is subjective splitting of ranges of measurement means for formation of new distinctive objects properties. Somehow or other, "None-conception" considerably changes a paradigm of the experimental data analysis, and OPT can be transformed in FC of DI.
A FC is a triple (G* M, I) consists of two finite set of objects G* (an empirical samples) and set of properties M (the arsenal of measuring procedures which the researcher has), and a binary-relation I between the objects and the properties (i.e., Ie G x M). Each element bij e I is a truth value of the Basic Semantic Proposition (BSP) which has a form of "g object has mj property",
gi e G , mj e M.
FC contains by design three of the four main semantic abstractions - classification, aggregation, association. According to FCA the constructed FC generates the lattice of formal concepts, in which the ordering relationship implements the fourth semantic abstraction - generalization ("is a" relation) - as well.
In this way, ODA automates construction of ontologies on the basis of DI measurements. At the same time, practical problems show that the truth value of BSP is quite often vague, for example, it is formed by an expert, on the basis of experience and intuition. That's why for the indication of validity BSP it is more natural to use the truth values entered by fuzzy or multivalued logics. Therefore one of real problems is the revision of FFCA use results [6-8] for construction of ontologies. For example in FFCA publications practically ignore the very important question on genesis of an of the input data fuzziness. Similar circumstances have induced to analyze sources, the description and the processing of fuzzy FC during construction of ontologies on the basis of the FCA.
1 Genesis of the FC fuzziness
According to traditional OPT methodologies the OPT lines correspond to the objects which were selected by the researcher during DI analysis (i.e. have formed the empirical sample of objects), and the OPT columns reflect the a priori equipment of the researcher in terms of the measuring procedures.
The arsenal of measuring procedures is formed by the researcher subjectively, according to a priori hypotheses about the existence of "simple" measurable properties (Hypotheses about the Properties - PH-hypotheses) of empirical objects, or about the participation of the empirical objects in structural relations (Hypotheses about the Structural relations - SH-hypotheses, SH n PH = 0). At the same time in the general case, for the research of each SH-hypothesis the number of measuring procedures needs to be equal to the arity of the corresponding structural relation. However it is clear, that it is sufficient to limit the analysis by considering only binary relations between objects without impact on the correctness of the conceptual structures description. (We can notice that "simple" properties can be considered as unary relations; however in ODA properties and relations are strictly different. Moreover, the presence of relations between objects is treated as display of the object's inner properties [2].)
Unlike the traditional applied data analysis which in fact proceeds from a priori consistency of all starting hypotheses SH u PH, ODA investigates the common case when the result None can be observed during the execution of any of the measuring procedures. It means that the result of the experiment was inconsistent with the corresponding hypothesis.
Such understanding of the initial DI data formation stage allows to derive an algorithm of FC construction which describes classes of empirical DI objects in terms of their heterogeneity, both by the structure of measurable properties, and by the ability to participate in structural relations: 1) Transform the OPT - matrix A = (aj)i=1,..., r;j=i,..., s - into the incidence matrix "Objects-
Properties" I = (bj)=i,..., r; y=i,..., s:
fl,
b =
if ay Ф None, | 0 in the oppositecase.l
2) Exclude from consideration PH and SH hypotheses which have turned out completely inconsistent in the selected set of empirical objects, which means remove zero columns from I (in case SH-hypotheses remove from I pairs of zero columns, corresponding to each hypothesis).
3) If zero lines are present in I, state the existence of a class of the unidentified objects in DI and introduce a posterior PH-hypothesis of existence of such class of objects. This is done by adding a new column to I, describing the incidence of the introduced special hypothesis and the class of unidentified objects.
4) If only one zero column of a pair of columns, corresponding to an SH-hypothesis is present in I, state (due to "one-way" confirmation of the SH-hypothesis) the existence of some special class of objects in DI, which are not represented in the empirical sample. This is fixed by adding a new line to I, describing the incidence of the newly introduced class of objects and SH-property, which is not validated by the input empirical material.
Step 2 of the algorithm reduces and steps 3 and 4 expand I. The resulting binary matrix which determines the sought FC, will have dimensionp x q, 1 <p < r + |SH|, 1 < q < s + 1.
1.1 The immanent fuzziness of a FC
The analysis of the ODA formal context construction algorithm allows to specify its three sources of fuzziness.
First of all, undoubtedly, step 4 of the algorithm describes only one action options of 2s-1 possible at formation of a line for the unidentified object. Strictly speaking, the incidence matrix I should be expanded not by one, but by 2s-1 lines which will be as a whole the "model" of incompleteness of the input empirical material, which is determined as fulfillment of step 4 precondition. Certainly, this decision is unreasonable.
If we allow using statements of fuzzy logic in ODA, the initial data incompleteness, considered in step 4 can be fixed as different grade of belonging of hypothetically allowable properties to the objects of the newly introduced class:
• for the SH-property, which is not confirmed by empirical material, the grade of belonging is set equal to 1;
• for all other s - 1 properties it is equal to 0.5.
Any measuring procedure can give special result "Failure" which means default of a task of measurement (breakdown, failure of measuring means, abstention at voting, etc.). This is second source of FC fuzziness. Detection of value Failure in OPT cell is reasonable for reflecting in corresponding FC element as the greatest fuzziness of relation "Objects-Properties", i.e. 0.5.
At last, the internal reason of FC fuzziness can be application of fuzzy scales to the conceptual scaling for uniformity elimination of empirical sample G .
For example, if property mj is exposed nominal scaling [5], then OPT column j "is split", i.e. is replaced k (k > 2) columns which are compared with "base mj-terms" of used conceptual scale. The result of measurement of mj determines membership values to the mj-terms entered by a conceptual scale. These values (in case of precise scales - from set {0, 1}, in case of fuzzy scales - from a segment [0, 1]) place in again formed columns of the OPT.
1.2 Extended view for the empirical OPT
Let us analyze the appearance of FC fuzziness which is caused by possible variations of the structure and contents of the input information about DI, taken as the extended view on the empirical OPT.
1.2.1 Presence of the data on repeated object measurements
Usually it is considered, that each measuring procedure, applied to the observed object delivers to OPT the single value aj. Generalizing this statement, it is possible to admit that OPT is a hypermatrix A = (a^ );=i,..., r; j=i,..., s, where aiy = (a^y )/=1v.., is a vector of values which records the
repeated measurements of property mj of object g.
Then in view of told in subitem 1.1 the step 1 of the FC construction algorithm should be executed as follows:
• <1.a> Transform OPT - hypermatrix A to binary hypermatrix I(h) = (by )i=1>m> r; j=1>m> s, where
by = (b(y)/ )/=i,..., i„ and
b(y)/ =
a,
(y)/'
0,
0.5, 1
if the column j is the m, term,
J J
if a(j)/ = None,
if a,
Failure,
in the oppositecase.
• <1.b> Construction of the fuzzy relation "Objects-Properties" I uniting results of repeated properties measurements of objects. Hypermatrix /h) contains these results as sets of independent estimations of the truth value for everyone BSP determined by this matrix. The fuzzy logic supposes various ways for combination of these estimations. We prefer a method of "amplification-averaging" - to a special case of combination on the basis of composite addition according to triangulated s-norm x © y = min(1, x + y):
I = (fyK..., r; j=1,..., . bj = -1 £l=1b(j)i .
ij
1.2.2 Considering the level of trust to sources
Commonly, all measuring procedures are by default considered as the set of authentic data sources about DI. It is easy to imagine a situation when the researcher differentiates his trust and supplies the OPT with a vector (tjj^,..., s, where tj e [0, 1] - is the degree of belonging of measuring procedure j to the set of authentic sources.
The degree tj is to combine with the truth value of BSP which was made by the source j. Among possible ways of fuzzy measures combination here we prefer composite multiplication according to triangulated t-norm x • y = xy. Thus, the step 1 of the FC construction algorithm should be continued by the following transformation of the "Objects-Properties" relation:
• <1.c> I ^ I: bj := tjbij.
1.2.3 Plurality of substantially equivalent sources
A rather widespread practical approach in research is the use of several independent authentic sources for evaluating the same factor. It is obvious that this situation does not differ from analyzed above a case of repeated object measurements. As before for the complex estimation of the truth value of everyone BSP reasonable a method of "amplification-averaging". Therefore the step 1 of the FC construction algorithm should be supplemented with one more transformation of the "Objects-Properties" relation:
• <1d> I ^ l. bj) =rff £
J.
JjeJm
where J1,.,Ji is the sets of congruent column indexes of OPT, Jn n Jm = 0 at m ^ n (m, n = 1,..., l), |Jm| > 1.
Thus the number of columns of I decreases up to the value s +1 - ^/m-11'Jm \.
2 Fuzzy formal context processing
It's assumed that a special type of FCA is used for fuzzy FC procession - fuzzy FCA or FFCA. It's only partially true, because FFCA combines quite dissimilar group of methods:
• alpha-section method for fuzzy FC which used for crisp sets output into ODA [8];
• alpha-section method for fuzzy FC, when FC interprets as a complex of fuzzy properties each of which describes one of the fuzzy FC objects [8-10]. That one-sided preference for objects is used for fuzzy concept lattices construction, which can be considered as fuzzy ontologies "skeletons". Theoretically there is an alternative view, when preference is given to properties (that's why another name of this method is asymmetric threshold scheme);
• approach that uses fuzzy set closure operator [11]. This approach represents fuzzy FC as a whole (i.e. without preference for objects or properties) and doesn't use threshold. Today this complicated in theoretical and computational ways method arouses only academic interest because it generates huge amount of fuzzy concepts even for small-sized "sparse" fuzzy FC.
Let us take a detailed look on alpha-section fuzzy FC method variations.
2.1 Crisp ontologies output in ODA
The correspondence I of a FC fuzzy (as any fuzzy relation) can be decomposed by its crisp relations of level c g (0, 1]:
I = ^>ce (0, 1] C/C,
b(c)j J1' if bj >C; l
[0 in the oppositecase.J Every crisp (binary) relation /c), or c-approximation fuzzy relation I, clearly determines crisp FC in logical sense:
• all BSP of initial fuzzy FC are preserved;
• all BSP, which truth value doesn't reach c - chosen by user DI initial data confidence threshold, - are considered as false, the rest are considered as true.
ODA is limited by this well-defined method1 and crisp ontology output from fuzzy FC alpha-section by classic FCA.
It is easy to show, that finite number of different DI crisp ontologies can be obtained by varying of c threshold in this fuzzy FC [7]. In this case, and with hardening or considerably easing requirements for BSP truth value, the impoverishment effect of ontology specifications - the amount of concepts reduction and defined in this concept set order degradation - can be theoretically predicted and experimentally approved.
2.2 Fuzzy concepts
According to the scheme of the asymmetric threshold the construction of crisp conceptual structure, which is considered to be the final result in ODA, is only the first stage. The second and final
1 In fact, the application of the standard alpha-section procedure here is in general not correct because it does not take into account the relationship between the measured properties. Models of "properties existence constraints" (the term of [12]) and a correct heuristic alpha-section method are proposed in [13, 14].
stage of this method is the fuzzification of the created crisp formal concepts. Detected at the first stage partial order relation «is a» between the concepts remains crisp.
In the context of «a-crisp» FC (G* M, /a)) a formal concept is defined by the volume X e G and content YeM, where X' = Y and Y' = X, and «'» is a Galois operator [1]. Asymmetric threshold scheme prescribes to convert each found crisp formal concept (X, Y) into the fuzzy one with saving a crisp content, but with the reconstruction of fuzzy volume based on initial fuzzy FC (G , M, I):
(X, Y) ~> X Y),
where Xf - is a fuzzy set with the universum X, such that for every x e X membership value to Xf is defined by the truth value of BSP conjunction for each Y - properties that make up the content of a fuzzy concept. Usually it is offered to evaluate this membership value by using the min-conjunction:
¡u(x e Xf) = miny e Y I(x, y).
It seems that protagonists of the scheme of the asymmetric threshold in FFCA make two diverse but related errors.
At first, the fundamental methodological error should be noted. The proposed method of constructing fuzzy concepts is positioned as data mining technique, but its result directly involves a training empirical selection of DI items! It's like to find in Newton's second law the weight of an apple fallen on his head!
Indeed, the obtained membership function of an arbitrary DI object to the volume of fuzzy concept (Xf, Y) is defined in the end only as parts of training sample- for x e Xe G . This means that, generally speaking, it is impossible to attribute an arbitrary object of investigated DI to the any of constructed fuzzy sets (i.e. to classify object). Equally it is impossible to use constructed concept system to describe an arbitrary DI object (i.e. to generate an information model of an object).
In general, it must be noted that this actively promoted approach to the construction of fuzzy ontology needs a radical development of ways to eliminate the influence of the training sample on the empirical data analysis result. In this sense, change of preference in asymmetry scheme in favor of DI properties seems to be more promising.
The second error of an asymmetric threshold scheme is the thesis that conjunction of BSP for all properties of fuzzy concept is a unique requirement of fuzzy concept definition. Calculation of an estimation of the truth value of specified BSP conjunction looks as unsuccessful attempt of empirical data generalization, which only masks the basic methodological problem of considered method FFCA. To recognize a similar estimation as the description of fuzzy concept, its calculation needs to be anticipated, at least, combination of BSP truth value on each property (here would be again reasonable to use a method of "amplification - averaging").
3 About the practical application
We used elements of the approach, presented in the paper, in many cases where there was a need for structured object domains description in decision support applications, in particular:
■ designing color scheme of UI elements of software tools in order to improve usability;
■ designing ontology driven subject-oriented interface to large relational databases;
■ determining target population groups during the formation of state social support programs;
■ market research.
Unfortunately, corresponding examples are too big for the paper, but we can relate to the published result of car market research, based on users' preferences [15].
In any case, these heterogeneous examples are common due to well-defined input data characteristics. Opinions about object attributes were presented by expert focus groups, users or just non-
related persons, and this data was both complementing and contradictory. One source could contain much more data than the other, while customers trust was uneven to different sources. We found that in general case, the result of such consolidation is a fuzzy formal context, which is processed differently from the conventional one (but it reduces to the usual case).
Conclusion
■ In the paper the need for using the fuzzy logic paradigm in the method of ontologies construction on the basis of Formal Concept Analysis has been proven.
■ The morphological analysis of the possible extensions of the "Objects-Properties" Table - the standard form of the initial information about the object domain being researched, and the use of basic algorithms of fuzzy conclusions allowed to construct additional models of various situations which result in the formation of fuzzy Formal Contexts describing the researched domain of interest.
■ Obtaining the intermediate result of the Ontological Data Analysis in the form of fuzzy Formal Context does not lead to the revision of the ontology construction method itself, based on principles of Formal Concept Analysis, but additionally demands making decisions about the value of trust to the input data threshold.
■ The current approach to construction of fuzzy ontologies based on Formal Concept Analysis is criticized because of obvious methodological mistakes. The analysis of these mistakes allows us to hope for constructive development of a method of creating fuzzy conceptual structures.
References
[1] Ganter B, Wille R. Formal Concept Analysis. Mathematical foundations. Springer Berlin-Heidelberg, 1999.
[2] Smirnov SV. Ontological analysis of modeling domain [In Russian]. Bulletin of the Samara Scientific Center of RAS, 2001. 3(1): 62-70.
[3] Guarino N. Formal ontology, conceptual analysis and knowledge representation. Int. J. of Human Computer Studies 1995; 43(5/6): 625-640.
[4] ZagoruykoNG. Applied methods of data and knowledge analysis [In Russian]. Novosibirsk: Sobolev Institute of Mathematics, SB RAS, 1999.
[5] Ganter B, Wille R. Conceptual scaling. In: F. Roberts (Ed.): Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. Springer-Verlag New York; 1989: 139-167.
[6] Pollandt S. Fuzzy Concepts: Formal Concept Analysis of fuzzy Data [In German]. - Berlin-Heidelberg: SpringerVerlag, 1997.
[7] Smirnov SV. Building knowledge domain ontologies with structural relationships based on Formal Concept Analysis [In Russian]. Proc. 3rd All-Russian Conf. "Knowledge-Ontologies-Theories" (Novosibirsk, Russia, October 3-5, 2011). Vol. 2. Novosibirsk: Sobolev Institute of Mathematics, SB of RAS; 2011: 103-112.
[8] Tho QT, Hui SC, Fong ACM, Cao TH. Automatic Fuzzy Ontology Generation for the Semantic Web. IEEE Trans. on Knowledge and Data Engineering, 2006; 18(6): 842-856.
[9] Yang KM, Kim EH, Hwang SH, Choi SH. Fuzzy Concept Mining based on Formal Concept Analysis. Int. J. of Computers, 2008; 2(3): 279-290.
[10] De Maio C, Fenza LV, Senatore S. Towards Automatic Fuzzy Ontology Generation // Proc. of the 2009 IEEE International Conference on Fuzzy Systems (Jeju Island, Korea, 2009, August 20-24): 1044-1049.
[11] Belohlavek R, De Baets B, Outrata B, Vychodil J. Computing the lattice of all fixpoints of a fuzzy closure operator. IEEE Trans. on Fuzzy systems, 2010; 18(3): 546-557.
[12] Lammari N, Metais E. Building and maintaining ontologies: a set of algorithms. Data & Knowledge Engineering, 2004; 48(2): 155-176.
[13] Oficerov VP, Smirnov VS, Smirnov SV. Alpha-section of non-strict formal contexts in Formal Concept Analysis [In Russian]. Proc. of XVI Int. Conf. "Complex systems: Control and Modeling Problems" (Samara, Russia, 2014, June 30 - July 03). Samara: Samara Scientific Center of RAS; 2014: 228-244.
[14] Samoilov DE., Semenova VA, Smirnov SV. Incomplete data analysis of for building formal ontologies [In Russian]. Ontology of designing. 2016; 6(3): 317-339.
[15] Vinogradov ID, Vittikh VA, Karpov VM, Moscalyuk AN, Smirnov SV. Automobile marketing based on ontologies of user's needs. Advances in Concurrent Engineering: Proc. of the 9-th ISPE Int. Conf. on Concurrent Engineering: Research and Applications (Cranfield, United Kingdom, 2002, July 27-31). Eds.: R. Gonçales, R. Roy, A. Steiger-Garçao. Series Editor: B. Prasad. Balkema Pablishers; 2002: 653-659.
НЕЧЁТКИЙ АНАЛИЗ ФОРМАЛЬНЫХ ПОНЯТИЙ ПРИ РАЗРАБОТКЕ ОНТОЛОГИЙ
1 2 В.П. Офицеров , С.В. Смирнов
1 Московский городской педагогический университет, Москва, Россия OficerovVP@mgpu. ru
2 Институт проблем управления сложными системами РАН, Самара, Россия smirnov@iccs. ru
Аннотация
Анализ формальных понятий (АФП) - строгая математическая теория анализа данных, в которой отражен классический подход к понятию как к фундаментальному эпистемологическому элементу, определяемому объемом и содержанием. АФП пригоден для вывода формальных онтологий из экспериментальных данных, представляющих предметные области, и в этом смысле нечёткий АФП (НАФП) - адаптация метода к реальному характеру этой информации. Новым является исследование генезиса нечёткости формальных контекстов, что вызывает необходимость включения в орбиту вывода онтологий специальных этапов первичной обработки данных. Показано, что некоторые причины рассматриваемой нечёткости имманентны технологии порождения формального контекста из экспериментальных данных. Другие факторы этой нечёткости выявлены в ходе морфологического анализа базовой эмпирической структуры - таблицы «объекты-свойства». Показано, что интерпретация дополнительной информации возможна с помощью элементарных приёмов нечёткого вывода. С критических позиций проанализированы варианты применения НАФП для построения нечётких онтологий.
Ключевые слова: анализ формальных понятий, формальный контекст, формальная онтология, неполнота измерительной информации, нечёткий вывод, нечёткое понятие.
Цитирование: Ofwerov, V.P. Fuzzy Formal Concept Analysis in the construction of ontologies / V.P. Ofkerov, S.V. Smirnov // Онтология проектирования. - 2017. - Т. 7, №4(26). - С. 487-495. - DOI: 10.18287/2223-9537-20177-4-487-495.
Список источников
[1] Ganter, B. Formal Concept Analysis. Mathematical foundations / B. Ganter, R. Wille. - Berlin-Heidelberg: Springer-Verlag, 1999. - 290 p.
[2] Смирнов, С.В. Онтологический анализ предметных областей моделирования / С.В. Смирнов // Известия Самарского научного центра РАН. - 2001. - Т. 3, № 1. - С. 62-70.
[3] Guarino, N. Formal ontology, conceptual analysis and knowledge representation / N. Guarino // Int. J. of Human Computer Studies. - 1995. - Vol. 43. №. 5/6. - P. 625-640.
[4] Загоруйко, Н.Г. Прикладные методы анализа данных и знаний / Н.Г. Загоруйко. - Новосибирск: Институт математики СО РАН, 1999. - 270 с..
[5] Ganter, B. Conceptual scaling / B. Ganter, R. Wille // In: F. Roberts (Ed.): Applications of Combinatorics and Graph Theory to the Biological and Social Sciences. - New York Springer-Verlag, 1989. - Р. 139-167.
[6] Pollandt, S. Fuzzy-Begriffe: Formale Begriffsanalyse unscharfer Daten / S. Polland. - Berlin-Heidelberg: Springer-Verlag, 1997. - 146 p.
[7] Смирнов, С.В. Нечёткие формальные контексты при построении онтологий на основе анализа формальных понятий: происхождение и использование / С.В. Смирнов // Знания - Онтологии - Теории: Материалы Всероссийской конф. с международным участием ЗОНТ-2007 (14-16 сентября 2007 г., Новосибирск, Россия). Т. 2. - Новосибирск: Институт математики СО РАН, 2007. - С. 17-25.
[8] Tho, Q.T. Automatic Fuzzy Ontology Generation for the Semantic Web / Q.T. Tho, S.C. Hui, A.C.M. Fong, T.H. Cao // IEEE Transactions on Knowledge and Data Engineering. - 2006. - Issue 6, Vol. 18. - P. 842-856.
[9] Yang, K.M. Fuzzy Concept Mining based on Formal Concept Analysis / K.M. Yang, E.H. Kim, S.H. Hwang, S.H. Choi // Int. J. of Computers. - 2008. - Issue 3, Vol. 2. - P. 279-290.
[10] De Maio, C. Towards Automatic Fuzzy Ontology Generation / C. De Maio, L.V. Fenza, S. Senatore // Proc. of the 2009 IEEE International Conference on Fuzzy Systems (Jeju Island, Korea, 2009, August 20-24). - P. 1044-1049.
[11] Belohlavek, R. Computing the lattice of all fixpoints of a fuzzy closure operator / R. Belohlavek, B. De Baets, B. Outrata, J. Vychodil // IEEE Trans. on Fuzzy systems. - 2010. - Issue 3, Vol. 18. - P. 546-557.
[12] Lammari, N. Building and maintaining ontologies: a set of algorithms / N. Lammari , E. Metais // Data & Knowledge Engineering. - 2004. - Vol. 48(2). - P. 155-176.
[13] Офицеров, В.П. Метод альфа-сечения нестрогих формальных контекстов в анализе формальных понятий / В.П. Офицеров, В.С. Смирнов, С.В. Смирнов // Проблемы управления и моделирования в сложных системах: Труды XVI междунар. конф. (30 июня - 03 июля 2014 г., Самара, Россия). - Самара: СамНЦ РАН, 2014. - С. 228-244.
[14] Самойлов, Д.Е. Анализ неполных данных в задачах построения формальных онтологий / Д.Е. Самойлов, В.А. Семенова, С.В. Смирнов // Онтология проектирования. - 2016. - Т. 6, №3(21). - С. 317-339.
[15] Виноградов, И.Д. Изучение автомобильного рынка на основе онтологий потребительских предпочтений / И.Д. Виноградов, В.А. Виттих, В.М. Карпов, А.Н. Москалюк, С.В. Смирнов // Вестник компьютерных и информационных технологий. - 2005. - № 1. - С. 2-7.
Сведения об авторах
Г
Офицеров Владимир Петрович, 1953 г. рождения. Окончил Куйбышевский авиационный институт им. С.П. Королёва в 1975 г., к.т.н. (1982). Доцент кафедры прикладной информатики Московского городского педагогического университета, заместитель заведующего кафедрой по научной работе. В списке научных трудов более 70 работ в области прикладной математики, информационных технологий, прогнозирования развития сложных социально-технических систем.
Vladimir Petrovich Officerov (b. 1953) graduated from the Korolyov aerospace Institute (Kuibyshev-city) in 1975, PhD (1982). Hi is Associate Professor at Moscow City University (Department of applied computer science), Deputy Head of the Department for Research. He is coauthor of about 100 scientific articles and abstracts in applied mathematics, information technology, forecasting the development of complex socio-technical systems.
Смирнов Сергей Викторович, 1952 г. рождения. Окончил Куйбышевский авиационный институт им. С.П. Королёва в 1975 г., д.т.н. (2002). Заместитель директора Института проблем управления сложными системами РАН, и.о. заведующего кафедрой «Инженерия знаний» Поволжского государственного университета телекоммуникаций и информатики. Член Российской ассоциации искусственного интеллекта. В списке научных трудов более 170 работ в области прикладной математики, компьютерного моделирования сложных систем, создания интеллектуальных систем поддержки принятия решений в технологических и организационных сферах.
Sergey Victorovich Smirnov (b. 1952) graduated from the Korolyov aerospace Institute (Kuibyshev-city) in 1975, D. Sc. Eng. (2002). Deputy director at Institute for the Control of Complex Systems of Russian Academy of Sciences, acting head of department Knowledge engineering of Povolzhsky State University of Telecommunication and Informatics. Hi is member of Russian Association of Artificial Intelligence. In the list of scientific works more than 170 works in the field of applied mathematics, complex systems simulation and development knowledge based decision support systems in control and management.
