Zobrazeno 1 - 10
of 500
pro vyhledávání: '"Lattice Miner"'
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2018, 249, pp.135-150. ⟨10.1016/j.dam.2016.11.021⟩
Discrete Applied Mathematics, Elsevier, 2018, 249, pp.135-150. ⟨10.1016/j.dam.2016.11.021⟩
It is well-known inside the Formal Concept Analysis (FCA) community that a concept lattice could have an exponential size with respect to the input data. Hence, the size of concept lattices is a critical issue in large real-life data sets. In this pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6dd7c334f736fed56e66c7a2edbe564
https://doi.org/10.1016/j.dam.2016.11.021
https://doi.org/10.1016/j.dam.2016.11.021
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 743, pp.93-109. ⟨10.1016/j.tcs.2016.11.021⟩
Theoretical Computer Science, Elsevier, 2018, 743, pp.93-109. ⟨10.1016/j.tcs.2016.11.021⟩
Concept lattices and closed set lattices are graphs with the lattice property. They have been increasingly used this last decade in various domains of computer science, such as data mining, knowledge representation, databases or information retrieval
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20c01339d7460a036d85910fd01d9e43
https://doi.org/10.1016/j.tcs.2016.11.021
https://doi.org/10.1016/j.tcs.2016.11.021
Publikováno v:
Information Sciences. 429:361-376
In recent years, the increasing complexity of real problems has directed the attention of many types of research, especially those handling large datasets. Formal concept analysis (FCA), for instance, is an increasingly growing research field. It is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da4b8e29f8a7fbdd1dcfdfdf55b92471
https://doi.org/10.1016/j.ins.2017.11.028
https://doi.org/10.1016/j.ins.2017.11.028
Publikováno v:
Fuzzy Sets and Systems. 333:36-53
We propose a probabilistic approach to the issue of one-sided fuzzy formal concepts stability. The modified Rice–Siff algorithm represents a crisp index how to select the relevant concepts from the set of all one-sided fuzzy formal concepts. We sug
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d6bcd00cad4969db1c69bb6883d65dc
https://doi.org/10.1016/j.fss.2017.04.006
https://doi.org/10.1016/j.fss.2017.04.006
Autor:
Hua Mao
Publikováno v:
Journal of the Indonesian Mathematical Society, Vol 23, Iss 1, Pp 13-26 (2017)
Formal concept analysis is a method of exploratory data analysisthat aims at the extraction of natural cluster from object-attributedata tables. We present a way to add user's background knowledge toformal concept analysis. The type of background kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e7cc0f6b8db0bdb5e6157f16d412f6c
https://jims-a.org/index.php/jimsa/article/view/197
https://jims-a.org/index.php/jimsa/article/view/197
Autor:
Prem Kumar Singh
Publikováno v:
Neural Processing Letters. 48:31-52
Recently, the theory of Formal Concept Analysis is extensively studied with bipolar fuzzy setting for adequate analysis of vagueness in fuzzy attributes via a defined sharp boundary. However, many real life data sets contain vague attributes (i.e. be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7194427cc969c9f1c30465f1b2001655
https://doi.org/10.1007/s11063-017-9699-y
https://doi.org/10.1007/s11063-017-9699-y
Autor:
Sérgio M. Dias, Newton J. Vieira
Publikováno v:
Information Sciences. 396:202-217
Independent methodology for analysis of concept lattice reduction.We use sets of proper implications holding in the original and reduced structure.Highlight the kinds of changes propitiated by the different classes of techniques.Four reduction techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee1ec73d8904c5f733d546f7bb427fc7
https://doi.org/10.1016/j.ins.2017.02.037
https://doi.org/10.1016/j.ins.2017.02.037
Publikováno v:
Journal of Computational and Applied Mathematics. 318:388-402
Attribute reduction and size reduction in concept lattices are key research topics in Formal Concept Analysis (FCA). This paper combines both strategies in the multi-adjoint concept lattice framework in order to simplify the information provided by t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44778923e0d937c3d7db195b01e1bd4f
https://doi.org/10.1016/j.cam.2016.07.012
https://doi.org/10.1016/j.cam.2016.07.012
Autor:
Gabriel Ciobanu, Cristian Văideanu
Publikováno v:
Fuzzy Sets and Systems. 317:121-132
Factorization by similarity is a mathematical technique used in formal concept analysis with fuzzy attributes for reducing the complexity of different types of fuzzy concept lattices. In this paper we find the structure of the factor lattice of a fuz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b155e2e7b838c2e8bc09f4475e07f6b9
https://doi.org/10.1016/j.fss.2016.07.004
https://doi.org/10.1016/j.fss.2016.07.004
Autor:
Ming-Wen Shao, Ke-Wen Li
Publikováno v:
Information Sciences. 378:317-327
In this paper, we present a new pair of adjoint mappings between a power set and the direct product of complete lattices. The proposed pair of adjoint mappings form a Galois connection and the corresponding concept lattice is constructed from a gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91055e069ff615c0414f314de502214d
https://doi.org/10.1016/j.ins.2016.03.018
https://doi.org/10.1016/j.ins.2016.03.018