增强现实AR>> fcaR>> 返回
项目作者： neuroimaginador

项目描述 ：
Tools for Formal Concept Analysis
高级语言： R
项目地址: git://github.com/neuroimaginador/fcaR.git
创建时间： 2019-05-07T14:00:26Z
项目社区：https://github.com/neuroimaginador/fcaR
开源协议：GNU General Public License v3.0
下载


fcaR: Tools for Formal Concept Analysis

Lifecycle: stable
CRAN status
codecov
R build status
Downloads

The aim of this package is to provide tools to perform fuzzy formal
concept analysis (FCA) from within R. It provides functions to load and
save a Formal Context, extract its concept lattice and implications. In
addition, one can use the implications to compute semantic closures of
fuzzy sets and, thus, build recommendation systems.

Details

The fcaR package provides data structures which allow the user to work
seamlessly with formal contexts and sets of implications. More
explicitly, three main classes are implemented, using the
object-oriented-programming paradigm in R:

  • FormalContext encapsulates the definition of a formal context (G, M,
    I), being G the set of objects, M the set of attributes and I the
    (fuzzy) relationship matrix, and provides methods to operate on the
    context using FCA tools.
  • ImplicationSet represents a set of implications over a specific formal
    context.
  • ConceptLattice represents the set of concepts and their relationships,
    including methods to operate on the lattice.

Two additional helper classes are implemented:

  • Set is a class solely used for visualization purposes, since it
    encapsulates in sparse format a (fuzzy) set.
  • Concept encapsulates internally both extent and intent of a formal
    concept as Set.

Since fcaR is an extension of the data model in the arules package, most
of the methods and classes implemented interoperates with the main S4
classes in arules (transactions and rules).

Installation

This package is available at CRAN, so its stable version can be easily
installed using:

  1. install.packages("fcaR")

The development version of this package can be installed with

  1. remotes::install_github("neuroimaginador/fcaR", build_vignettes = TRUE)

or

  1. remotes::install_github("Malaga-FCA-group/fcaR", build_vignettes = TRUE)

Example of Use

Let us start with a fuzzy dataset (stored in a matrix I) as follows:







































































P1

P2

P3

P4

P5

P6

O1

0.0

1.0

0.5

0.5

1.0

0

O2

1.0

1.0

1.0

0.0

0.0

0

O3

0.5

0.5

0.0

0.0

0.0

1

O4

0.0

0.0

0.0

1.0

0.5

0

O5

0.0

0.0

1.0

0.5

0.0

0

O6

0.5

0.0

0.0

0.0

0.0

0

Here, a value $x$ in the intersection of a row and a column indicates
that the object of the corresponding row possesses the attribute in the
column in a degree of at least $x$ (if $x = 0$, the attribute is absent
in the object, and if $x = 1$, the attribute is fully present in the
object).

We can build a FormalContext object:

  1. fc <- FormalContext$new(I)
  3. print(fc)
  4. #> FormalContext with 6 objects and 6 attributes.
  5. #>      P1   P2   P3   P4   P5  P6  
  6. #>  O1  0    1   0.5  0.5   1    0  
  7. #>  O2  1    1    1    0    0    0  
  8. #>  O3 0.5  0.5   0    0    0    1  
  9. #>  O4  0    0    0    1   0.5   0  
  10. #>  O5  0    0    1   0.5   0    0  
  11. #>  O6 0.5   0    0    0    0    0

With a single function, we can compute the set of concepts:

  1. # Compute all concepts
  2. fc$find_concepts()
  4. # The first concept
  5. fc$concepts$sub(1)
  6. #> ({O1, O2, O3, O4, O5, O6}, {})
  8. # And plot the concept lattice
  9. fc$concepts$plot()

We can also extract implications from the formal context:

  1. # Extract implications
  2. fc$find_implications()
  4. # Which implications have been extracted
  5. fc$implications
  6. #> Implication set with 12 implications.
  7. #> Rule 1: {P6 [0.5]} -> {P1 [0.5], P2 [0.5], P6}
  8. #> Rule 2: {P5 [0.5]} -> {P4 [0.5]}
  9. #> Rule 3: {P3 [0.5], P4 [0.5], P5 [0.5]} -> {P2, P5}
  10. #> Rule 4: {P3 [0.5], P4} -> {P3}
  11. #> Rule 5: {P2 [0.5], P4 [0.5]} -> {P2, P3 [0.5], P5}
  12. #> Rule 6: {P2 [0.5], P3 [0.5]} -> {P2}
  13. #> Rule 7: {P2, P3, P4 [0.5], P5} -> {P4}
  14. #> Rule 8: {P1 [0.5], P4 [0.5]} -> {P1, P2, P3, P4, P5, P6}
  15. #> Rule 9: {P1 [0.5], P3 [0.5]} -> {P1, P2, P3}
  16. #> Rule 10: {P1 [0.5], P2} -> {P1}
  17. #> Rule 11: {P1, P2 [0.5]} -> {P2}
  18. #> Rule 12: {P1, P2, P3, P6} -> {P4, P5}

Some fundamental functionalities on the concept lattice associated to
the formal context have been implemented:

  • Computing a sublattice.
  • Calculating the subconcepts and superconcepts of a given concept.
  • Finding the join- and meet- irreducible elements, which allows to
    reduce the context and find the standard context.

Also, one can compute the support of both implications and concepts:

  1. fc$implications$support()
  2. #>  [1] 0.1666667 0.3333333 0.1666667 0.0000000 0.1666667 0.3333333 0.0000000
  3. #>  [8] 0.0000000 0.1666667 0.1666667 0.1666667 0.0000000
  4. fc$concepts$support()
  5. #>  [1] 1.0000000 0.5000000 0.3333333 0.1666667 0.1666667 0.1666667 0.0000000
  6. #>  [8] 0.5000000 0.3333333 0.3333333 0.1666667 0.0000000 0.5000000 0.3333333
  7. #> [15] 0.3333333 0.1666667 0.1666667 0.0000000 0.5000000 0.3333333 0.1666667
  8. #> [22] 0.1666667 0.1666667 0.0000000 0.1666667 0.0000000

In this package, we have implemented a logic to manage implications.
This so-called Simplification Logic allows us to simplify the extracted
rules by removing redundancies, as well as computing the closure of a
given fuzzy attribute set.

  1. # Reduce the number of implications using two simple
  2. # rules. The algorithm applies the specified rules
  3. # in batches, if the number of rules is high.
  4. fc$implications$apply_rules(rules = c("composition",
  5.                                       "generalization"))
  6. #> Processing batch
  7. #> --> Composition: from 12 to 12 in 0.001 secs.
  8. #> --> Generalization: from 12 to 12 in 0.001 secs.
  9. #> Batch took 0.004 secs.
  11. # Reduced set of implications
  12. fc$implications
  13. #> Implication set with 12 implications.
  14. #> Rule 1: {P6 [0.5]} -> {P1 [0.5], P2 [0.5], P6}
  15. #> Rule 2: {P5 [0.5]} -> {P4 [0.5]}
  16. #> Rule 3: {P3 [0.5], P4 [0.5], P5 [0.5]} -> {P2, P5}
  17. #> Rule 4: {P3 [0.5], P4} -> {P3}
  18. #> Rule 5: {P2 [0.5], P4 [0.5]} -> {P2, P3 [0.5], P5}
  19. #> Rule 6: {P2 [0.5], P3 [0.5]} -> {P2}
  20. #> Rule 7: {P2, P3, P4 [0.5], P5} -> {P4}
  21. #> Rule 8: {P1 [0.5], P4 [0.5]} -> {P1, P2, P3, P4, P5, P6}
  22. #> Rule 9: {P1 [0.5], P3 [0.5]} -> {P1, P2, P3}
  23. #> Rule 10: {P1 [0.5], P2} -> {P1}
  24. #> Rule 11: {P1, P2 [0.5]} -> {P2}
  25. #> Rule 12: {P1, P2, P3, P6} -> {P4, P5}

All these functions work natively with fuzzy and with binary datasets.

For more details on the methods implemented and further examples, see
the vignettes in this package.

Changelog

With respect to the CRAN version, the development version has the
following changes.

fcaR 1.2.2

Enhancements:

  • Added more unit tests.
  • Minor changes to the plotting of formal contexts.
  • Now the fc$scale() function admits a new argument bg (default:
    FALSE) which, if set to TRUE, avoids computing the background
    knowledge of the scales.

fcaR 1.2.1

Enhancements:

  • Other logics have been implemented. Now, we can use fc$use_logic()
    to select one of the available_logics().
  • Improved export to LaTeX.

Bugfixes:

  • Some rounding errors might induce errors in the computations. These
    has been fixed.

fcaR 1.2.0

Bugfixes:

  • Fixes required by the new version of Matrix and the new use of HTML
    Tidy in R 4.2.

fcaR 1.1.1

Enhancements:

  • The user can control the number of decimal digits when exporting to
    LaTeX or when printing formal contexts, concept lattices and
    implications. Just use fcaR_options(decimal_places = n), where n is
    the number of desired decimal digits.

New functionality:

  • Now the package uses the settings package to manage several options.
    Currently, the only option is the number of decimal digits to use when
    printing or exporting to LaTeX.

Bugfixes:

  • Fixed exporting to latex with special characters such as \$, _, etc.

References

Guigues J, Duquenne V (1986). “Familles minimales d’implications
informatives résultant d’un tableau de données binaires.” Mathématiques
et Sciences humaines, 95, 5-18.

Ganter B, Wille R (1999). Formal concept analysis : mathematical
foundations. Springer. ISBN 3540627715.

Cordero P, Enciso M, Mora Á, Pérez de Guzman I (2002). “SLFD Logic:
Elimination of Data Redundancy in Knowledge Representation.” Advances
in Artificial Intelligence - IBERAMIA 2002, 2527, 141-150. doi:
10.1007/3-540-36131-6_15 (URL:
https://doi.org/10.1007/3-540-36131-6_15).

Belohlavek R (2002). “Algorithms for fuzzy concept lattices.” In Proc.
Fourth Int. Conf. on Recent Advances in Soft Computing. Nottingham,
United Kingdom, 200-205.

Hahsler M, Grun B, Hornik K (2005). “arules - a computational
environment for mining association rules and frequent item sets.” J
Stat Softw, 14, 1-25.

Mora A, Cordero P, Enciso M, Fortes I, Aguilera G (2012). “Closure via
functional dependence simplification.” International Journal of
Computer Mathematics, 89(4), 510-526.

Belohlavek R, Cordero P, Enciso M, Mora Á, Vychodil V (2016). “Automated
prover for attribute dependencies in data with grades.” International
Journal of Approximate Reasoning, 70, 51-67.